YES This is Ultimate 0.2.2-dev-e7f90c1-m [2023-02-13 03:41:00,962 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-13 03:41:00,964 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-13 03:41:00,978 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-13 03:41:00,979 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-13 03:41:00,979 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-13 03:41:00,980 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-13 03:41:00,981 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-13 03:41:00,982 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-13 03:41:00,982 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-13 03:41:00,983 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-13 03:41:00,983 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-13 03:41:00,983 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-13 03:41:00,984 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-13 03:41:00,984 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-13 03:41:00,985 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-13 03:41:00,985 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-13 03:41:00,986 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-13 03:41:00,987 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-13 03:41:00,987 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-13 03:41:00,988 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2023-02-13 03:41:00,989 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-13 03:41:00,989 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-13 03:41:00,990 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-13 03:41:00,990 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-13 03:41:00,992 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-13 03:41:00,992 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-13 03:41:00,992 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-13 03:41:00,992 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-13 03:41:00,993 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-13 03:41:00,993 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-13 03:41:00,993 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-13 03:41:00,994 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-13 03:41:00,994 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-13 03:41:00,994 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-13 03:41:00,995 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-13 03:41:00,995 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-13 03:41:00,995 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-13 03:41:00,995 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-13 03:41:00,995 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-13 03:41:00,996 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-13 03:41:00,996 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-13 03:41:00,996 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/Ultimate/./../termcomp2017.epf [2023-02-13 03:41:01,007 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-13 03:41:01,007 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-13 03:41:01,008 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-13 03:41:01,008 INFO L138 SettingsManager]: * Rewrite not-equals=true [2023-02-13 03:41:01,008 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-13 03:41:01,008 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2023-02-13 03:41:01,008 INFO L138 SettingsManager]: * Use SBE=true [2023-02-13 03:41:01,008 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-02-13 03:41:01,008 INFO L138 SettingsManager]: * Use old map elimination=false [2023-02-13 03:41:01,008 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2023-02-13 03:41:01,008 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2023-02-13 03:41:01,008 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2023-02-13 03:41:01,009 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-02-13 03:41:01,009 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2023-02-13 03:41:01,009 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:01,009 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-13 03:41:01,009 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-13 03:41:01,009 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-13 03:41:01,009 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-13 03:41:01,009 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-02-13 03:41:01,009 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2023-02-13 03:41:01,009 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-13 03:41:01,009 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-13 03:41:01,009 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2023-02-13 03:41:01,010 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2023-02-13 03:41:01,010 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-13 03:41:01,010 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-13 03:41:01,010 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-13 03:41:01,010 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/export/starexec/sandbox/solver/Ultimate/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-02-13 03:41:01,149 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-13 03:41:01,162 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-13 03:41:01,163 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-13 03:41:01,164 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-13 03:41:01,164 INFO L275 PluginConnector]: CDTParser initialized [2023-02-13 03:41:01,165 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2023-02-13 03:41:01,197 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/ebdb3830d17d4f41b1f5974c74aafef5/FLAGbeda74a9d [2023-02-13 03:41:01,648 INFO L306 CDTParser]: Found 1 translation units. [2023-02-13 03:41:01,648 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2023-02-13 03:41:01,655 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/ebdb3830d17d4f41b1f5974c74aafef5/FLAGbeda74a9d [2023-02-13 03:41:01,675 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/ebdb3830d17d4f41b1f5974c74aafef5 [2023-02-13 03:41:01,678 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-13 03:41:01,680 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2023-02-13 03:41:01,681 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-13 03:41:01,682 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-13 03:41:01,684 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-13 03:41:01,685 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.02 03:41:01" (1/1) ... [2023-02-13 03:41:01,686 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77342b16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 03:41:01, skipping insertion in model container [2023-02-13 03:41:01,686 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.02 03:41:01" (1/1) ... [2023-02-13 03:41:01,697 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-13 03:41:01,712 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-13 03:41:01,808 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-13 03:41:01,810 INFO L203 MainTranslator]: Completed pre-run [2023-02-13 03:41:01,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-13 03:41:01,823 INFO L208 MainTranslator]: Completed translation [2023-02-13 03:41:01,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 03:41:01 WrapperNode [2023-02-13 03:41:01,823 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-13 03:41:01,824 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-13 03:41:01,824 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-13 03:41:01,824 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-13 03:41:01,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 03:41:01" (1/1) ... [2023-02-13 03:41:01,840 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 03:41:01" (1/1) ... [2023-02-13 03:41:01,857 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 18 [2023-02-13 03:41:01,858 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-13 03:41:01,858 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-13 03:41:01,858 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-13 03:41:01,858 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-13 03:41:01,864 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 03:41:01" (1/1) ... [2023-02-13 03:41:01,864 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 03:41:01" (1/1) ... [2023-02-13 03:41:01,864 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 03:41:01" (1/1) ... [2023-02-13 03:41:01,864 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 03:41:01" (1/1) ... [2023-02-13 03:41:01,865 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 03:41:01" (1/1) ... [2023-02-13 03:41:01,868 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 03:41:01" (1/1) ... [2023-02-13 03:41:01,868 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 03:41:01" (1/1) ... [2023-02-13 03:41:01,869 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-13 03:41:01,869 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-13 03:41:01,869 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-13 03:41:01,869 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-13 03:41:01,870 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 03:41:01" (1/1) ... [2023-02-13 03:41:01,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2023-02-13 03:41:01,889 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:01,904 INFO L229 MonitoredProcess]: Starting monitored process 1 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:01,908 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (1)] Waiting until timeout for monitored process [2023-02-13 03:41:01,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-13 03:41:01,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-13 03:41:02,045 INFO L234 CfgBuilder]: Building ICFG [2023-02-13 03:41:02,046 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-13 03:41:02,114 INFO L275 CfgBuilder]: Performing block encoding [2023-02-13 03:41:02,124 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-13 03:41:02,124 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-13 03:41:02,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.02 03:41:02 BoogieIcfgContainer [2023-02-13 03:41:02,126 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-13 03:41:02,127 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2023-02-13 03:41:02,127 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2023-02-13 03:41:02,129 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2023-02-13 03:41:02,130 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.02 03:41:02" (1/1) ... [2023-02-13 03:41:02,141 INFO L313 BlockEncoder]: Initial Icfg 8 locations, 10 edges [2023-02-13 03:41:02,142 INFO L258 BlockEncoder]: Using Remove infeasible edges [2023-02-13 03:41:02,143 INFO L263 BlockEncoder]: Using Maximize final states [2023-02-13 03:41:02,143 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2023-02-13 03:41:02,143 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2023-02-13 03:41:02,144 INFO L296 BlockEncoder]: Using Remove sink states [2023-02-13 03:41:02,144 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2023-02-13 03:41:02,144 INFO L179 BlockEncoder]: Using Rewrite not-equals [2023-02-13 03:41:02,151 INFO L185 BlockEncoder]: Using Use SBE [2023-02-13 03:41:02,154 INFO L200 BlockEncoder]: SBE split 0 edges [2023-02-13 03:41:02,156 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2023-02-13 03:41:02,157 INFO L71 MaximizeFinalStates]: 0 new accepting states [2023-02-13 03:41:02,162 INFO L101 BaseMinimizeStates]: Removed 8 edges and 4 locations by large block encoding [2023-02-13 03:41:02,163 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2023-02-13 03:41:02,163 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2023-02-13 03:41:02,163 INFO L71 MaximizeFinalStates]: 0 new accepting states [2023-02-13 03:41:02,164 INFO L101 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2023-02-13 03:41:02,164 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2023-02-13 03:41:02,164 INFO L313 BlockEncoder]: Encoded RCFG 3 locations, 4 edges [2023-02-13 03:41:02,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 13.02 03:41:02 BasicIcfg [2023-02-13 03:41:02,164 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2023-02-13 03:41:02,165 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-13 03:41:02,165 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-13 03:41:02,167 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-13 03:41:02,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.02 03:41:01" (1/4) ... [2023-02-13 03:41:02,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7192c17b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.02 03:41:02, skipping insertion in model container [2023-02-13 03:41:02,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 03:41:01" (2/4) ... [2023-02-13 03:41:02,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7192c17b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.02 03:41:02, skipping insertion in model container [2023-02-13 03:41:02,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.02 03:41:02" (3/4) ... [2023-02-13 03:41:02,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7192c17b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.02 03:41:02, skipping insertion in model container [2023-02-13 03:41:02,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 13.02 03:41:02" (4/4) ... [2023-02-13 03:41:02,169 INFO L111 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2023-02-13 03:41:02,179 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2023-02-13 03:41:02,179 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 0 error locations. [2023-02-13 03:41:02,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7192c17b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.02 03:41:02, skipping insertion in model container [2023-02-13 03:41:02,180 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-13 03:41:02,180 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-02-13 03:41:02,180 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2023-02-13 03:41:02,182 INFO L275 PluginConnector]: BuchiAutomizer initialized [2023-02-13 03:41:02,182 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-13 03:41:02,183 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.02 03:41:01" (1/4) ... [2023-02-13 03:41:02,183 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@216eda41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.02 03:41:02, skipping insertion in model container [2023-02-13 03:41:02,183 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-13 03:41:02,183 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 03:41:01" (2/4) ... [2023-02-13 03:41:02,183 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@216eda41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.02 03:41:02, skipping insertion in model container [2023-02-13 03:41:02,183 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-13 03:41:02,183 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.02 03:41:02" (3/4) ... [2023-02-13 03:41:02,184 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@216eda41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.02 03:41:02, skipping insertion in model container [2023-02-13 03:41:02,184 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-13 03:41:02,184 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 13.02 03:41:02" (4/4) ... [2023-02-13 03:41:02,184 INFO L322 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2023-02-13 03:41:02,211 INFO L301 stractBuchiCegarLoop]: Interprodecural is true [2023-02-13 03:41:02,211 INFO L302 stractBuchiCegarLoop]: Hoare is true [2023-02-13 03:41:02,211 INFO L303 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-02-13 03:41:02,211 INFO L304 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-02-13 03:41:02,211 INFO L305 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-02-13 03:41:02,212 INFO L306 stractBuchiCegarLoop]: Difference is false [2023-02-13 03:41:02,212 INFO L307 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-02-13 03:41:02,212 INFO L311 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-02-13 03:41:02,214 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:02,224 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-13 03:41:02,224 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-13 03:41:02,224 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-13 03:41:02,227 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2023-02-13 03:41:02,227 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-13 03:41:02,227 INFO L333 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-02-13 03:41:02,227 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:02,228 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-13 03:41:02,228 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-13 03:41:02,228 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-13 03:41:02,228 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2023-02-13 03:41:02,228 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-13 03:41:02,231 INFO L733 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue [37] ULTIMATE.startENTRY-->L12-2: Formula: (= |v_ULTIMATE.start_main_~c~0#1_10| 1) InVars {} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_8|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_10|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_4|, ULTIMATE.start_main_#t~nondet0#1=|v_ULTIMATE.start_main_#t~nondet0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet0#1] 2#L12-2true [2023-02-13 03:41:02,231 INFO L735 eck$LassoCheckResult]: Loop: 2#L12-2true [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 4#L12true [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 2#L12-2true [2023-02-13 03:41:02,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:02,235 INFO L85 PathProgramCache]: Analyzing trace with hash 68, now seen corresponding path program 1 times [2023-02-13 03:41:02,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:02,241 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132887351] [2023-02-13 03:41:02,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:02,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:02,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:02,286 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:41:02,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:02,296 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:41:02,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:02,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1830, now seen corresponding path program 1 times [2023-02-13 03:41:02,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:02,298 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977961122] [2023-02-13 03:41:02,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:02,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:02,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:02,305 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:41:02,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:02,307 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:41:02,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:02,308 INFO L85 PathProgramCache]: Analyzing trace with hash 66217, now seen corresponding path program 1 times [2023-02-13 03:41:02,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:02,309 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952131728] [2023-02-13 03:41:02,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:02,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:02,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:02,313 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:41:02,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:02,316 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:41:02,366 INFO L210 LassoAnalysis]: Preferences: [2023-02-13 03:41:02,366 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-13 03:41:02,366 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-13 03:41:02,366 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-13 03:41:02,366 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-13 03:41:02,367 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:02,367 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-13 03:41:02,367 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-13 03:41:02,367 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2023-02-13 03:41:02,367 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-13 03:41:02,367 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-13 03:41:02,376 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:02,382 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:02,384 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:02,388 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:02,428 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-13 03:41:02,428 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-13 03:41:02,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:02,430 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:02,430 INFO L229 MonitoredProcess]: Starting monitored process 2 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:02,432 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-02-13 03:41:02,432 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:41:02,432 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:02,443 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-13 03:41:02,443 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-13 03:41:02,459 INFO L540 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-02-13 03:41:02,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:02,459 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:02,460 INFO L229 MonitoredProcess]: Starting monitored process 3 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:02,462 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-02-13 03:41:02,462 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:41:02,462 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:02,475 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-13 03:41:02,475 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-13 03:41:02,504 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2023-02-13 03:41:02,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:02,505 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:02,507 INFO L229 MonitoredProcess]: Starting monitored process 4 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:02,509 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-02-13 03:41:02,509 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:41:02,510 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:02,556 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2023-02-13 03:41:02,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:02,558 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:02,559 INFO L229 MonitoredProcess]: Starting monitored process 5 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:02,561 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-02-13 03:41:02,562 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-13 03:41:02,562 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:02,600 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-13 03:41:02,602 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2023-02-13 03:41:02,602 INFO L210 LassoAnalysis]: Preferences: [2023-02-13 03:41:02,603 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-13 03:41:02,603 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-13 03:41:02,603 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-13 03:41:02,604 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-13 03:41:02,604 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:41:02,604 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-13 03:41:02,604 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-13 03:41:02,605 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2023-02-13 03:41:02,605 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-13 03:41:02,605 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-13 03:41:02,609 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:02,615 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:02,620 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:02,628 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:02,676 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-13 03:41:02,680 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-13 03:41:02,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:41:02,681 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:02,681 INFO L229 MonitoredProcess]: Starting monitored process 6 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:02,683 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-02-13 03:41:02,683 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-13 03:41:02,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-13 03:41:02,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-13 03:41:02,687 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-13 03:41:02,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-13 03:41:02,690 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-13 03:41:02,690 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-13 03:41:02,702 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-13 03:41:02,716 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2023-02-13 03:41:02,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:41:02,716 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:02,717 INFO L229 MonitoredProcess]: Starting monitored process 7 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:02,718 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-02-13 03:41:02,718 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-13 03:41:02,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-13 03:41:02,723 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-13 03:41:02,723 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-13 03:41:02,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-13 03:41:02,725 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-13 03:41:02,725 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-13 03:41:02,728 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-13 03:41:02,742 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2023-02-13 03:41:02,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:41:02,743 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:02,745 INFO L229 MonitoredProcess]: Starting monitored process 8 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:02,747 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-02-13 03:41:02,747 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-13 03:41:02,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-13 03:41:02,752 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-13 03:41:02,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-13 03:41:02,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-13 03:41:02,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-13 03:41:02,756 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-13 03:41:02,757 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-13 03:41:02,759 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-13 03:41:02,763 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2023-02-13 03:41:02,763 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-13 03:41:02,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:41:02,765 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:02,766 INFO L229 MonitoredProcess]: Starting monitored process 9 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:02,768 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-02-13 03:41:02,769 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-13 03:41:02,770 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-13 03:41:02,770 INFO L513 LassoAnalysis]: Proved termination. [2023-02-13 03:41:02,770 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0#1) = 1*ULTIMATE.start_main_~c~0#1 Supporting invariants [] [2023-02-13 03:41:02,797 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2023-02-13 03:41:02,799 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-13 03:41:02,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:02,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:02,846 WARN L261 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-13 03:41:02,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:02,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:02,862 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:41:02,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:02,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:41:02,903 INFO L100 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization [2023-02-13 03:41:02,906 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-02-13 03:41:02,907 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:02,937 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 11 states and 16 transitions. Complement of second has 7 states. [2023-02-13 03:41:02,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 2 accepting loop states [2023-02-13 03:41:02,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:02,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2023-02-13 03:41:02,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 1 letters. Loop has 2 letters. [2023-02-13 03:41:02,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:41:02,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 3 letters. Loop has 2 letters. [2023-02-13 03:41:02,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:41:02,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 1 letters. Loop has 4 letters. [2023-02-13 03:41:02,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:41:02,948 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 16 transitions. [2023-02-13 03:41:02,948 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-02-13 03:41:02,950 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 9 states and 13 transitions. [2023-02-13 03:41:02,951 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2023-02-13 03:41:02,951 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2023-02-13 03:41:02,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 13 transitions. [2023-02-13 03:41:02,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-13 03:41:02,951 INFO L220 hiAutomatonCegarLoop]: Abstraction has 9 states and 13 transitions. [2023-02-13 03:41:02,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 13 transitions. [2023-02-13 03:41:02,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 7. [2023-02-13 03:41:02,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:02,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2023-02-13 03:41:02,966 INFO L242 hiAutomatonCegarLoop]: Abstraction has 7 states and 10 transitions. [2023-02-13 03:41:02,966 INFO L426 stractBuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2023-02-13 03:41:02,966 INFO L333 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-02-13 03:41:02,966 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2023-02-13 03:41:02,967 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-02-13 03:41:02,967 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-13 03:41:02,967 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-13 03:41:02,967 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-02-13 03:41:02,967 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-13 03:41:02,967 INFO L733 eck$LassoCheckResult]: Stem: 58#ULTIMATE.startENTRY [37] ULTIMATE.startENTRY-->L12-2: Formula: (= |v_ULTIMATE.start_main_~c~0#1_10| 1) InVars {} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_8|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_10|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_4|, ULTIMATE.start_main_#t~nondet0#1=|v_ULTIMATE.start_main_#t~nondet0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet0#1] 59#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 57#L12 [36] L12-->L12-2: Formula: (and (>= 100 |v_ULTIMATE.start_main_~x~0#1_2|) (= |v_ULTIMATE.start_main_~c~0#1_1| (+ |v_ULTIMATE.start_main_~c~0#1_2| 1)) (= (+ |v_ULTIMATE.start_main_~x~0#1_2| 11) |v_ULTIMATE.start_main_~x~0#1_1|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_2|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 53#L12-2 [2023-02-13 03:41:02,967 INFO L735 eck$LassoCheckResult]: Loop: 53#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 54#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 53#L12-2 [2023-02-13 03:41:02,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:02,968 INFO L85 PathProgramCache]: Analyzing trace with hash 66221, now seen corresponding path program 1 times [2023-02-13 03:41:02,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:02,968 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661423230] [2023-02-13 03:41:02,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:02,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:02,971 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:41:02,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:02,974 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:41:02,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:02,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1830, now seen corresponding path program 2 times [2023-02-13 03:41:02,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:02,975 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718887107] [2023-02-13 03:41:02,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:02,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:02,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:02,978 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:41:02,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:02,980 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:41:02,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:02,981 INFO L85 PathProgramCache]: Analyzing trace with hash 63639250, now seen corresponding path program 1 times [2023-02-13 03:41:02,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:02,981 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249327582] [2023-02-13 03:41:02,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:02,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:02,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:02,985 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:41:02,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:02,988 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:41:03,001 INFO L210 LassoAnalysis]: Preferences: [2023-02-13 03:41:03,001 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-13 03:41:03,002 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-13 03:41:03,002 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-13 03:41:03,002 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-13 03:41:03,002 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:03,002 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-13 03:41:03,002 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-13 03:41:03,002 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2023-02-13 03:41:03,002 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-13 03:41:03,002 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-13 03:41:03,003 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:03,005 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:03,007 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:03,009 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:03,031 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-13 03:41:03,032 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-13 03:41:03,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:03,032 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:03,033 INFO L229 MonitoredProcess]: Starting monitored process 10 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:03,036 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-02-13 03:41:03,037 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:41:03,037 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:03,045 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-13 03:41:03,045 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-13 03:41:03,059 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2023-02-13 03:41:03,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:03,060 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:03,060 INFO L229 MonitoredProcess]: Starting monitored process 11 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:03,061 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-02-13 03:41:03,062 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:41:03,062 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:03,093 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2023-02-13 03:41:03,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:03,094 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:03,095 INFO L229 MonitoredProcess]: Starting monitored process 12 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:03,096 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-02-13 03:41:03,097 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-13 03:41:03,097 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:03,121 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-13 03:41:03,124 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2023-02-13 03:41:03,124 INFO L210 LassoAnalysis]: Preferences: [2023-02-13 03:41:03,125 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-13 03:41:03,125 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-13 03:41:03,125 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-13 03:41:03,125 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-13 03:41:03,126 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:41:03,126 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-13 03:41:03,126 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-13 03:41:03,126 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2023-02-13 03:41:03,127 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-13 03:41:03,127 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-13 03:41:03,129 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:03,134 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:03,144 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:03,147 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:03,205 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-13 03:41:03,205 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-13 03:41:03,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:41:03,206 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:03,207 INFO L229 MonitoredProcess]: Starting monitored process 13 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:03,209 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-02-13 03:41:03,210 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-13 03:41:03,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-13 03:41:03,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-13 03:41:03,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-13 03:41:03,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-13 03:41:03,218 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-13 03:41:03,218 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-13 03:41:03,221 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-13 03:41:03,241 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2023-02-13 03:41:03,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:41:03,242 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:03,243 INFO L229 MonitoredProcess]: Starting monitored process 14 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:03,245 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-02-13 03:41:03,246 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-13 03:41:03,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-13 03:41:03,251 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-13 03:41:03,251 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-13 03:41:03,251 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-13 03:41:03,251 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-13 03:41:03,252 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-13 03:41:03,252 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-13 03:41:03,261 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-13 03:41:03,266 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2023-02-13 03:41:03,266 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-13 03:41:03,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:41:03,266 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:03,268 INFO L229 MonitoredProcess]: Starting monitored process 15 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:03,275 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-02-13 03:41:03,277 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-13 03:41:03,277 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-13 03:41:03,278 INFO L513 LassoAnalysis]: Proved termination. [2023-02-13 03:41:03,278 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0#1) = 1*ULTIMATE.start_main_~c~0#1 Supporting invariants [] [2023-02-13 03:41:03,311 INFO L540 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-02-13 03:41:03,312 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-13 03:41:03,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:03,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:03,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-13 03:41:03,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:03,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:03,341 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:41:03,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:03,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:41:03,354 INFO L100 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization [2023-02-13 03:41:03,354 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-02-13 03:41:03,355 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:03,367 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 7 states and 10 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 15 states and 21 transitions. Complement of second has 10 states. [2023-02-13 03:41:03,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-02-13 03:41:03,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:03,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2023-02-13 03:41:03,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 3 letters. Loop has 2 letters. [2023-02-13 03:41:03,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:41:03,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 5 letters. Loop has 2 letters. [2023-02-13 03:41:03,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:41:03,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 3 letters. Loop has 4 letters. [2023-02-13 03:41:03,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:41:03,369 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 21 transitions. [2023-02-13 03:41:03,370 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2023-02-13 03:41:03,370 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 12 states and 17 transitions. [2023-02-13 03:41:03,370 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2023-02-13 03:41:03,370 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2023-02-13 03:41:03,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2023-02-13 03:41:03,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-13 03:41:03,371 INFO L220 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2023-02-13 03:41:03,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2023-02-13 03:41:03,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 5. [2023-02-13 03:41:03,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:03,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2023-02-13 03:41:03,372 INFO L242 hiAutomatonCegarLoop]: Abstraction has 5 states and 7 transitions. [2023-02-13 03:41:03,372 INFO L426 stractBuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2023-02-13 03:41:03,372 INFO L333 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-02-13 03:41:03,372 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 7 transitions. [2023-02-13 03:41:03,372 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-02-13 03:41:03,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-13 03:41:03,372 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-13 03:41:03,372 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2023-02-13 03:41:03,372 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-13 03:41:03,373 INFO L733 eck$LassoCheckResult]: Stem: 121#ULTIMATE.startENTRY [37] ULTIMATE.startENTRY-->L12-2: Formula: (= |v_ULTIMATE.start_main_~c~0#1_10| 1) InVars {} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_8|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_10|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_4|, ULTIMATE.start_main_#t~nondet0#1=|v_ULTIMATE.start_main_#t~nondet0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet0#1] 117#L12-2 [2023-02-13 03:41:03,373 INFO L735 eck$LassoCheckResult]: Loop: 117#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 119#L12 [36] L12-->L12-2: Formula: (and (>= 100 |v_ULTIMATE.start_main_~x~0#1_2|) (= |v_ULTIMATE.start_main_~c~0#1_1| (+ |v_ULTIMATE.start_main_~c~0#1_2| 1)) (= (+ |v_ULTIMATE.start_main_~x~0#1_2| 11) |v_ULTIMATE.start_main_~x~0#1_1|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_2|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 117#L12-2 [2023-02-13 03:41:03,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:03,373 INFO L85 PathProgramCache]: Analyzing trace with hash 68, now seen corresponding path program 2 times [2023-02-13 03:41:03,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:03,373 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911527798] [2023-02-13 03:41:03,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:03,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:03,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:03,376 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:41:03,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:03,377 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:41:03,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:03,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1834, now seen corresponding path program 1 times [2023-02-13 03:41:03,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:03,378 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708209807] [2023-02-13 03:41:03,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:03,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:03,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:03,380 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:41:03,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:03,382 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:41:03,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:03,383 INFO L85 PathProgramCache]: Analyzing trace with hash 66221, now seen corresponding path program 2 times [2023-02-13 03:41:03,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:03,383 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164362805] [2023-02-13 03:41:03,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:03,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:03,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:03,385 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:41:03,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:03,387 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:41:03,399 INFO L210 LassoAnalysis]: Preferences: [2023-02-13 03:41:03,399 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-13 03:41:03,399 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-13 03:41:03,399 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-13 03:41:03,399 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-13 03:41:03,399 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:03,399 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-13 03:41:03,399 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-13 03:41:03,399 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2023-02-13 03:41:03,399 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-13 03:41:03,399 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-13 03:41:03,400 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:03,402 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:03,404 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:03,406 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:03,427 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-13 03:41:03,427 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-13 03:41:03,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:03,428 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:03,434 INFO L229 MonitoredProcess]: Starting monitored process 16 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:03,435 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-02-13 03:41:03,436 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:41:03,437 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:03,459 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2023-02-13 03:41:03,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:03,460 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:03,460 INFO L229 MonitoredProcess]: Starting monitored process 17 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:03,461 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-02-13 03:41:03,462 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-13 03:41:03,462 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:03,487 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-13 03:41:03,488 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2023-02-13 03:41:03,488 INFO L210 LassoAnalysis]: Preferences: [2023-02-13 03:41:03,488 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-13 03:41:03,489 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-13 03:41:03,489 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-13 03:41:03,489 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-13 03:41:03,489 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:41:03,489 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-13 03:41:03,489 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-13 03:41:03,489 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2023-02-13 03:41:03,489 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-13 03:41:03,489 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-13 03:41:03,490 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:03,497 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:03,502 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:03,505 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:03,536 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-13 03:41:03,537 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-13 03:41:03,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:41:03,537 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:03,538 INFO L229 MonitoredProcess]: Starting monitored process 18 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:03,539 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-02-13 03:41:03,540 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-13 03:41:03,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-13 03:41:03,544 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-13 03:41:03,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-13 03:41:03,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-13 03:41:03,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-13 03:41:03,545 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-13 03:41:03,545 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-13 03:41:03,547 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-13 03:41:03,551 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-13 03:41:03,551 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-13 03:41:03,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:41:03,551 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:03,552 INFO L229 MonitoredProcess]: Starting monitored process 19 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:03,556 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-02-13 03:41:03,556 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-13 03:41:03,557 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-13 03:41:03,557 INFO L513 LassoAnalysis]: Proved termination. [2023-02-13 03:41:03,557 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1) = -2*ULTIMATE.start_main_~x~0#1 + 211 Supporting invariants [] [2023-02-13 03:41:03,588 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2023-02-13 03:41:03,589 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-13 03:41:03,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:03,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:03,608 WARN L261 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-13 03:41:03,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:03,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:03,611 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:41:03,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:03,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:41:03,614 INFO L100 LoopCannibalizer]: 1 predicates before loop cannibalization 1 predicates after loop cannibalization [2023-02-13 03:41:03,615 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-02-13 03:41:03,615 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 5 states and 7 transitions. cyclomatic complexity: 3 Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:03,625 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 5 states and 7 transitions. cyclomatic complexity: 3. Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 11 states and 17 transitions. Complement of second has 4 states. [2023-02-13 03:41:03,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-02-13 03:41:03,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:03,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2023-02-13 03:41:03,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 1 letters. Loop has 2 letters. [2023-02-13 03:41:03,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:41:03,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 3 letters. Loop has 2 letters. [2023-02-13 03:41:03,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:41:03,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 1 letters. Loop has 4 letters. [2023-02-13 03:41:03,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:41:03,631 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 17 transitions. [2023-02-13 03:41:03,632 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-02-13 03:41:03,633 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 9 states and 13 transitions. [2023-02-13 03:41:03,634 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2023-02-13 03:41:03,634 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2023-02-13 03:41:03,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 13 transitions. [2023-02-13 03:41:03,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-13 03:41:03,634 INFO L220 hiAutomatonCegarLoop]: Abstraction has 9 states and 13 transitions. [2023-02-13 03:41:03,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 13 transitions. [2023-02-13 03:41:03,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2023-02-13 03:41:03,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:03,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2023-02-13 03:41:03,637 INFO L242 hiAutomatonCegarLoop]: Abstraction has 8 states and 12 transitions. [2023-02-13 03:41:03,637 INFO L426 stractBuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2023-02-13 03:41:03,637 INFO L333 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-02-13 03:41:03,637 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 12 transitions. [2023-02-13 03:41:03,638 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-02-13 03:41:03,638 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-13 03:41:03,638 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-13 03:41:03,640 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1] [2023-02-13 03:41:03,640 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-13 03:41:03,640 INFO L733 eck$LassoCheckResult]: Stem: 164#ULTIMATE.startENTRY [37] ULTIMATE.startENTRY-->L12-2: Formula: (= |v_ULTIMATE.start_main_~c~0#1_10| 1) InVars {} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_8|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_10|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_4|, ULTIMATE.start_main_#t~nondet0#1=|v_ULTIMATE.start_main_#t~nondet0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet0#1] 160#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 161#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 167#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 165#L12 [2023-02-13 03:41:03,641 INFO L735 eck$LassoCheckResult]: Loop: 165#L12 [36] L12-->L12-2: Formula: (and (>= 100 |v_ULTIMATE.start_main_~x~0#1_2|) (= |v_ULTIMATE.start_main_~c~0#1_1| (+ |v_ULTIMATE.start_main_~c~0#1_2| 1)) (= (+ |v_ULTIMATE.start_main_~x~0#1_2| 11) |v_ULTIMATE.start_main_~x~0#1_1|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_2|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 166#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 165#L12 [2023-02-13 03:41:03,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:03,641 INFO L85 PathProgramCache]: Analyzing trace with hash 2052754, now seen corresponding path program 2 times [2023-02-13 03:41:03,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:03,642 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684754435] [2023-02-13 03:41:03,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:03,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:03,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:03,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:41:03,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 03:41:03,673 INFO L335 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684754435] [2023-02-13 03:41:03,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684754435] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 03:41:03,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 03:41:03,674 ERROR L191 FreeRefinementEngine]: {169#true} [171#(<= |ULTIMATE.start_main_~c~0#1| 1), 171#(<= |ULTIMATE.start_main_~c~0#1| 1), 172#(<= |ULTIMATE.start_main_~c~0#1| 0)] {170#false} [2023-02-13 03:41:03,674 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-13 03:41:03,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63805080] [2023-02-13 03:41:03,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 03:41:03,677 INFO L738 eck$LassoCheckResult]: stem already infeasible [2023-02-13 03:41:03,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:03,678 INFO L85 PathProgramCache]: Analyzing trace with hash 2104, now seen corresponding path program 2 times [2023-02-13 03:41:03,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:03,679 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572045177] [2023-02-13 03:41:03,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:03,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:03,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:03,684 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:41:03,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:03,687 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:41:03,705 INFO L210 LassoAnalysis]: Preferences: [2023-02-13 03:41:03,706 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-13 03:41:03,706 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-13 03:41:03,706 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-13 03:41:03,706 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-13 03:41:03,706 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:03,706 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-13 03:41:03,706 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-13 03:41:03,707 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2023-02-13 03:41:03,707 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-13 03:41:03,707 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-13 03:41:03,708 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:03,714 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:03,717 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:03,722 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:03,753 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-13 03:41:03,754 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-13 03:41:03,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:03,754 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:03,755 INFO L229 MonitoredProcess]: Starting monitored process 20 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:03,763 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-02-13 03:41:03,764 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:41:03,764 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:03,799 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2023-02-13 03:41:03,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:03,800 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:03,801 INFO L229 MonitoredProcess]: Starting monitored process 21 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:03,804 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-02-13 03:41:03,804 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-13 03:41:03,805 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:03,841 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-13 03:41:03,842 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2023-02-13 03:41:03,842 INFO L210 LassoAnalysis]: Preferences: [2023-02-13 03:41:03,843 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-13 03:41:03,843 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-13 03:41:03,843 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-13 03:41:03,843 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-13 03:41:03,843 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:41:03,844 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-13 03:41:03,844 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-13 03:41:03,844 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2023-02-13 03:41:03,844 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-13 03:41:03,844 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-13 03:41:03,845 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:03,849 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:03,852 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:03,857 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:03,897 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-13 03:41:03,897 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-13 03:41:03,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:41:03,898 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:03,899 INFO L229 MonitoredProcess]: Starting monitored process 22 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:03,901 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-02-13 03:41:03,904 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-13 03:41:03,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-13 03:41:03,914 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-13 03:41:03,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-13 03:41:03,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-13 03:41:03,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-13 03:41:03,917 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-13 03:41:03,917 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-13 03:41:03,921 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-13 03:41:03,924 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-13 03:41:03,924 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-13 03:41:03,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:41:03,925 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:03,927 INFO L229 MonitoredProcess]: Starting monitored process 23 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:03,929 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-02-13 03:41:03,930 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-13 03:41:03,930 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-13 03:41:03,930 INFO L513 LassoAnalysis]: Proved termination. [2023-02-13 03:41:03,930 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1) = -2*ULTIMATE.start_main_~x~0#1 + 211 Supporting invariants [] [2023-02-13 03:41:03,965 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2023-02-13 03:41:03,966 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-13 03:41:03,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:03,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:03,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-13 03:41:03,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:04,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:04,005 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:41:04,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:04,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:41:04,057 INFO L100 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2023-02-13 03:41:04,057 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2023-02-13 03:41:04,058 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:04,068 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 8 states and 12 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 16 states and 20 transitions. Complement of second has 4 states. [2023-02-13 03:41:04,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-02-13 03:41:04,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:04,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2023-02-13 03:41:04,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 2 letters. [2023-02-13 03:41:04,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:41:04,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2023-02-13 03:41:04,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:41:04,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 4 letters. [2023-02-13 03:41:04,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:41:04,072 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2023-02-13 03:41:04,073 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2023-02-13 03:41:04,075 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 12 states and 16 transitions. [2023-02-13 03:41:04,075 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2023-02-13 03:41:04,075 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2023-02-13 03:41:04,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2023-02-13 03:41:04,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-13 03:41:04,076 INFO L220 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2023-02-13 03:41:04,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2023-02-13 03:41:04,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 7. [2023-02-13 03:41:04,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:04,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2023-02-13 03:41:04,078 INFO L242 hiAutomatonCegarLoop]: Abstraction has 7 states and 10 transitions. [2023-02-13 03:41:04,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 03:41:04,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-13 03:41:04,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-13 03:41:04,084 INFO L87 Difference]: Start difference. First operand 7 states and 10 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:04,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 03:41:04,105 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2023-02-13 03:41:04,105 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 12 transitions. [2023-02-13 03:41:04,106 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-02-13 03:41:04,107 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 8 states and 10 transitions. [2023-02-13 03:41:04,107 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2023-02-13 03:41:04,107 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2023-02-13 03:41:04,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2023-02-13 03:41:04,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-13 03:41:04,107 INFO L220 hiAutomatonCegarLoop]: Abstraction has 8 states and 10 transitions. [2023-02-13 03:41:04,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2023-02-13 03:41:04,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2023-02-13 03:41:04,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:04,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2023-02-13 03:41:04,110 INFO L242 hiAutomatonCegarLoop]: Abstraction has 7 states and 9 transitions. [2023-02-13 03:41:04,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-13 03:41:04,114 INFO L426 stractBuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2023-02-13 03:41:04,114 INFO L333 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-02-13 03:41:04,115 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2023-02-13 03:41:04,115 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-02-13 03:41:04,115 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-13 03:41:04,116 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-13 03:41:04,129 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 1, 1, 1] [2023-02-13 03:41:04,129 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2023-02-13 03:41:04,130 INFO L733 eck$LassoCheckResult]: Stem: 244#ULTIMATE.startENTRY [37] ULTIMATE.startENTRY-->L12-2: Formula: (= |v_ULTIMATE.start_main_~c~0#1_10| 1) InVars {} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_8|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_10|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_4|, ULTIMATE.start_main_#t~nondet0#1=|v_ULTIMATE.start_main_#t~nondet0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet0#1] 240#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 241#L12 [36] L12-->L12-2: Formula: (and (>= 100 |v_ULTIMATE.start_main_~x~0#1_2|) (= |v_ULTIMATE.start_main_~c~0#1_1| (+ |v_ULTIMATE.start_main_~c~0#1_2| 1)) (= (+ |v_ULTIMATE.start_main_~x~0#1_2| 11) |v_ULTIMATE.start_main_~x~0#1_1|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_2|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 242#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 243#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 246#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 245#L12 [2023-02-13 03:41:04,130 INFO L735 eck$LassoCheckResult]: Loop: 245#L12 [36] L12-->L12-2: Formula: (and (>= 100 |v_ULTIMATE.start_main_~x~0#1_2|) (= |v_ULTIMATE.start_main_~c~0#1_1| (+ |v_ULTIMATE.start_main_~c~0#1_2| 1)) (= (+ |v_ULTIMATE.start_main_~x~0#1_2| 11) |v_ULTIMATE.start_main_~x~0#1_1|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_2|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 242#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 243#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 246#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 245#L12 [2023-02-13 03:41:04,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:04,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1972816777, now seen corresponding path program 2 times [2023-02-13 03:41:04,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:04,132 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236212996] [2023-02-13 03:41:04,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:04,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:04,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:04,141 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:41:04,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:04,147 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:41:04,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:04,148 INFO L85 PathProgramCache]: Analyzing trace with hash 2022963, now seen corresponding path program 1 times [2023-02-13 03:41:04,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:04,148 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279640954] [2023-02-13 03:41:04,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:04,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:04,150 INFO L540 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2023-02-13 03:41:04,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:04,156 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:41:04,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:04,159 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:41:04,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:04,160 INFO L85 PathProgramCache]: Analyzing trace with hash -288053829, now seen corresponding path program 3 times [2023-02-13 03:41:04,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:04,160 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184574747] [2023-02-13 03:41:04,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:04,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:04,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:04,167 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:41:04,170 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2023-02-13 03:41:04,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:04,171 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:41:04,184 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2023-02-13 03:41:04,196 INFO L210 LassoAnalysis]: Preferences: [2023-02-13 03:41:04,196 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-13 03:41:04,196 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-13 03:41:04,196 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-13 03:41:04,196 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-13 03:41:04,197 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:04,197 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-13 03:41:04,197 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-13 03:41:04,197 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2023-02-13 03:41:04,197 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-13 03:41:04,197 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-13 03:41:04,197 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:04,198 INFO L540 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-02-13 03:41:04,200 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:04,202 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:04,203 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:04,220 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-13 03:41:04,220 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-13 03:41:04,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:04,220 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:04,221 INFO L229 MonitoredProcess]: Starting monitored process 24 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:04,222 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2023-02-13 03:41:04,222 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:41:04,222 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:04,248 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2023-02-13 03:41:04,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:04,249 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:04,250 INFO L229 MonitoredProcess]: Starting monitored process 25 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:04,250 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2023-02-13 03:41:04,251 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-13 03:41:04,252 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:04,263 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-13 03:41:04,282 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2023-02-13 03:41:04,282 INFO L210 LassoAnalysis]: Preferences: [2023-02-13 03:41:04,283 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-13 03:41:04,283 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-13 03:41:04,283 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-13 03:41:04,283 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-13 03:41:04,284 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:41:04,284 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-13 03:41:04,284 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-13 03:41:04,284 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2023-02-13 03:41:04,284 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-13 03:41:04,285 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-13 03:41:04,287 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:04,295 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:04,300 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:04,303 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:04,363 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-13 03:41:04,363 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-13 03:41:04,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:41:04,364 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:04,367 INFO L229 MonitoredProcess]: Starting monitored process 26 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:04,369 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2023-02-13 03:41:04,369 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-13 03:41:04,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-13 03:41:04,378 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-13 03:41:04,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-13 03:41:04,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-13 03:41:04,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-13 03:41:04,381 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-13 03:41:04,381 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-13 03:41:04,387 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-13 03:41:04,390 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-13 03:41:04,390 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-13 03:41:04,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:41:04,391 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:04,392 INFO L229 MonitoredProcess]: Starting monitored process 27 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:04,395 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2023-02-13 03:41:04,395 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-13 03:41:04,396 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-13 03:41:04,396 INFO L513 LassoAnalysis]: Proved termination. [2023-02-13 03:41:04,396 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1) = -2*ULTIMATE.start_main_~x~0#1 + 201 Supporting invariants [] [2023-02-13 03:41:04,433 INFO L540 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2023-02-13 03:41:04,435 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-13 03:41:04,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:04,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:04,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-13 03:41:04,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:04,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:04,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-13 03:41:04,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:04,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:41:04,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:04,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-13 03:41:04,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:04,579 INFO L100 LoopCannibalizer]: 4 predicates before loop cannibalization 4 predicates after loop cannibalization [2023-02-13 03:41:04,579 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2023-02-13 03:41:04,580 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:04,594 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 16 states and 19 transitions. Complement of second has 4 states. [2023-02-13 03:41:04,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-02-13 03:41:04,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:04,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2023-02-13 03:41:04,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 4 letters. [2023-02-13 03:41:04,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:41:04,597 INFO L680 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-13 03:41:04,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:04,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:04,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-13 03:41:04,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:04,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:04,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-13 03:41:04,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:04,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:41:04,692 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2023-02-13 03:41:04,692 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:04,719 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 13 states and 18 transitions. Complement of second has 4 states. [2023-02-13 03:41:04,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-02-13 03:41:04,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:04,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2023-02-13 03:41:04,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 4 letters. [2023-02-13 03:41:04,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:41:04,724 INFO L680 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-13 03:41:04,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:04,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:04,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-13 03:41:04,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:04,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:04,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-13 03:41:04,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:04,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:41:04,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:04,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-13 03:41:04,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:04,878 INFO L100 LoopCannibalizer]: 4 predicates before loop cannibalization 4 predicates after loop cannibalization [2023-02-13 03:41:04,879 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2023-02-13 03:41:04,881 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:04,971 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 224 states and 306 transitions. Complement of second has 117 states 14 powerset states103 rank states. The highest rank that occured is 7 [2023-02-13 03:41:04,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2023-02-13 03:41:04,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:04,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2023-02-13 03:41:04,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 6 letters. Loop has 4 letters. [2023-02-13 03:41:04,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:41:04,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 10 letters. Loop has 4 letters. [2023-02-13 03:41:04,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:41:04,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 6 letters. Loop has 8 letters. [2023-02-13 03:41:04,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:41:04,979 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 224 states and 306 transitions. [2023-02-13 03:41:04,990 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2023-02-13 03:41:04,992 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 224 states to 98 states and 148 transitions. [2023-02-13 03:41:04,993 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2023-02-13 03:41:04,993 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2023-02-13 03:41:04,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 148 transitions. [2023-02-13 03:41:04,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-13 03:41:04,993 INFO L220 hiAutomatonCegarLoop]: Abstraction has 98 states and 148 transitions. [2023-02-13 03:41:04,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 148 transitions. [2023-02-13 03:41:04,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 35. [2023-02-13 03:41:04,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 34 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:05,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 59 transitions. [2023-02-13 03:41:05,000 INFO L242 hiAutomatonCegarLoop]: Abstraction has 35 states and 59 transitions. [2023-02-13 03:41:05,000 INFO L426 stractBuchiCegarLoop]: Abstraction has 35 states and 59 transitions. [2023-02-13 03:41:05,000 INFO L333 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-02-13 03:41:05,000 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 59 transitions. [2023-02-13 03:41:05,001 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2023-02-13 03:41:05,001 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-13 03:41:05,001 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-13 03:41:05,001 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 1, 1, 1] [2023-02-13 03:41:05,002 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 2, 1] [2023-02-13 03:41:05,002 INFO L733 eck$LassoCheckResult]: Stem: 762#ULTIMATE.startENTRY [37] ULTIMATE.startENTRY-->L12-2: Formula: (= |v_ULTIMATE.start_main_~c~0#1_10| 1) InVars {} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_8|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_10|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_4|, ULTIMATE.start_main_#t~nondet0#1=|v_ULTIMATE.start_main_#t~nondet0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet0#1] 763#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 771#L12 [36] L12-->L12-2: Formula: (and (>= 100 |v_ULTIMATE.start_main_~x~0#1_2|) (= |v_ULTIMATE.start_main_~c~0#1_1| (+ |v_ULTIMATE.start_main_~c~0#1_2| 1)) (= (+ |v_ULTIMATE.start_main_~x~0#1_2| 11) |v_ULTIMATE.start_main_~x~0#1_1|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_2|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 772#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 794#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 766#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 764#L12 [2023-02-13 03:41:05,002 INFO L735 eck$LassoCheckResult]: Loop: 764#L12 [36] L12-->L12-2: Formula: (and (>= 100 |v_ULTIMATE.start_main_~x~0#1_2|) (= |v_ULTIMATE.start_main_~c~0#1_1| (+ |v_ULTIMATE.start_main_~c~0#1_2| 1)) (= (+ |v_ULTIMATE.start_main_~x~0#1_2| 11) |v_ULTIMATE.start_main_~x~0#1_1|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_2|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 760#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 761#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 770#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 768#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 769#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 764#L12 [2023-02-13 03:41:05,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:05,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1972816777, now seen corresponding path program 4 times [2023-02-13 03:41:05,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:05,003 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030490950] [2023-02-13 03:41:05,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:05,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:05,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:05,008 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:41:05,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:05,011 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:41:05,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:05,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1944068462, now seen corresponding path program 2 times [2023-02-13 03:41:05,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:05,011 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440395289] [2023-02-13 03:41:05,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:05,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:05,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:05,016 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:41:05,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:05,018 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:41:05,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:05,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1941821706, now seen corresponding path program 5 times [2023-02-13 03:41:05,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:05,019 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134992000] [2023-02-13 03:41:05,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:05,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:05,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:05,038 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-13 03:41:05,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 03:41:05,039 INFO L335 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134992000] [2023-02-13 03:41:05,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134992000] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-13 03:41:05,039 INFO L335 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534351288] [2023-02-13 03:41:05,040 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-13 03:41:05,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 03:41:05,041 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:05,042 INFO L229 MonitoredProcess]: Starting monitored process 28 with /export/starexec/sandbox/solver/Ultimate/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-13 03:41:05,043 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-02-13 03:41:05,058 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-02-13 03:41:05,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-13 03:41:05,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-13 03:41:05,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:05,077 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-13 03:41:05,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-13 03:41:05,119 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-13 03:41:05,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534351288] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-13 03:41:05,121 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-13 03:41:05,121 ERROR L197 FreeRefinementEngine]: {800#true} [802#(<= |ULTIMATE.start_main_~c~0#1| 1), 802#(<= |ULTIMATE.start_main_~c~0#1| 1), 803#(<= |ULTIMATE.start_main_~c~0#1| 2), 803#(<= |ULTIMATE.start_main_~c~0#1| 2), 802#(<= |ULTIMATE.start_main_~c~0#1| 1), 802#(<= |ULTIMATE.start_main_~c~0#1| 1), 803#(<= |ULTIMATE.start_main_~c~0#1| 2), 803#(<= |ULTIMATE.start_main_~c~0#1| 2), 802#(<= |ULTIMATE.start_main_~c~0#1| 1), 802#(<= |ULTIMATE.start_main_~c~0#1| 1), 804#(<= |ULTIMATE.start_main_~c~0#1| 0)] {801#false} [2023-02-13 03:41:05,121 ERROR L197 FreeRefinementEngine]: {800#true} [802#(<= |ULTIMATE.start_main_~c~0#1| 1), 802#(<= |ULTIMATE.start_main_~c~0#1| 1), 803#(<= |ULTIMATE.start_main_~c~0#1| 2), 803#(<= |ULTIMATE.start_main_~c~0#1| 2), 802#(<= |ULTIMATE.start_main_~c~0#1| 1), 802#(<= |ULTIMATE.start_main_~c~0#1| 1), 803#(<= |ULTIMATE.start_main_~c~0#1| 2), 803#(<= |ULTIMATE.start_main_~c~0#1| 2), 802#(<= |ULTIMATE.start_main_~c~0#1| 1), 802#(<= |ULTIMATE.start_main_~c~0#1| 1), 804#(<= |ULTIMATE.start_main_~c~0#1| 0)] {801#false} [2023-02-13 03:41:05,122 ERROR L197 FreeRefinementEngine]: {800#true} [802#(<= |ULTIMATE.start_main_~c~0#1| 1), 802#(<= |ULTIMATE.start_main_~c~0#1| 1), 803#(<= |ULTIMATE.start_main_~c~0#1| 2), 803#(<= |ULTIMATE.start_main_~c~0#1| 2), 802#(<= |ULTIMATE.start_main_~c~0#1| 1), 802#(<= |ULTIMATE.start_main_~c~0#1| 1), 803#(<= |ULTIMATE.start_main_~c~0#1| 2), 803#(<= |ULTIMATE.start_main_~c~0#1| 2), 802#(<= |ULTIMATE.start_main_~c~0#1| 1), 802#(<= |ULTIMATE.start_main_~c~0#1| 1), 804#(<= |ULTIMATE.start_main_~c~0#1| 0)] {801#false} [2023-02-13 03:41:05,122 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2023-02-13 03:41:05,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568083038] [2023-02-13 03:41:05,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-13 03:41:05,201 INFO L210 LassoAnalysis]: Preferences: [2023-02-13 03:41:05,202 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-13 03:41:05,202 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-13 03:41:05,202 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-13 03:41:05,202 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-13 03:41:05,203 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:05,203 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-13 03:41:05,203 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-13 03:41:05,203 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop [2023-02-13 03:41:05,203 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-13 03:41:05,204 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-13 03:41:05,205 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:05,214 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:05,217 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:05,221 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:05,281 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-13 03:41:05,282 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-13 03:41:05,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:05,283 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:05,284 INFO L229 MonitoredProcess]: Starting monitored process 29 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:05,287 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2023-02-13 03:41:05,288 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:41:05,288 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:05,333 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2023-02-13 03:41:05,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:05,334 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:05,335 INFO L229 MonitoredProcess]: Starting monitored process 30 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:05,336 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2023-02-13 03:41:05,337 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-13 03:41:05,337 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:05,413 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-13 03:41:05,414 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2023-02-13 03:41:05,415 INFO L210 LassoAnalysis]: Preferences: [2023-02-13 03:41:05,415 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-13 03:41:05,415 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-13 03:41:05,415 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-13 03:41:05,416 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-13 03:41:05,416 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:41:05,416 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-13 03:41:05,416 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-13 03:41:05,416 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop [2023-02-13 03:41:05,417 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-13 03:41:05,417 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-13 03:41:05,418 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:05,426 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:05,429 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:05,434 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:05,479 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-13 03:41:05,480 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-13 03:41:05,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:41:05,481 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:05,482 INFO L229 MonitoredProcess]: Starting monitored process 31 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:05,484 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2023-02-13 03:41:05,485 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-13 03:41:05,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-13 03:41:05,495 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-13 03:41:05,496 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-13 03:41:05,496 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-13 03:41:05,496 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-13 03:41:05,497 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-13 03:41:05,498 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-13 03:41:05,502 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-13 03:41:05,506 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2023-02-13 03:41:05,506 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-13 03:41:05,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:41:05,506 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:05,508 INFO L229 MonitoredProcess]: Starting monitored process 32 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:05,511 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2023-02-13 03:41:05,511 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-13 03:41:05,511 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-13 03:41:05,511 INFO L513 LassoAnalysis]: Proved termination. [2023-02-13 03:41:05,512 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1) = 1*ULTIMATE.start_main_~x~0#1 Supporting invariants [] [2023-02-13 03:41:05,546 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2023-02-13 03:41:05,547 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-13 03:41:05,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:05,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:05,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-13 03:41:05,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:05,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:05,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 03:41:05,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:05,623 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:41:05,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:05,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 03:41:05,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:05,669 INFO L540 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2023-02-13 03:41:05,688 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2023-02-13 03:41:05,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:05,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 03:41:05,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:05,742 INFO L100 LoopCannibalizer]: 5 predicates before loop cannibalization 7 predicates after loop cannibalization [2023-02-13 03:41:05,743 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2023-02-13 03:41:05,743 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 35 states and 59 transitions. cyclomatic complexity: 29 Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:05,789 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 35 states and 59 transitions. cyclomatic complexity: 29. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 137 states and 207 transitions. Complement of second has 14 states. [2023-02-13 03:41:05,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2023-02-13 03:41:05,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:05,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2023-02-13 03:41:05,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 6 letters. Loop has 6 letters. [2023-02-13 03:41:05,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:41:05,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 12 letters. Loop has 6 letters. [2023-02-13 03:41:05,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:41:05,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 6 letters. Loop has 12 letters. [2023-02-13 03:41:05,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:41:05,795 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 137 states and 207 transitions. [2023-02-13 03:41:05,800 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2023-02-13 03:41:05,802 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 137 states to 80 states and 119 transitions. [2023-02-13 03:41:05,803 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2023-02-13 03:41:05,803 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2023-02-13 03:41:05,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 119 transitions. [2023-02-13 03:41:05,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-13 03:41:05,804 INFO L220 hiAutomatonCegarLoop]: Abstraction has 80 states and 119 transitions. [2023-02-13 03:41:05,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 119 transitions. [2023-02-13 03:41:05,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 55. [2023-02-13 03:41:05,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.5818181818181818) internal successors, (87), 54 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:05,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 87 transitions. [2023-02-13 03:41:05,811 INFO L242 hiAutomatonCegarLoop]: Abstraction has 55 states and 87 transitions. [2023-02-13 03:41:05,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 03:41:05,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-13 03:41:05,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-02-13 03:41:05,812 INFO L87 Difference]: Start difference. First operand 55 states and 87 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:05,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 03:41:05,828 INFO L93 Difference]: Finished difference Result 90 states and 131 transitions. [2023-02-13 03:41:05,829 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 131 transitions. [2023-02-13 03:41:05,832 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2023-02-13 03:41:05,833 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 63 states and 100 transitions. [2023-02-13 03:41:05,834 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2023-02-13 03:41:05,834 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2023-02-13 03:41:05,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 100 transitions. [2023-02-13 03:41:05,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-13 03:41:05,835 INFO L220 hiAutomatonCegarLoop]: Abstraction has 63 states and 100 transitions. [2023-02-13 03:41:05,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 100 transitions. [2023-02-13 03:41:05,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 58. [2023-02-13 03:41:05,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 1.5689655172413792) internal successors, (91), 57 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:05,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 91 transitions. [2023-02-13 03:41:05,841 INFO L242 hiAutomatonCegarLoop]: Abstraction has 58 states and 91 transitions. [2023-02-13 03:41:05,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-13 03:41:05,843 INFO L426 stractBuchiCegarLoop]: Abstraction has 58 states and 91 transitions. [2023-02-13 03:41:05,843 INFO L333 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-02-13 03:41:05,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 91 transitions. [2023-02-13 03:41:05,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2023-02-13 03:41:05,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-13 03:41:05,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-13 03:41:05,845 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 2, 1, 1] [2023-02-13 03:41:05,845 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 4, 3] [2023-02-13 03:41:05,846 INFO L733 eck$LassoCheckResult]: Stem: 1255#ULTIMATE.startENTRY [37] ULTIMATE.startENTRY-->L12-2: Formula: (= |v_ULTIMATE.start_main_~c~0#1_10| 1) InVars {} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_8|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_10|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_4|, ULTIMATE.start_main_#t~nondet0#1=|v_ULTIMATE.start_main_#t~nondet0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet0#1] 1256#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 1275#L12 [36] L12-->L12-2: Formula: (and (>= 100 |v_ULTIMATE.start_main_~x~0#1_2|) (= |v_ULTIMATE.start_main_~c~0#1_1| (+ |v_ULTIMATE.start_main_~c~0#1_2| 1)) (= (+ |v_ULTIMATE.start_main_~x~0#1_2| 11) |v_ULTIMATE.start_main_~x~0#1_1|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_2|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 1276#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 1277#L12 [36] L12-->L12-2: Formula: (and (>= 100 |v_ULTIMATE.start_main_~x~0#1_2|) (= |v_ULTIMATE.start_main_~c~0#1_1| (+ |v_ULTIMATE.start_main_~c~0#1_2| 1)) (= (+ |v_ULTIMATE.start_main_~x~0#1_2| 11) |v_ULTIMATE.start_main_~x~0#1_1|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_2|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 1261#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 1260#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 1251#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 1252#L12 [2023-02-13 03:41:05,849 INFO L735 eck$LassoCheckResult]: Loop: 1252#L12 [36] L12-->L12-2: Formula: (and (>= 100 |v_ULTIMATE.start_main_~x~0#1_2|) (= |v_ULTIMATE.start_main_~c~0#1_1| (+ |v_ULTIMATE.start_main_~c~0#1_2| 1)) (= (+ |v_ULTIMATE.start_main_~x~0#1_2| 11) |v_ULTIMATE.start_main_~x~0#1_1|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_2|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 1296#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 1295#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 1253#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 1254#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 1298#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 1299#L12 [36] L12-->L12-2: Formula: (and (>= 100 |v_ULTIMATE.start_main_~x~0#1_2|) (= |v_ULTIMATE.start_main_~c~0#1_1| (+ |v_ULTIMATE.start_main_~c~0#1_2| 1)) (= (+ |v_ULTIMATE.start_main_~x~0#1_2| 11) |v_ULTIMATE.start_main_~x~0#1_1|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_2|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 1304#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 1303#L12 [36] L12-->L12-2: Formula: (and (>= 100 |v_ULTIMATE.start_main_~x~0#1_2|) (= |v_ULTIMATE.start_main_~c~0#1_1| (+ |v_ULTIMATE.start_main_~c~0#1_2| 1)) (= (+ |v_ULTIMATE.start_main_~x~0#1_2| 11) |v_ULTIMATE.start_main_~x~0#1_1|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_2|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 1283#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 1308#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 1307#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 1267#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 1268#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 1252#L12 [2023-02-13 03:41:05,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:05,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1796465344, now seen corresponding path program 6 times [2023-02-13 03:41:05,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:05,850 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434280411] [2023-02-13 03:41:05,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:05,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:05,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:05,859 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:41:05,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:05,865 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:41:05,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:05,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1971107630, now seen corresponding path program 3 times [2023-02-13 03:41:05,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:05,866 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809119620] [2023-02-13 03:41:05,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:05,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:05,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:05,882 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-13 03:41:05,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 03:41:05,882 INFO L335 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809119620] [2023-02-13 03:41:05,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809119620] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 03:41:05,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 03:41:05,882 ERROR L191 FreeRefinementEngine]: {1312#true} [1312#true, 1312#true, 1312#true, 1312#true, 1314#(<= 91 |ULTIMATE.start_main_~x~0#1|), 1314#(<= 91 |ULTIMATE.start_main_~x~0#1|), 1315#(<= 102 |ULTIMATE.start_main_~x~0#1|), 1315#(<= 102 |ULTIMATE.start_main_~x~0#1|), 1313#false, 1313#false, 1313#false, 1313#false, 1313#false] {1313#false} [2023-02-13 03:41:05,882 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-13 03:41:05,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851529624] [2023-02-13 03:41:05,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 03:41:05,883 INFO L750 eck$LassoCheckResult]: loop already infeasible [2023-02-13 03:41:05,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 03:41:05,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-13 03:41:05,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-13 03:41:05,883 INFO L87 Difference]: Start difference. First operand 58 states and 91 transitions. cyclomatic complexity: 39 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:05,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 03:41:05,890 INFO L93 Difference]: Finished difference Result 78 states and 110 transitions. [2023-02-13 03:41:05,890 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 110 transitions. [2023-02-13 03:41:05,890 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2023-02-13 03:41:05,890 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 67 states and 94 transitions. [2023-02-13 03:41:05,891 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2023-02-13 03:41:05,891 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2023-02-13 03:41:05,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 94 transitions. [2023-02-13 03:41:05,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-13 03:41:05,891 INFO L220 hiAutomatonCegarLoop]: Abstraction has 67 states and 94 transitions. [2023-02-13 03:41:05,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 94 transitions. [2023-02-13 03:41:05,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 47. [2023-02-13 03:41:05,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 46 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:05,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 69 transitions. [2023-02-13 03:41:05,892 INFO L242 hiAutomatonCegarLoop]: Abstraction has 47 states and 69 transitions. [2023-02-13 03:41:05,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-13 03:41:05,893 INFO L426 stractBuchiCegarLoop]: Abstraction has 47 states and 69 transitions. [2023-02-13 03:41:05,893 INFO L333 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-02-13 03:41:05,893 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 69 transitions. [2023-02-13 03:41:05,893 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2023-02-13 03:41:05,894 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-13 03:41:05,894 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-13 03:41:05,894 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 2, 1, 1] [2023-02-13 03:41:05,894 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 5, 3] [2023-02-13 03:41:05,894 INFO L733 eck$LassoCheckResult]: Stem: 1398#ULTIMATE.startENTRY [37] ULTIMATE.startENTRY-->L12-2: Formula: (= |v_ULTIMATE.start_main_~c~0#1_10| 1) InVars {} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_8|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_10|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_4|, ULTIMATE.start_main_#t~nondet0#1=|v_ULTIMATE.start_main_#t~nondet0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet0#1] 1399#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 1416#L12 [36] L12-->L12-2: Formula: (and (>= 100 |v_ULTIMATE.start_main_~x~0#1_2|) (= |v_ULTIMATE.start_main_~c~0#1_1| (+ |v_ULTIMATE.start_main_~c~0#1_2| 1)) (= (+ |v_ULTIMATE.start_main_~x~0#1_2| 11) |v_ULTIMATE.start_main_~x~0#1_1|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_2|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 1415#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 1411#L12 [36] L12-->L12-2: Formula: (and (>= 100 |v_ULTIMATE.start_main_~x~0#1_2|) (= |v_ULTIMATE.start_main_~c~0#1_1| (+ |v_ULTIMATE.start_main_~c~0#1_2| 1)) (= (+ |v_ULTIMATE.start_main_~x~0#1_2| 11) |v_ULTIMATE.start_main_~x~0#1_1|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_2|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 1409#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 1401#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 1394#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 1395#L12 [2023-02-13 03:41:05,894 INFO L735 eck$LassoCheckResult]: Loop: 1395#L12 [36] L12-->L12-2: Formula: (and (>= 100 |v_ULTIMATE.start_main_~x~0#1_2|) (= |v_ULTIMATE.start_main_~c~0#1_1| (+ |v_ULTIMATE.start_main_~c~0#1_2| 1)) (= (+ |v_ULTIMATE.start_main_~x~0#1_2| 11) |v_ULTIMATE.start_main_~x~0#1_1|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_2|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 1396#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 1397#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 1400#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 1440#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 1438#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 1434#L12 [36] L12-->L12-2: Formula: (and (>= 100 |v_ULTIMATE.start_main_~x~0#1_2|) (= |v_ULTIMATE.start_main_~c~0#1_1| (+ |v_ULTIMATE.start_main_~c~0#1_2| 1)) (= (+ |v_ULTIMATE.start_main_~x~0#1_2| 11) |v_ULTIMATE.start_main_~x~0#1_1|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_2|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 1437#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 1435#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 1436#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 1410#L12 [36] L12-->L12-2: Formula: (and (>= 100 |v_ULTIMATE.start_main_~x~0#1_2|) (= |v_ULTIMATE.start_main_~c~0#1_1| (+ |v_ULTIMATE.start_main_~c~0#1_2| 1)) (= (+ |v_ULTIMATE.start_main_~x~0#1_2| 11) |v_ULTIMATE.start_main_~x~0#1_1|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_2|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 1414#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 1421#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 1420#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 1418#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 1417#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 1395#L12 [2023-02-13 03:41:05,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:05,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1796465344, now seen corresponding path program 7 times [2023-02-13 03:41:05,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:05,895 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260619163] [2023-02-13 03:41:05,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:05,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:05,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:05,898 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:41:05,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:05,902 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:41:05,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:05,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1579355981, now seen corresponding path program 4 times [2023-02-13 03:41:05,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:05,902 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331958890] [2023-02-13 03:41:05,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:05,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:05,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:05,931 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 38 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:41:05,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 03:41:05,931 INFO L335 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331958890] [2023-02-13 03:41:05,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331958890] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-13 03:41:05,932 INFO L335 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915475191] [2023-02-13 03:41:05,932 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-13 03:41:05,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 03:41:05,932 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:05,932 INFO L229 MonitoredProcess]: Starting monitored process 33 with /export/starexec/sandbox/solver/Ultimate/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-13 03:41:05,934 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2023-02-13 03:41:05,946 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-13 03:41:05,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-13 03:41:05,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-13 03:41:05,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:05,962 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 38 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:41:05,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-13 03:41:06,003 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 38 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:41:06,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915475191] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-13 03:41:06,003 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-13 03:41:06,003 ERROR L197 FreeRefinementEngine]: {1444#true} [1446#(<= |ULTIMATE.start_main_~x~0#1| 111), 1446#(<= |ULTIMATE.start_main_~x~0#1| 111), 1447#(<= |ULTIMATE.start_main_~x~0#1| 101), 1447#(<= |ULTIMATE.start_main_~x~0#1| 101), 1448#(<= |ULTIMATE.start_main_~x~0#1| 91), 1448#(<= |ULTIMATE.start_main_~x~0#1| 91), 1449#(<= |ULTIMATE.start_main_~x~0#1| 102), 1449#(<= |ULTIMATE.start_main_~x~0#1| 102), 1450#(<= |ULTIMATE.start_main_~x~0#1| 92), 1450#(<= |ULTIMATE.start_main_~x~0#1| 92), 1451#(<= |ULTIMATE.start_main_~x~0#1| 103), 1451#(<= |ULTIMATE.start_main_~x~0#1| 103), 1452#(<= |ULTIMATE.start_main_~x~0#1| 93), 1452#(<= |ULTIMATE.start_main_~x~0#1| 93), 1445#false] {1445#false} [2023-02-13 03:41:06,004 ERROR L197 FreeRefinementEngine]: {1444#true} [1446#(<= |ULTIMATE.start_main_~x~0#1| 111), 1446#(<= |ULTIMATE.start_main_~x~0#1| 111), 1447#(<= |ULTIMATE.start_main_~x~0#1| 101), 1447#(<= |ULTIMATE.start_main_~x~0#1| 101), 1448#(<= |ULTIMATE.start_main_~x~0#1| 91), 1448#(<= |ULTIMATE.start_main_~x~0#1| 91), 1449#(<= |ULTIMATE.start_main_~x~0#1| 102), 1449#(<= |ULTIMATE.start_main_~x~0#1| 102), 1450#(<= |ULTIMATE.start_main_~x~0#1| 92), 1450#(<= |ULTIMATE.start_main_~x~0#1| 92), 1451#(<= |ULTIMATE.start_main_~x~0#1| 103), 1451#(<= |ULTIMATE.start_main_~x~0#1| 103), 1452#(<= |ULTIMATE.start_main_~x~0#1| 93), 1452#(<= |ULTIMATE.start_main_~x~0#1| 93), 1445#false] {1445#false} [2023-02-13 03:41:06,004 ERROR L197 FreeRefinementEngine]: {1444#true} [1546#(< |ULTIMATE.start_main_~x~0#1| 119), 1546#(< |ULTIMATE.start_main_~x~0#1| 119), 1539#(< |ULTIMATE.start_main_~x~0#1| 109), 1539#(< |ULTIMATE.start_main_~x~0#1| 109), 1532#(< |ULTIMATE.start_main_~x~0#1| 99), 1532#(< |ULTIMATE.start_main_~x~0#1| 99), 1525#(< |ULTIMATE.start_main_~x~0#1| 110), 1525#(< |ULTIMATE.start_main_~x~0#1| 110), 1518#(< |ULTIMATE.start_main_~x~0#1| 100), 1518#(< |ULTIMATE.start_main_~x~0#1| 100), 1511#(< |ULTIMATE.start_main_~x~0#1| 111), 1511#(< |ULTIMATE.start_main_~x~0#1| 111), 1504#(not (< 100 |ULTIMATE.start_main_~x~0#1|)), 1504#(not (< 100 |ULTIMATE.start_main_~x~0#1|)), 1445#false] {1445#false} [2023-02-13 03:41:06,004 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2023-02-13 03:41:06,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630776174] [2023-02-13 03:41:06,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-13 03:41:06,004 INFO L750 eck$LassoCheckResult]: loop already infeasible [2023-02-13 03:41:06,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 03:41:06,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-13 03:41:06,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2023-02-13 03:41:06,005 INFO L87 Difference]: Start difference. First operand 47 states and 69 transitions. cyclomatic complexity: 26 Second operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:06,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 03:41:06,029 INFO L93 Difference]: Finished difference Result 151 states and 169 transitions. [2023-02-13 03:41:06,029 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 151 states and 169 transitions. [2023-02-13 03:41:06,031 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2023-02-13 03:41:06,032 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 151 states to 92 states and 108 transitions. [2023-02-13 03:41:06,032 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2023-02-13 03:41:06,032 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2023-02-13 03:41:06,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 108 transitions. [2023-02-13 03:41:06,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-13 03:41:06,033 INFO L220 hiAutomatonCegarLoop]: Abstraction has 92 states and 108 transitions. [2023-02-13 03:41:06,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 108 transitions. [2023-02-13 03:41:06,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 77. [2023-02-13 03:41:06,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 77 states have (on average 1.1818181818181819) internal successors, (91), 76 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:06,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 91 transitions. [2023-02-13 03:41:06,038 INFO L242 hiAutomatonCegarLoop]: Abstraction has 77 states and 91 transitions. [2023-02-13 03:41:06,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-13 03:41:06,039 INFO L426 stractBuchiCegarLoop]: Abstraction has 77 states and 91 transitions. [2023-02-13 03:41:06,039 INFO L333 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-02-13 03:41:06,040 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 91 transitions. [2023-02-13 03:41:06,040 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2023-02-13 03:41:06,040 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-13 03:41:06,040 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-13 03:41:06,041 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1] [2023-02-13 03:41:06,041 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [13, 7, 6] [2023-02-13 03:41:06,041 INFO L733 eck$LassoCheckResult]: Stem: 1705#ULTIMATE.startENTRY [37] ULTIMATE.startENTRY-->L12-2: Formula: (= |v_ULTIMATE.start_main_~c~0#1_10| 1) InVars {} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_8|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_10|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_4|, ULTIMATE.start_main_#t~nondet0#1=|v_ULTIMATE.start_main_#t~nondet0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet0#1] 1706#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 1716#L12 [36] L12-->L12-2: Formula: (and (>= 100 |v_ULTIMATE.start_main_~x~0#1_2|) (= |v_ULTIMATE.start_main_~c~0#1_1| (+ |v_ULTIMATE.start_main_~c~0#1_2| 1)) (= (+ |v_ULTIMATE.start_main_~x~0#1_2| 11) |v_ULTIMATE.start_main_~x~0#1_1|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_2|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 1701#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 1702#L12 [2023-02-13 03:41:06,041 INFO L735 eck$LassoCheckResult]: Loop: 1702#L12 [36] L12-->L12-2: Formula: (and (>= 100 |v_ULTIMATE.start_main_~x~0#1_2|) (= |v_ULTIMATE.start_main_~c~0#1_1| (+ |v_ULTIMATE.start_main_~c~0#1_2| 1)) (= (+ |v_ULTIMATE.start_main_~x~0#1_2| 11) |v_ULTIMATE.start_main_~x~0#1_1|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_2|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 1718#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 1712#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 1713#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 1724#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 1722#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 1723#L12 [36] L12-->L12-2: Formula: (and (>= 100 |v_ULTIMATE.start_main_~x~0#1_2|) (= |v_ULTIMATE.start_main_~c~0#1_1| (+ |v_ULTIMATE.start_main_~c~0#1_2| 1)) (= (+ |v_ULTIMATE.start_main_~x~0#1_2| 11) |v_ULTIMATE.start_main_~x~0#1_1|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_2|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 1749#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 1748#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 1747#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 1746#L12 [36] L12-->L12-2: Formula: (and (>= 100 |v_ULTIMATE.start_main_~x~0#1_2|) (= |v_ULTIMATE.start_main_~c~0#1_1| (+ |v_ULTIMATE.start_main_~c~0#1_2| 1)) (= (+ |v_ULTIMATE.start_main_~x~0#1_2| 11) |v_ULTIMATE.start_main_~x~0#1_1|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_2|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 1745#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 1744#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 1743#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 1742#L12 [36] L12-->L12-2: Formula: (and (>= 100 |v_ULTIMATE.start_main_~x~0#1_2|) (= |v_ULTIMATE.start_main_~c~0#1_1| (+ |v_ULTIMATE.start_main_~c~0#1_2| 1)) (= (+ |v_ULTIMATE.start_main_~x~0#1_2| 11) |v_ULTIMATE.start_main_~x~0#1_1|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_2|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 1741#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 1740#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 1739#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 1738#L12 [36] L12-->L12-2: Formula: (and (>= 100 |v_ULTIMATE.start_main_~x~0#1_2|) (= |v_ULTIMATE.start_main_~c~0#1_1| (+ |v_ULTIMATE.start_main_~c~0#1_2| 1)) (= (+ |v_ULTIMATE.start_main_~x~0#1_2| 11) |v_ULTIMATE.start_main_~x~0#1_1|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_2|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 1732#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 1728#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 1725#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 1711#L12 [36] L12-->L12-2: Formula: (and (>= 100 |v_ULTIMATE.start_main_~x~0#1_2|) (= |v_ULTIMATE.start_main_~c~0#1_1| (+ |v_ULTIMATE.start_main_~c~0#1_2| 1)) (= (+ |v_ULTIMATE.start_main_~x~0#1_2| 11) |v_ULTIMATE.start_main_~x~0#1_1|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_2|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 1721#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 1719#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 1710#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 1702#L12 [2023-02-13 03:41:06,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:06,042 INFO L85 PathProgramCache]: Analyzing trace with hash 2052878, now seen corresponding path program 3 times [2023-02-13 03:41:06,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:06,042 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355944776] [2023-02-13 03:41:06,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:06,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:06,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:06,046 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:41:06,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:06,048 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:41:06,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:06,048 INFO L85 PathProgramCache]: Analyzing trace with hash 820864488, now seen corresponding path program 5 times [2023-02-13 03:41:06,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:06,049 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753841185] [2023-02-13 03:41:06,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:06,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:06,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:06,056 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:41:06,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:06,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:41:06,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:06,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1775817397, now seen corresponding path program 8 times [2023-02-13 03:41:06,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:06,062 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493760331] [2023-02-13 03:41:06,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:06,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:06,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:06,068 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:41:06,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:06,074 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:41:06,279 INFO L210 LassoAnalysis]: Preferences: [2023-02-13 03:41:06,279 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-13 03:41:06,279 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-13 03:41:06,280 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-13 03:41:06,280 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-13 03:41:06,280 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:06,280 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-13 03:41:06,280 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-13 03:41:06,281 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration9_Loop [2023-02-13 03:41:06,281 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-13 03:41:06,281 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-13 03:41:06,283 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:06,291 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:06,294 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:06,297 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:06,358 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-13 03:41:06,358 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-13 03:41:06,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:06,359 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:06,361 INFO L229 MonitoredProcess]: Starting monitored process 34 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:06,364 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2023-02-13 03:41:06,365 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:41:06,365 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:06,405 INFO L540 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2023-02-13 03:41:06,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:06,406 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:06,408 INFO L229 MonitoredProcess]: Starting monitored process 35 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:06,410 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-13 03:41:06,410 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:06,410 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2023-02-13 03:41:06,427 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-13 03:41:06,460 INFO L540 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2023-02-13 03:41:06,460 INFO L210 LassoAnalysis]: Preferences: [2023-02-13 03:41:06,460 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-13 03:41:06,461 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-13 03:41:06,461 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-13 03:41:06,461 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-13 03:41:06,461 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:41:06,462 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-13 03:41:06,462 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-13 03:41:06,462 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration9_Loop [2023-02-13 03:41:06,463 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-13 03:41:06,463 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-13 03:41:06,464 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:06,470 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:06,472 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:06,474 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:06,524 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-13 03:41:06,525 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-13 03:41:06,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:41:06,526 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:06,527 INFO L229 MonitoredProcess]: Starting monitored process 36 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:06,531 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2023-02-13 03:41:06,532 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-13 03:41:06,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-13 03:41:06,541 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-13 03:41:06,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-13 03:41:06,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-13 03:41:06,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-13 03:41:06,544 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-13 03:41:06,544 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-13 03:41:06,548 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-13 03:41:06,553 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-13 03:41:06,553 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-13 03:41:06,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:41:06,554 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:06,555 INFO L229 MonitoredProcess]: Starting monitored process 37 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:06,558 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2023-02-13 03:41:06,558 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-13 03:41:06,559 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-13 03:41:06,559 INFO L513 LassoAnalysis]: Proved termination. [2023-02-13 03:41:06,559 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1) = 1*ULTIMATE.start_main_~x~0#1 Supporting invariants [] [2023-02-13 03:41:06,596 INFO L540 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2023-02-13 03:41:06,597 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-13 03:41:06,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:06,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:06,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-13 03:41:06,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:06,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:06,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-13 03:41:06,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:06,923 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 64 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:41:07,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:07,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-13 03:41:07,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:07,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:07,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-13 03:41:07,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:07,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:07,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-13 03:41:07,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:07,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:07,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-13 03:41:07,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:07,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:07,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-13 03:41:07,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:08,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:08,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-13 03:41:08,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:08,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:08,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-13 03:41:08,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:08,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:08,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-13 03:41:08,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:08,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:08,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-13 03:41:08,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:09,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:09,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-13 03:41:09,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:09,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:09,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-13 03:41:09,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:09,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:09,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-13 03:41:09,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:09,984 INFO L100 LoopCannibalizer]: 15 predicates before loop cannibalization 36 predicates after loop cannibalization [2023-02-13 03:41:09,984 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 36 loop predicates [2023-02-13 03:41:09,985 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 77 states and 91 transitions. cyclomatic complexity: 18 Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:10,478 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 77 states and 91 transitions. cyclomatic complexity: 18. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 6127 states and 7394 transitions. Complement of second has 634 states. [2023-02-13 03:41:10,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 1 stem states 13 non-accepting loop states 1 accepting loop states [2023-02-13 03:41:10,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:10,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 39 transitions. [2023-02-13 03:41:10,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 39 transitions. Stem has 4 letters. Loop has 26 letters. [2023-02-13 03:41:10,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:41:10,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 39 transitions. Stem has 30 letters. Loop has 26 letters. [2023-02-13 03:41:10,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:41:10,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 39 transitions. Stem has 4 letters. Loop has 52 letters. [2023-02-13 03:41:10,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:41:10,500 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6127 states and 7394 transitions. [2023-02-13 03:41:10,551 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 117 [2023-02-13 03:41:10,553 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6127 states to 491 states and 554 transitions. [2023-02-13 03:41:10,553 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2023-02-13 03:41:10,554 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 115 [2023-02-13 03:41:10,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 491 states and 554 transitions. [2023-02-13 03:41:10,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-13 03:41:10,554 INFO L220 hiAutomatonCegarLoop]: Abstraction has 491 states and 554 transitions. [2023-02-13 03:41:10,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states and 554 transitions. [2023-02-13 03:41:10,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 132. [2023-02-13 03:41:10,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 132 states have (on average 1.2045454545454546) internal successors, (159), 131 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:10,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 159 transitions. [2023-02-13 03:41:10,563 INFO L242 hiAutomatonCegarLoop]: Abstraction has 132 states and 159 transitions. [2023-02-13 03:41:10,563 INFO L426 stractBuchiCegarLoop]: Abstraction has 132 states and 159 transitions. [2023-02-13 03:41:10,563 INFO L333 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-02-13 03:41:10,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 132 states and 159 transitions. [2023-02-13 03:41:10,564 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2023-02-13 03:41:10,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-13 03:41:10,564 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-13 03:41:10,564 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-02-13 03:41:10,564 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [15, 8, 7] [2023-02-13 03:41:10,565 INFO L733 eck$LassoCheckResult]: Stem: 9662#ULTIMATE.startENTRY [37] ULTIMATE.startENTRY-->L12-2: Formula: (= |v_ULTIMATE.start_main_~c~0#1_10| 1) InVars {} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_8|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_10|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_4|, ULTIMATE.start_main_#t~nondet0#1=|v_ULTIMATE.start_main_#t~nondet0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet0#1] 9663#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 9690#L12 [36] L12-->L12-2: Formula: (and (>= 100 |v_ULTIMATE.start_main_~x~0#1_2|) (= |v_ULTIMATE.start_main_~c~0#1_1| (+ |v_ULTIMATE.start_main_~c~0#1_2| 1)) (= (+ |v_ULTIMATE.start_main_~x~0#1_2| 11) |v_ULTIMATE.start_main_~x~0#1_1|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_2|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 9687#L12-2 [2023-02-13 03:41:10,565 INFO L735 eck$LassoCheckResult]: Loop: 9687#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 9758#L12 [36] L12-->L12-2: Formula: (and (>= 100 |v_ULTIMATE.start_main_~x~0#1_2|) (= |v_ULTIMATE.start_main_~c~0#1_1| (+ |v_ULTIMATE.start_main_~c~0#1_2| 1)) (= (+ |v_ULTIMATE.start_main_~x~0#1_2| 11) |v_ULTIMATE.start_main_~x~0#1_1|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_2|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 9756#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 9755#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 9725#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 9681#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 9679#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 9669#L12 [36] L12-->L12-2: Formula: (and (>= 100 |v_ULTIMATE.start_main_~x~0#1_2|) (= |v_ULTIMATE.start_main_~c~0#1_1| (+ |v_ULTIMATE.start_main_~c~0#1_2| 1)) (= (+ |v_ULTIMATE.start_main_~x~0#1_2| 11) |v_ULTIMATE.start_main_~x~0#1_1|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_2|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 9674#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 9670#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 9668#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 9664#L12 [36] L12-->L12-2: Formula: (and (>= 100 |v_ULTIMATE.start_main_~x~0#1_2|) (= |v_ULTIMATE.start_main_~c~0#1_1| (+ |v_ULTIMATE.start_main_~c~0#1_2| 1)) (= (+ |v_ULTIMATE.start_main_~x~0#1_2| 11) |v_ULTIMATE.start_main_~x~0#1_1|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_2|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 9665#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 9667#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 9774#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 9773#L12 [36] L12-->L12-2: Formula: (and (>= 100 |v_ULTIMATE.start_main_~x~0#1_2|) (= |v_ULTIMATE.start_main_~c~0#1_1| (+ |v_ULTIMATE.start_main_~c~0#1_2| 1)) (= (+ |v_ULTIMATE.start_main_~x~0#1_2| 11) |v_ULTIMATE.start_main_~x~0#1_1|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_2|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 9772#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 9771#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 9770#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 9769#L12 [36] L12-->L12-2: Formula: (and (>= 100 |v_ULTIMATE.start_main_~x~0#1_2|) (= |v_ULTIMATE.start_main_~c~0#1_1| (+ |v_ULTIMATE.start_main_~c~0#1_2| 1)) (= (+ |v_ULTIMATE.start_main_~x~0#1_2| 11) |v_ULTIMATE.start_main_~x~0#1_1|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_2|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 9768#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 9767#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 9766#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 9765#L12 [36] L12-->L12-2: Formula: (and (>= 100 |v_ULTIMATE.start_main_~x~0#1_2|) (= |v_ULTIMATE.start_main_~c~0#1_1| (+ |v_ULTIMATE.start_main_~c~0#1_2| 1)) (= (+ |v_ULTIMATE.start_main_~x~0#1_2| 11) |v_ULTIMATE.start_main_~x~0#1_1|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_2|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 9764#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 9763#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 9762#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 9761#L12 [36] L12-->L12-2: Formula: (and (>= 100 |v_ULTIMATE.start_main_~x~0#1_2|) (= |v_ULTIMATE.start_main_~c~0#1_1| (+ |v_ULTIMATE.start_main_~c~0#1_2| 1)) (= (+ |v_ULTIMATE.start_main_~x~0#1_2| 11) |v_ULTIMATE.start_main_~x~0#1_1|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_2|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 9760#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 9759#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 9687#L12-2 [2023-02-13 03:41:10,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:10,565 INFO L85 PathProgramCache]: Analyzing trace with hash 66221, now seen corresponding path program 4 times [2023-02-13 03:41:10,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:10,565 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036826210] [2023-02-13 03:41:10,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:10,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:10,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:10,568 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:41:10,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:10,569 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:41:10,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:10,569 INFO L85 PathProgramCache]: Analyzing trace with hash -524766712, now seen corresponding path program 6 times [2023-02-13 03:41:10,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:10,570 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439800979] [2023-02-13 03:41:10,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:10,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:10,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:10,575 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:41:10,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:10,580 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:41:10,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:10,581 INFO L85 PathProgramCache]: Analyzing trace with hash -2031042636, now seen corresponding path program 9 times [2023-02-13 03:41:10,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:10,581 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144972600] [2023-02-13 03:41:10,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:10,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:10,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:10,586 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:41:10,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:10,591 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:41:10,898 INFO L210 LassoAnalysis]: Preferences: [2023-02-13 03:41:10,898 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-13 03:41:10,898 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-13 03:41:10,899 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-13 03:41:10,899 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-13 03:41:10,899 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:10,899 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-13 03:41:10,900 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-13 03:41:10,900 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration10_Loop [2023-02-13 03:41:10,900 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-13 03:41:10,900 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-13 03:41:10,902 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:10,908 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:10,915 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:10,922 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:10,967 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-13 03:41:10,967 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-13 03:41:10,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:10,968 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:10,969 INFO L229 MonitoredProcess]: Starting monitored process 38 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:10,971 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2023-02-13 03:41:10,972 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:41:10,972 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:10,991 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-13 03:41:10,991 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_15=1} Honda state: {v_rep~unnamed0~0~true_15=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-13 03:41:11,018 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2023-02-13 03:41:11,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:11,019 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:11,020 INFO L229 MonitoredProcess]: Starting monitored process 39 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:11,022 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2023-02-13 03:41:11,022 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:41:11,023 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:11,049 INFO L540 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2023-02-13 03:41:11,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:11,050 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:11,052 INFO L229 MonitoredProcess]: Starting monitored process 40 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:11,054 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2023-02-13 03:41:11,054 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-13 03:41:11,054 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:11,068 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-13 03:41:11,099 INFO L540 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2023-02-13 03:41:11,099 INFO L210 LassoAnalysis]: Preferences: [2023-02-13 03:41:11,099 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-13 03:41:11,100 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-13 03:41:11,100 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-13 03:41:11,100 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-13 03:41:11,100 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:41:11,100 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-13 03:41:11,100 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-13 03:41:11,100 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration10_Loop [2023-02-13 03:41:11,100 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-13 03:41:11,100 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-13 03:41:11,100 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:11,103 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:11,111 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:11,117 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:11,166 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-13 03:41:11,166 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-13 03:41:11,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:41:11,167 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:11,169 INFO L229 MonitoredProcess]: Starting monitored process 41 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:11,171 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2023-02-13 03:41:11,171 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-13 03:41:11,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-13 03:41:11,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-13 03:41:11,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-13 03:41:11,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-13 03:41:11,184 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-13 03:41:11,184 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-13 03:41:11,190 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-13 03:41:11,227 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2023-02-13 03:41:11,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:41:11,227 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:11,228 INFO L229 MonitoredProcess]: Starting monitored process 42 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:11,230 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2023-02-13 03:41:11,231 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-13 03:41:11,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-13 03:41:11,236 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-13 03:41:11,236 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-13 03:41:11,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-13 03:41:11,237 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-13 03:41:11,238 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-13 03:41:11,238 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-13 03:41:11,240 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-13 03:41:11,244 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2023-02-13 03:41:11,245 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-13 03:41:11,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:41:11,245 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:11,246 INFO L229 MonitoredProcess]: Starting monitored process 43 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:11,248 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-13 03:41:11,248 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2023-02-13 03:41:11,249 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-13 03:41:11,249 INFO L513 LassoAnalysis]: Proved termination. [2023-02-13 03:41:11,249 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1) = 1*ULTIMATE.start_main_~x~0#1 Supporting invariants [] [2023-02-13 03:41:11,281 INFO L540 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2023-02-13 03:41:11,281 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-13 03:41:11,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:11,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:11,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-13 03:41:11,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:11,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:11,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-13 03:41:11,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:11,598 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 80 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:41:11,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:11,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-13 03:41:11,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:12,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:12,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-13 03:41:12,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:12,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:12,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-13 03:41:12,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:12,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:12,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-13 03:41:12,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:13,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-13 03:41:13,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:13,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:13,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-13 03:41:13,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:13,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:13,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-13 03:41:13,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:13,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:13,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-13 03:41:13,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:14,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:14,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-13 03:41:14,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:14,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:14,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-13 03:41:14,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:14,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:14,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-13 03:41:14,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:15,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:15,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-13 03:41:15,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:15,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:15,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-13 03:41:15,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:15,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:15,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-13 03:41:15,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:16,446 INFO L100 LoopCannibalizer]: 16 predicates before loop cannibalization 43 predicates after loop cannibalization [2023-02-13 03:41:16,447 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 43 loop predicates [2023-02-13 03:41:16,447 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 132 states and 159 transitions. cyclomatic complexity: 31 Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:17,029 INFO L540 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2023-02-13 03:41:17,049 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2023-02-13 03:41:17,329 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 132 states and 159 transitions. cyclomatic complexity: 31. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35553 states and 40710 transitions. Complement of second has 1528 states. [2023-02-13 03:41:17,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 1 stem states 15 non-accepting loop states 1 accepting loop states [2023-02-13 03:41:17,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:17,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 42 transitions. [2023-02-13 03:41:17,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 42 transitions. Stem has 3 letters. Loop has 30 letters. [2023-02-13 03:41:17,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:41:17,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 42 transitions. Stem has 33 letters. Loop has 30 letters. [2023-02-13 03:41:17,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:41:17,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 42 transitions. Stem has 3 letters. Loop has 60 letters. [2023-02-13 03:41:17,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:41:17,333 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35553 states and 40710 transitions. [2023-02-13 03:41:17,440 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 175 [2023-02-13 03:41:17,442 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35553 states to 647 states and 727 transitions. [2023-02-13 03:41:17,442 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2023-02-13 03:41:17,443 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2023-02-13 03:41:17,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 647 states and 727 transitions. [2023-02-13 03:41:17,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-13 03:41:17,443 INFO L220 hiAutomatonCegarLoop]: Abstraction has 647 states and 727 transitions. [2023-02-13 03:41:17,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states and 727 transitions. [2023-02-13 03:41:17,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 131. [2023-02-13 03:41:17,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 131 states have (on average 1.2595419847328244) internal successors, (165), 130 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:17,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 165 transitions. [2023-02-13 03:41:17,446 INFO L242 hiAutomatonCegarLoop]: Abstraction has 131 states and 165 transitions. [2023-02-13 03:41:17,446 INFO L426 stractBuchiCegarLoop]: Abstraction has 131 states and 165 transitions. [2023-02-13 03:41:17,446 INFO L333 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-02-13 03:41:17,446 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 131 states and 165 transitions. [2023-02-13 03:41:17,447 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 39 [2023-02-13 03:41:17,447 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-13 03:41:17,447 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-13 03:41:17,447 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 2, 2, 1] [2023-02-13 03:41:17,447 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [17, 9, 8] [2023-02-13 03:41:17,447 INFO L733 eck$LassoCheckResult]: Stem: 48367#ULTIMATE.startENTRY [37] ULTIMATE.startENTRY-->L12-2: Formula: (= |v_ULTIMATE.start_main_~c~0#1_10| 1) InVars {} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_8|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_10|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_4|, ULTIMATE.start_main_#t~nondet0#1=|v_ULTIMATE.start_main_#t~nondet0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet0#1] 48368#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 48432#L12 [36] L12-->L12-2: Formula: (and (>= 100 |v_ULTIMATE.start_main_~x~0#1_2|) (= |v_ULTIMATE.start_main_~c~0#1_1| (+ |v_ULTIMATE.start_main_~c~0#1_2| 1)) (= (+ |v_ULTIMATE.start_main_~x~0#1_2| 11) |v_ULTIMATE.start_main_~x~0#1_1|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_2|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 48433#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 48434#L12 [36] L12-->L12-2: Formula: (and (>= 100 |v_ULTIMATE.start_main_~x~0#1_2|) (= |v_ULTIMATE.start_main_~c~0#1_1| (+ |v_ULTIMATE.start_main_~c~0#1_2| 1)) (= (+ |v_ULTIMATE.start_main_~x~0#1_2| 11) |v_ULTIMATE.start_main_~x~0#1_1|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_2|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 48409#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 48389#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 48382#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 48379#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 48378#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 48369#L12 [2023-02-13 03:41:17,448 INFO L735 eck$LassoCheckResult]: Loop: 48369#L12 [36] L12-->L12-2: Formula: (and (>= 100 |v_ULTIMATE.start_main_~x~0#1_2|) (= |v_ULTIMATE.start_main_~c~0#1_1| (+ |v_ULTIMATE.start_main_~c~0#1_2| 1)) (= (+ |v_ULTIMATE.start_main_~x~0#1_2| 11) |v_ULTIMATE.start_main_~x~0#1_1|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_2|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 48370#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 48491#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 48490#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 48489#L12 [36] L12-->L12-2: Formula: (and (>= 100 |v_ULTIMATE.start_main_~x~0#1_2|) (= |v_ULTIMATE.start_main_~c~0#1_1| (+ |v_ULTIMATE.start_main_~c~0#1_2| 1)) (= (+ |v_ULTIMATE.start_main_~x~0#1_2| 11) |v_ULTIMATE.start_main_~x~0#1_1|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_2|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 48488#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 48487#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 48486#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 48485#L12 [36] L12-->L12-2: Formula: (and (>= 100 |v_ULTIMATE.start_main_~x~0#1_2|) (= |v_ULTIMATE.start_main_~c~0#1_1| (+ |v_ULTIMATE.start_main_~c~0#1_2| 1)) (= (+ |v_ULTIMATE.start_main_~x~0#1_2| 11) |v_ULTIMATE.start_main_~x~0#1_1|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_2|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 48484#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 48483#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 48482#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 48481#L12 [36] L12-->L12-2: Formula: (and (>= 100 |v_ULTIMATE.start_main_~x~0#1_2|) (= |v_ULTIMATE.start_main_~c~0#1_1| (+ |v_ULTIMATE.start_main_~c~0#1_2| 1)) (= (+ |v_ULTIMATE.start_main_~x~0#1_2| 11) |v_ULTIMATE.start_main_~x~0#1_1|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_2|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 48480#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 48479#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 48478#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 48477#L12 [36] L12-->L12-2: Formula: (and (>= 100 |v_ULTIMATE.start_main_~x~0#1_2|) (= |v_ULTIMATE.start_main_~c~0#1_1| (+ |v_ULTIMATE.start_main_~c~0#1_2| 1)) (= (+ |v_ULTIMATE.start_main_~x~0#1_2| 11) |v_ULTIMATE.start_main_~x~0#1_1|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_2|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 48476#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 48364#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 48475#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 48416#L12 [36] L12-->L12-2: Formula: (and (>= 100 |v_ULTIMATE.start_main_~x~0#1_2|) (= |v_ULTIMATE.start_main_~c~0#1_1| (+ |v_ULTIMATE.start_main_~c~0#1_2| 1)) (= (+ |v_ULTIMATE.start_main_~x~0#1_2| 11) |v_ULTIMATE.start_main_~x~0#1_1|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_2|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 48414#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 48390#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 48388#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 48386#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 48384#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 48374#L12 [36] L12-->L12-2: Formula: (and (>= 100 |v_ULTIMATE.start_main_~x~0#1_2|) (= |v_ULTIMATE.start_main_~c~0#1_1| (+ |v_ULTIMATE.start_main_~c~0#1_2| 1)) (= (+ |v_ULTIMATE.start_main_~x~0#1_2| 11) |v_ULTIMATE.start_main_~x~0#1_1|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_2|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 48381#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 48375#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 48372#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 48373#L12 [36] L12-->L12-2: Formula: (and (>= 100 |v_ULTIMATE.start_main_~x~0#1_2|) (= |v_ULTIMATE.start_main_~c~0#1_1| (+ |v_ULTIMATE.start_main_~c~0#1_2| 1)) (= (+ |v_ULTIMATE.start_main_~x~0#1_2| 11) |v_ULTIMATE.start_main_~x~0#1_1|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_2|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 48377#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 48376#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 48371#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 48369#L12 [2023-02-13 03:41:17,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:17,448 INFO L85 PathProgramCache]: Analyzing trace with hash -173656389, now seen corresponding path program 10 times [2023-02-13 03:41:17,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:17,448 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548571392] [2023-02-13 03:41:17,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:17,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:17,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:17,451 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:41:17,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:17,453 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:41:17,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:17,453 INFO L85 PathProgramCache]: Analyzing trace with hash -2132428980, now seen corresponding path program 7 times [2023-02-13 03:41:17,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:17,453 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749428046] [2023-02-13 03:41:17,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:17,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:17,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:17,458 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:41:17,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:17,462 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:41:17,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:17,463 INFO L85 PathProgramCache]: Analyzing trace with hash -17186938, now seen corresponding path program 11 times [2023-02-13 03:41:17,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:17,463 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262459651] [2023-02-13 03:41:17,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:17,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:17,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:17,528 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 297 proven. 126 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-13 03:41:17,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 03:41:17,528 INFO L335 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262459651] [2023-02-13 03:41:17,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262459651] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-13 03:41:17,528 INFO L335 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958440518] [2023-02-13 03:41:17,528 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-13 03:41:17,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 03:41:17,529 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:17,529 INFO L229 MonitoredProcess]: Starting monitored process 44 with /export/starexec/sandbox/solver/Ultimate/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-13 03:41:17,531 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2023-02-13 03:41:17,556 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2023-02-13 03:41:17,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-13 03:41:17,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-13 03:41:17,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:17,586 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 297 proven. 126 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-13 03:41:17,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-13 03:41:17,683 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 297 proven. 126 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-13 03:41:17,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958440518] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-13 03:41:17,684 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-13 03:41:17,684 ERROR L197 FreeRefinementEngine]: {48499#true} [48499#true, 48499#true, 48499#true, 48499#true, 48501#(<= |ULTIMATE.start_main_~x~0#1| 111), 48501#(<= |ULTIMATE.start_main_~x~0#1| 111), 48502#(<= |ULTIMATE.start_main_~x~0#1| 101), 48502#(<= |ULTIMATE.start_main_~x~0#1| 101), 48503#(<= |ULTIMATE.start_main_~x~0#1| 91), 48503#(<= |ULTIMATE.start_main_~x~0#1| 91), 48504#(<= |ULTIMATE.start_main_~x~0#1| 102), 48504#(<= |ULTIMATE.start_main_~x~0#1| 102), 48505#(<= |ULTIMATE.start_main_~x~0#1| 92), 48505#(<= |ULTIMATE.start_main_~x~0#1| 92), 48506#(<= |ULTIMATE.start_main_~x~0#1| 103), 48506#(<= |ULTIMATE.start_main_~x~0#1| 103), 48507#(<= |ULTIMATE.start_main_~x~0#1| 93), 48507#(<= |ULTIMATE.start_main_~x~0#1| 93), 48508#(<= |ULTIMATE.start_main_~x~0#1| 104), 48508#(<= |ULTIMATE.start_main_~x~0#1| 104), 48509#(<= |ULTIMATE.start_main_~x~0#1| 94), 48509#(<= |ULTIMATE.start_main_~x~0#1| 94), 48510#(<= |ULTIMATE.start_main_~x~0#1| 105), 48510#(<= |ULTIMATE.start_main_~x~0#1| 105), 48511#(<= |ULTIMATE.start_main_~x~0#1| 95), 48511#(<= |ULTIMATE.start_main_~x~0#1| 95), 48512#(<= |ULTIMATE.start_main_~x~0#1| 106), 48512#(<= |ULTIMATE.start_main_~x~0#1| 106), 48513#(<= |ULTIMATE.start_main_~x~0#1| 96), 48513#(<= |ULTIMATE.start_main_~x~0#1| 96), 48514#(<= |ULTIMATE.start_main_~x~0#1| 107), 48514#(<= |ULTIMATE.start_main_~x~0#1| 107), 48515#(<= |ULTIMATE.start_main_~x~0#1| 97), 48515#(<= |ULTIMATE.start_main_~x~0#1| 97), 48500#false, 48500#false, 48500#false, 48500#false, 48500#false, 48500#false, 48500#false, 48500#false, 48500#false] {48500#false} [2023-02-13 03:41:17,685 ERROR L197 FreeRefinementEngine]: {48499#true} [48499#true, 48499#true, 48499#true, 48499#true, 48501#(<= |ULTIMATE.start_main_~x~0#1| 111), 48501#(<= |ULTIMATE.start_main_~x~0#1| 111), 48502#(<= |ULTIMATE.start_main_~x~0#1| 101), 48502#(<= |ULTIMATE.start_main_~x~0#1| 101), 48503#(<= |ULTIMATE.start_main_~x~0#1| 91), 48503#(<= |ULTIMATE.start_main_~x~0#1| 91), 48504#(<= |ULTIMATE.start_main_~x~0#1| 102), 48504#(<= |ULTIMATE.start_main_~x~0#1| 102), 48505#(<= |ULTIMATE.start_main_~x~0#1| 92), 48505#(<= |ULTIMATE.start_main_~x~0#1| 92), 48506#(<= |ULTIMATE.start_main_~x~0#1| 103), 48506#(<= |ULTIMATE.start_main_~x~0#1| 103), 48507#(<= |ULTIMATE.start_main_~x~0#1| 93), 48507#(<= |ULTIMATE.start_main_~x~0#1| 93), 48508#(<= |ULTIMATE.start_main_~x~0#1| 104), 48508#(<= |ULTIMATE.start_main_~x~0#1| 104), 48509#(<= |ULTIMATE.start_main_~x~0#1| 94), 48509#(<= |ULTIMATE.start_main_~x~0#1| 94), 48510#(<= |ULTIMATE.start_main_~x~0#1| 105), 48510#(<= |ULTIMATE.start_main_~x~0#1| 105), 48511#(<= |ULTIMATE.start_main_~x~0#1| 95), 48511#(<= |ULTIMATE.start_main_~x~0#1| 95), 48512#(<= |ULTIMATE.start_main_~x~0#1| 106), 48512#(<= |ULTIMATE.start_main_~x~0#1| 106), 48513#(<= |ULTIMATE.start_main_~x~0#1| 96), 48513#(<= |ULTIMATE.start_main_~x~0#1| 96), 48514#(<= |ULTIMATE.start_main_~x~0#1| 107), 48514#(<= |ULTIMATE.start_main_~x~0#1| 107), 48515#(<= |ULTIMATE.start_main_~x~0#1| 97), 48515#(<= |ULTIMATE.start_main_~x~0#1| 97), 48500#false, 48500#false, 48500#false, 48500#false, 48500#false, 48500#false, 48500#false, 48500#false, 48500#false] {48500#false} [2023-02-13 03:41:17,685 ERROR L197 FreeRefinementEngine]: {48499#true} [48499#true, 48499#true, 48499#true, 48499#true, 48765#(< |ULTIMATE.start_main_~x~0#1| 115), 48765#(< |ULTIMATE.start_main_~x~0#1| 115), 48508#(<= |ULTIMATE.start_main_~x~0#1| 104), 48508#(<= |ULTIMATE.start_main_~x~0#1| 104), 48509#(<= |ULTIMATE.start_main_~x~0#1| 94), 48509#(<= |ULTIMATE.start_main_~x~0#1| 94), 48510#(<= |ULTIMATE.start_main_~x~0#1| 105), 48510#(<= |ULTIMATE.start_main_~x~0#1| 105), 48511#(<= |ULTIMATE.start_main_~x~0#1| 95), 48511#(<= |ULTIMATE.start_main_~x~0#1| 95), 48512#(<= |ULTIMATE.start_main_~x~0#1| 106), 48512#(<= |ULTIMATE.start_main_~x~0#1| 106), 48513#(<= |ULTIMATE.start_main_~x~0#1| 96), 48513#(<= |ULTIMATE.start_main_~x~0#1| 96), 48514#(<= |ULTIMATE.start_main_~x~0#1| 107), 48514#(<= |ULTIMATE.start_main_~x~0#1| 107), 48515#(<= |ULTIMATE.start_main_~x~0#1| 97), 48515#(<= |ULTIMATE.start_main_~x~0#1| 97), 48710#(< |ULTIMATE.start_main_~x~0#1| 109), 48710#(< |ULTIMATE.start_main_~x~0#1| 109), 48703#(< |ULTIMATE.start_main_~x~0#1| 99), 48703#(< |ULTIMATE.start_main_~x~0#1| 99), 48696#(< |ULTIMATE.start_main_~x~0#1| 110), 48696#(< |ULTIMATE.start_main_~x~0#1| 110), 48689#(< |ULTIMATE.start_main_~x~0#1| 100), 48689#(< |ULTIMATE.start_main_~x~0#1| 100), 48682#(< |ULTIMATE.start_main_~x~0#1| 111), 48682#(< |ULTIMATE.start_main_~x~0#1| 111), 48675#(not (< 100 |ULTIMATE.start_main_~x~0#1|)), 48675#(not (< 100 |ULTIMATE.start_main_~x~0#1|)), 48500#false, 48500#false, 48500#false, 48500#false, 48500#false, 48500#false, 48500#false, 48500#false, 48500#false] {48500#false} [2023-02-13 03:41:17,685 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 24 [2023-02-13 03:41:17,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714922151] [2023-02-13 03:41:17,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-13 03:41:18,188 INFO L210 LassoAnalysis]: Preferences: [2023-02-13 03:41:18,188 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-13 03:41:18,189 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-13 03:41:18,189 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-13 03:41:18,189 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-13 03:41:18,189 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:18,190 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-13 03:41:18,190 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-13 03:41:18,190 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration11_Loop [2023-02-13 03:41:18,190 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-13 03:41:18,190 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-13 03:41:18,192 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:18,195 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:18,203 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:18,209 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:18,255 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-13 03:41:18,255 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-13 03:41:18,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:18,256 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:18,257 INFO L229 MonitoredProcess]: Starting monitored process 45 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:18,260 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2023-02-13 03:41:18,261 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:41:18,262 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:18,280 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-13 03:41:18,280 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_17=1} Honda state: {v_rep~unnamed0~0~true_17=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-13 03:41:18,308 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2023-02-13 03:41:18,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:18,309 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:18,311 INFO L229 MonitoredProcess]: Starting monitored process 46 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:18,313 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2023-02-13 03:41:18,314 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:41:18,314 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:18,341 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2023-02-13 03:41:18,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:18,341 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:18,342 INFO L229 MonitoredProcess]: Starting monitored process 47 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:18,344 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2023-02-13 03:41:18,344 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-13 03:41:18,345 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:18,692 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-13 03:41:18,694 INFO L540 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2023-02-13 03:41:18,694 INFO L210 LassoAnalysis]: Preferences: [2023-02-13 03:41:18,694 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-13 03:41:18,694 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-13 03:41:18,695 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-13 03:41:18,695 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-13 03:41:18,695 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:41:18,695 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-13 03:41:18,695 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-13 03:41:18,696 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration11_Loop [2023-02-13 03:41:18,696 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-13 03:41:18,696 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-13 03:41:18,697 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:18,700 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:18,707 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:18,709 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:18,754 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-13 03:41:18,755 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-13 03:41:18,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:41:18,756 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:18,757 INFO L229 MonitoredProcess]: Starting monitored process 48 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:18,759 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2023-02-13 03:41:18,760 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-13 03:41:18,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-13 03:41:18,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-13 03:41:18,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-13 03:41:18,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-13 03:41:18,773 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-13 03:41:18,773 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-13 03:41:18,779 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-13 03:41:18,815 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2023-02-13 03:41:18,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:41:18,816 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:18,817 INFO L229 MonitoredProcess]: Starting monitored process 49 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:18,820 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2023-02-13 03:41:18,820 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-13 03:41:18,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-13 03:41:18,830 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-13 03:41:18,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-13 03:41:18,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-13 03:41:18,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-13 03:41:18,832 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-13 03:41:18,833 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-13 03:41:18,837 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-13 03:41:18,841 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-13 03:41:18,841 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-13 03:41:18,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:41:18,842 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:18,843 INFO L229 MonitoredProcess]: Starting monitored process 50 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:18,846 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-13 03:41:18,847 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-13 03:41:18,847 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2023-02-13 03:41:18,848 INFO L513 LassoAnalysis]: Proved termination. [2023-02-13 03:41:18,848 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1) = 1*ULTIMATE.start_main_~x~0#1 Supporting invariants [] [2023-02-13 03:41:18,884 INFO L540 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2023-02-13 03:41:18,885 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-13 03:41:18,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:18,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:18,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-13 03:41:18,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:18,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:18,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-13 03:41:18,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:19,153 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 132 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:41:19,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:19,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-13 03:41:19,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:19,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:19,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-13 03:41:19,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:19,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:19,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-13 03:41:19,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:20,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:20,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-13 03:41:20,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:20,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:20,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-13 03:41:20,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:20,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:20,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-13 03:41:20,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:21,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:21,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-13 03:41:21,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:21,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:21,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-13 03:41:21,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:22,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:22,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-13 03:41:22,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:22,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:22,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-13 03:41:22,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:23,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:23,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-13 03:41:23,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:23,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:23,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-13 03:41:23,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:24,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:24,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-13 03:41:24,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:24,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:24,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-13 03:41:24,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:24,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:24,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-13 03:41:24,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:24,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:24,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-13 03:41:24,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:24,724 INFO L100 LoopCannibalizer]: 19 predicates before loop cannibalization 49 predicates after loop cannibalization [2023-02-13 03:41:24,724 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 49 loop predicates [2023-02-13 03:41:24,725 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 131 states and 165 transitions. cyclomatic complexity: 38 Second operand has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:24,844 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2023-02-13 03:41:25,949 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 131 states and 165 transitions. cyclomatic complexity: 38. Second operand has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 67906 states and 78278 transitions. Complement of second has 2554 states. [2023-02-13 03:41:25,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 19 states 1 stem states 17 non-accepting loop states 1 accepting loop states [2023-02-13 03:41:25,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:25,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 49 transitions. [2023-02-13 03:41:25,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 49 transitions. Stem has 10 letters. Loop has 34 letters. [2023-02-13 03:41:25,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:41:25,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 49 transitions. Stem has 44 letters. Loop has 34 letters. [2023-02-13 03:41:25,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:41:25,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 49 transitions. Stem has 10 letters. Loop has 68 letters. [2023-02-13 03:41:25,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:41:25,951 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67906 states and 78278 transitions. [2023-02-13 03:41:26,066 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 241 [2023-02-13 03:41:26,068 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67906 states to 879 states and 969 transitions. [2023-02-13 03:41:26,068 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2023-02-13 03:41:26,068 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 77 [2023-02-13 03:41:26,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 879 states and 969 transitions. [2023-02-13 03:41:26,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-13 03:41:26,068 INFO L220 hiAutomatonCegarLoop]: Abstraction has 879 states and 969 transitions. [2023-02-13 03:41:26,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states and 969 transitions. [2023-02-13 03:41:26,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 175. [2023-02-13 03:41:26,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 175 states have (on average 1.2342857142857142) internal successors, (216), 174 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:26,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 216 transitions. [2023-02-13 03:41:26,072 INFO L242 hiAutomatonCegarLoop]: Abstraction has 175 states and 216 transitions. [2023-02-13 03:41:26,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 03:41:26,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-13 03:41:26,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2023-02-13 03:41:26,073 INFO L87 Difference]: Start difference. First operand 175 states and 216 transitions. Second operand has 24 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:26,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 03:41:26,106 INFO L93 Difference]: Finished difference Result 760 states and 809 transitions. [2023-02-13 03:41:26,106 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 760 states and 809 transitions. [2023-02-13 03:41:26,107 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 195 [2023-02-13 03:41:26,109 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 760 states to 459 states and 504 transitions. [2023-02-13 03:41:26,109 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2023-02-13 03:41:26,109 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2023-02-13 03:41:26,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 459 states and 504 transitions. [2023-02-13 03:41:26,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-13 03:41:26,110 INFO L220 hiAutomatonCegarLoop]: Abstraction has 459 states and 504 transitions. [2023-02-13 03:41:26,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states and 504 transitions. [2023-02-13 03:41:26,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 145. [2023-02-13 03:41:26,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 145 states have (on average 1.2) internal successors, (174), 144 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:26,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 174 transitions. [2023-02-13 03:41:26,113 INFO L242 hiAutomatonCegarLoop]: Abstraction has 145 states and 174 transitions. [2023-02-13 03:41:26,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-13 03:41:26,114 INFO L426 stractBuchiCegarLoop]: Abstraction has 145 states and 174 transitions. [2023-02-13 03:41:26,114 INFO L333 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-02-13 03:41:26,114 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 145 states and 174 transitions. [2023-02-13 03:41:26,114 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2023-02-13 03:41:26,114 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-13 03:41:26,114 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-13 03:41:26,115 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 4, 4, 1] [2023-02-13 03:41:26,115 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [21, 11, 10] [2023-02-13 03:41:26,115 INFO L733 eck$LassoCheckResult]: Stem: 122099#ULTIMATE.startENTRY [37] ULTIMATE.startENTRY-->L12-2: Formula: (= |v_ULTIMATE.start_main_~c~0#1_10| 1) InVars {} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_8|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_10|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_4|, ULTIMATE.start_main_#t~nondet0#1=|v_ULTIMATE.start_main_#t~nondet0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet0#1] 122100#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 122109#L12 [36] L12-->L12-2: Formula: (and (>= 100 |v_ULTIMATE.start_main_~x~0#1_2|) (= |v_ULTIMATE.start_main_~c~0#1_1| (+ |v_ULTIMATE.start_main_~c~0#1_2| 1)) (= (+ |v_ULTIMATE.start_main_~x~0#1_2| 11) |v_ULTIMATE.start_main_~x~0#1_1|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_2|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 122111#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 122120#L12 [36] L12-->L12-2: Formula: (and (>= 100 |v_ULTIMATE.start_main_~x~0#1_2|) (= |v_ULTIMATE.start_main_~c~0#1_1| (+ |v_ULTIMATE.start_main_~c~0#1_2| 1)) (= (+ |v_ULTIMATE.start_main_~x~0#1_2| 11) |v_ULTIMATE.start_main_~x~0#1_1|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_2|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 122128#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 122178#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 122177#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 122176#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 122175#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 122174#L12 [36] L12-->L12-2: Formula: (and (>= 100 |v_ULTIMATE.start_main_~x~0#1_2|) (= |v_ULTIMATE.start_main_~c~0#1_1| (+ |v_ULTIMATE.start_main_~c~0#1_2| 1)) (= (+ |v_ULTIMATE.start_main_~x~0#1_2| 11) |v_ULTIMATE.start_main_~x~0#1_1|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_2|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 122173#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 122172#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 122171#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 122168#L12 [36] L12-->L12-2: Formula: (and (>= 100 |v_ULTIMATE.start_main_~x~0#1_2|) (= |v_ULTIMATE.start_main_~c~0#1_1| (+ |v_ULTIMATE.start_main_~c~0#1_2| 1)) (= (+ |v_ULTIMATE.start_main_~x~0#1_2| 11) |v_ULTIMATE.start_main_~x~0#1_1|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_2|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 122170#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 122169#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 122167#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 122112#L12 [2023-02-13 03:41:26,116 INFO L735 eck$LassoCheckResult]: Loop: 122112#L12 [36] L12-->L12-2: Formula: (and (>= 100 |v_ULTIMATE.start_main_~x~0#1_2|) (= |v_ULTIMATE.start_main_~c~0#1_1| (+ |v_ULTIMATE.start_main_~c~0#1_2| 1)) (= (+ |v_ULTIMATE.start_main_~x~0#1_2| 11) |v_ULTIMATE.start_main_~x~0#1_1|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_2|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 122113#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 122104#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 122105#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 122101#L12 [36] L12-->L12-2: Formula: (and (>= 100 |v_ULTIMATE.start_main_~x~0#1_2|) (= |v_ULTIMATE.start_main_~c~0#1_1| (+ |v_ULTIMATE.start_main_~c~0#1_2| 1)) (= (+ |v_ULTIMATE.start_main_~x~0#1_2| 11) |v_ULTIMATE.start_main_~x~0#1_1|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_2|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 122102#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 122201#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 122200#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 122199#L12 [36] L12-->L12-2: Formula: (and (>= 100 |v_ULTIMATE.start_main_~x~0#1_2|) (= |v_ULTIMATE.start_main_~c~0#1_1| (+ |v_ULTIMATE.start_main_~c~0#1_2| 1)) (= (+ |v_ULTIMATE.start_main_~x~0#1_2| 11) |v_ULTIMATE.start_main_~x~0#1_1|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_2|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 122198#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 122197#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 122196#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 122195#L12 [36] L12-->L12-2: Formula: (and (>= 100 |v_ULTIMATE.start_main_~x~0#1_2|) (= |v_ULTIMATE.start_main_~c~0#1_1| (+ |v_ULTIMATE.start_main_~c~0#1_2| 1)) (= (+ |v_ULTIMATE.start_main_~x~0#1_2| 11) |v_ULTIMATE.start_main_~x~0#1_1|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_2|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 122194#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 122193#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 122192#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 122191#L12 [36] L12-->L12-2: Formula: (and (>= 100 |v_ULTIMATE.start_main_~x~0#1_2|) (= |v_ULTIMATE.start_main_~c~0#1_1| (+ |v_ULTIMATE.start_main_~c~0#1_2| 1)) (= (+ |v_ULTIMATE.start_main_~x~0#1_2| 11) |v_ULTIMATE.start_main_~x~0#1_1|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_2|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 122190#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 122189#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 122188#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 122187#L12 [36] L12-->L12-2: Formula: (and (>= 100 |v_ULTIMATE.start_main_~x~0#1_2|) (= |v_ULTIMATE.start_main_~c~0#1_1| (+ |v_ULTIMATE.start_main_~c~0#1_2| 1)) (= (+ |v_ULTIMATE.start_main_~x~0#1_2| 11) |v_ULTIMATE.start_main_~x~0#1_1|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_2|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 122186#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 122185#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 122184#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 122183#L12 [36] L12-->L12-2: Formula: (and (>= 100 |v_ULTIMATE.start_main_~x~0#1_2|) (= |v_ULTIMATE.start_main_~c~0#1_1| (+ |v_ULTIMATE.start_main_~c~0#1_2| 1)) (= (+ |v_ULTIMATE.start_main_~x~0#1_2| 11) |v_ULTIMATE.start_main_~x~0#1_1|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_2|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 122182#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 122096#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 122181#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 122180#L12 [36] L12-->L12-2: Formula: (and (>= 100 |v_ULTIMATE.start_main_~x~0#1_2|) (= |v_ULTIMATE.start_main_~c~0#1_1| (+ |v_ULTIMATE.start_main_~c~0#1_2| 1)) (= (+ |v_ULTIMATE.start_main_~x~0#1_2| 11) |v_ULTIMATE.start_main_~x~0#1_1|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_2|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 122179#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 122178#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 122177#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 122176#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 122175#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 122174#L12 [36] L12-->L12-2: Formula: (and (>= 100 |v_ULTIMATE.start_main_~x~0#1_2|) (= |v_ULTIMATE.start_main_~c~0#1_1| (+ |v_ULTIMATE.start_main_~c~0#1_2| 1)) (= (+ |v_ULTIMATE.start_main_~x~0#1_2| 11) |v_ULTIMATE.start_main_~x~0#1_1|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_2|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 122173#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 122172#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 122171#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 122168#L12 [36] L12-->L12-2: Formula: (and (>= 100 |v_ULTIMATE.start_main_~x~0#1_2|) (= |v_ULTIMATE.start_main_~c~0#1_1| (+ |v_ULTIMATE.start_main_~c~0#1_2| 1)) (= (+ |v_ULTIMATE.start_main_~x~0#1_2| 11) |v_ULTIMATE.start_main_~x~0#1_1|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_2|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 122170#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 122169#L12 [32] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~x~0#1_6| (+ |v_ULTIMATE.start_main_~x~0#1_7| (- 10))) (= |v_ULTIMATE.start_main_~c~0#1_8| (+ (- 1) |v_ULTIMATE.start_main_~c~0#1_9|)) (< 100 |v_ULTIMATE.start_main_~x~0#1_7|)) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_7|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_9|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_6|, ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~c~0#1] 122167#L12-2 [27] L12-2-->L12: Formula: (< 0 |v_ULTIMATE.start_main_~c~0#1_7|) InVars {ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} OutVars{ULTIMATE.start_main_~c~0#1=|v_ULTIMATE.start_main_~c~0#1_7|} AuxVars[] AssignedVars[] 122112#L12 [2023-02-13 03:41:26,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:26,116 INFO L85 PathProgramCache]: Analyzing trace with hash 354955295, now seen corresponding path program 12 times [2023-02-13 03:41:26,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:26,116 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740172223] [2023-02-13 03:41:26,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:26,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:26,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:26,120 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:41:26,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:26,122 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:41:26,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:26,123 INFO L85 PathProgramCache]: Analyzing trace with hash 408629680, now seen corresponding path program 8 times [2023-02-13 03:41:26,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:26,123 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316434794] [2023-02-13 03:41:26,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:26,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:26,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:26,128 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:41:26,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:41:26,133 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:41:26,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:26,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1576164430, now seen corresponding path program 13 times [2023-02-13 03:41:26,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:41:26,133 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964832379] [2023-02-13 03:41:26,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:41:26,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:41:26,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:26,184 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 427 proven. 138 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-02-13 03:41:26,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 03:41:26,184 INFO L335 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964832379] [2023-02-13 03:41:26,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964832379] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-13 03:41:26,185 INFO L335 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844241475] [2023-02-13 03:41:26,185 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-13 03:41:26,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 03:41:26,185 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:26,186 INFO L229 MonitoredProcess]: Starting monitored process 51 with /export/starexec/sandbox/solver/Ultimate/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-13 03:41:26,188 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2023-02-13 03:41:26,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:26,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-13 03:41:26,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:26,281 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 427 proven. 138 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-02-13 03:41:26,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-13 03:41:26,417 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 427 proven. 138 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-02-13 03:41:26,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844241475] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-13 03:41:26,417 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-13 03:41:26,418 ERROR L197 FreeRefinementEngine]: {122245#true} [122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122249#(<= |ULTIMATE.start_main_~c~0#1| 3), 122249#(<= |ULTIMATE.start_main_~c~0#1| 3), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122250#(<= |ULTIMATE.start_main_~c~0#1| 0), 122246#false, 122246#false, 122246#false, 122246#false, 122246#false, 122246#false, 122246#false, 122246#false] {122246#false} [2023-02-13 03:41:26,418 ERROR L197 FreeRefinementEngine]: {122245#true} [122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122249#(<= |ULTIMATE.start_main_~c~0#1| 3), 122249#(<= |ULTIMATE.start_main_~c~0#1| 3), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122250#(<= |ULTIMATE.start_main_~c~0#1| 0), 122246#false, 122246#false, 122246#false, 122246#false, 122246#false, 122246#false, 122246#false, 122246#false] {122246#false} [2023-02-13 03:41:26,418 ERROR L197 FreeRefinementEngine]: {122245#true} [122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122249#(<= |ULTIMATE.start_main_~c~0#1| 3), 122249#(<= |ULTIMATE.start_main_~c~0#1| 3), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122248#(<= |ULTIMATE.start_main_~c~0#1| 2), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122247#(<= |ULTIMATE.start_main_~c~0#1| 1), 122250#(<= |ULTIMATE.start_main_~c~0#1| 0), 122246#false, 122246#false, 122246#false, 122246#false, 122246#false, 122246#false, 122246#false, 122246#false] {122246#false} [2023-02-13 03:41:26,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2023-02-13 03:41:26,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723406861] [2023-02-13 03:41:26,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-13 03:41:27,120 INFO L210 LassoAnalysis]: Preferences: [2023-02-13 03:41:27,120 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-13 03:41:27,120 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-13 03:41:27,121 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-13 03:41:27,121 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-13 03:41:27,121 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:27,121 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-13 03:41:27,122 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-13 03:41:27,122 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration12_Loop [2023-02-13 03:41:27,122 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-13 03:41:27,122 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-13 03:41:27,124 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:27,131 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:27,134 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:27,138 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:27,188 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-13 03:41:27,189 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-13 03:41:27,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:27,189 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:27,191 INFO L229 MonitoredProcess]: Starting monitored process 52 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:27,193 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2023-02-13 03:41:27,194 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:41:27,194 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:27,207 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-13 03:41:27,207 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0#1=93} Honda state: {ULTIMATE.start_main_~x~0#1=93} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-13 03:41:27,244 INFO L540 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2023-02-13 03:41:27,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:27,245 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:27,246 INFO L229 MonitoredProcess]: Starting monitored process 53 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:27,248 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:41:27,248 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:27,248 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2023-02-13 03:41:27,261 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-13 03:41:27,261 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_19=0} Honda state: {v_rep~unnamed0~0~false_19=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-13 03:41:27,294 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2023-02-13 03:41:27,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:27,295 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:27,296 INFO L229 MonitoredProcess]: Starting monitored process 54 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:27,298 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2023-02-13 03:41:27,298 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:41:27,298 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:27,316 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-13 03:41:27,316 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_19=1} Honda state: {v_rep~unnamed0~0~true_19=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-13 03:41:27,353 INFO L540 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2023-02-13 03:41:27,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:27,354 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:27,355 INFO L229 MonitoredProcess]: Starting monitored process 55 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:27,357 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2023-02-13 03:41:27,358 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:41:27,358 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:27,398 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2023-02-13 03:41:27,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:41:27,399 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:27,400 INFO L229 MonitoredProcess]: Starting monitored process 56 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:27,402 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2023-02-13 03:41:27,402 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-13 03:41:27,402 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:41:27,443 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-13 03:41:27,444 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2023-02-13 03:41:27,444 INFO L210 LassoAnalysis]: Preferences: [2023-02-13 03:41:27,445 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-13 03:41:27,445 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-13 03:41:27,445 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-13 03:41:27,445 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-13 03:41:27,445 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:41:27,445 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-13 03:41:27,445 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-13 03:41:27,445 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration12_Loop [2023-02-13 03:41:27,445 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-13 03:41:27,445 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-13 03:41:27,445 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:27,453 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:27,455 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:27,457 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:41:27,502 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-13 03:41:27,502 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-13 03:41:27,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:41:27,503 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:27,505 INFO L229 MonitoredProcess]: Starting monitored process 57 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:27,507 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2023-02-13 03:41:27,508 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-13 03:41:27,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-13 03:41:27,518 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-13 03:41:27,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-13 03:41:27,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-13 03:41:27,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-13 03:41:27,520 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-13 03:41:27,520 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-13 03:41:27,524 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-13 03:41:27,561 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2023-02-13 03:41:27,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:41:27,562 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:27,564 INFO L229 MonitoredProcess]: Starting monitored process 58 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:27,566 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2023-02-13 03:41:27,566 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-13 03:41:27,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-13 03:41:27,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-13 03:41:27,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-13 03:41:27,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-13 03:41:27,574 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-13 03:41:27,574 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-13 03:41:27,580 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-13 03:41:27,618 INFO L540 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2023-02-13 03:41:27,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:41:27,618 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:27,620 INFO L229 MonitoredProcess]: Starting monitored process 59 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:27,622 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2023-02-13 03:41:27,622 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-13 03:41:27,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-13 03:41:27,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-13 03:41:27,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-13 03:41:27,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-13 03:41:27,634 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-13 03:41:27,635 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-13 03:41:27,641 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-13 03:41:27,676 INFO L540 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2023-02-13 03:41:27,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:41:27,677 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:27,678 INFO L229 MonitoredProcess]: Starting monitored process 60 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:27,681 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2023-02-13 03:41:27,681 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-13 03:41:27,690 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-13 03:41:27,690 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-13 03:41:27,690 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-13 03:41:27,690 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-13 03:41:27,690 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-13 03:41:27,691 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-13 03:41:27,691 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-13 03:41:27,695 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-13 03:41:27,698 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-13 03:41:27,699 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-13 03:41:27,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:41:27,699 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:41:27,701 INFO L229 MonitoredProcess]: Starting monitored process 61 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:41:27,703 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2023-02-13 03:41:27,703 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-13 03:41:27,704 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-13 03:41:27,704 INFO L513 LassoAnalysis]: Proved termination. [2023-02-13 03:41:27,704 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0#1) = 1*ULTIMATE.start_main_~c~0#1 Supporting invariants [] [2023-02-13 03:41:27,741 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2023-02-13 03:41:27,741 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-13 03:41:27,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:41:27,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:27,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-13 03:41:27,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:27,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:27,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-13 03:41:27,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:27,972 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 226 proven. 71 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2023-02-13 03:41:28,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:28,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-13 03:41:28,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:28,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:28,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-13 03:41:28,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:28,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:28,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-13 03:41:28,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:28,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:28,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-13 03:41:28,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:28,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:28,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-13 03:41:28,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:28,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:28,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-13 03:41:28,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:29,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:29,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-13 03:41:29,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:29,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:29,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-13 03:41:29,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:29,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:29,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-13 03:41:29,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:29,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:29,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-13 03:41:29,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:29,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:29,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-13 03:41:29,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:29,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:29,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-13 03:41:29,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:30,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:30,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-13 03:41:30,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:30,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:30,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-13 03:41:30,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:30,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:30,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-13 03:41:30,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:30,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:30,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-13 03:41:30,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:30,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:30,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-13 03:41:30,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:31,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:31,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-13 03:41:31,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:31,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-13 03:41:31,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:31,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:31,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-13 03:41:31,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:31,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:31,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-13 03:41:31,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:31,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:31,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-13 03:41:31,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:32,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:32,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-13 03:41:32,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:32,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:32,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-13 03:41:32,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:32,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:32,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-13 03:41:32,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:32,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:32,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-13 03:41:32,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:32,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:32,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-13 03:41:32,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:33,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-13 03:41:33,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:33,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:33,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-13 03:41:33,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:33,676 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2023-02-13 03:41:33,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:33,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-13 03:41:33,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:33,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:33,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-13 03:41:33,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:34,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:34,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-13 03:41:34,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:34,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:34,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-13 03:41:34,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:34,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:34,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-13 03:41:34,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:34,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:34,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-13 03:41:34,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:34,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:34,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-13 03:41:34,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:35,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:35,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-13 03:41:35,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:35,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:35,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-13 03:41:35,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:35,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:35,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-13 03:41:35,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:35,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:41:35,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-13 03:41:35,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:41:35,630 INFO L100 LoopCannibalizer]: 5 predicates before loop cannibalization 8 predicates after loop cannibalization [2023-02-13 03:41:35,631 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2023-02-13 03:41:35,631 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 145 states and 174 transitions. cyclomatic complexity: 33 Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:35,754 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 145 states and 174 transitions. cyclomatic complexity: 33. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 617 states and 762 transitions. Complement of second has 24 states. [2023-02-13 03:41:35,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 5 non-accepting loop states 2 accepting loop states [2023-02-13 03:41:35,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:35,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 18 transitions. [2023-02-13 03:41:35,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 18 transitions. Stem has 18 letters. Loop has 42 letters. [2023-02-13 03:41:35,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:41:35,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 18 transitions. Stem has 60 letters. Loop has 42 letters. [2023-02-13 03:41:35,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:41:35,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 18 transitions. Stem has 18 letters. Loop has 84 letters. [2023-02-13 03:41:35,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:41:35,764 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 617 states and 762 transitions. [2023-02-13 03:41:35,766 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-02-13 03:41:35,767 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 617 states to 0 states and 0 transitions. [2023-02-13 03:41:35,767 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-02-13 03:41:35,767 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-02-13 03:41:35,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-02-13 03:41:35,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-13 03:41:35,767 INFO L220 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-13 03:41:35,768 INFO L242 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-13 03:41:35,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 03:41:35,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-13 03:41:35,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-02-13 03:41:35,768 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:41:35,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 03:41:35,769 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2023-02-13 03:41:35,769 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2023-02-13 03:41:35,769 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-02-13 03:41:35,769 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2023-02-13 03:41:35,769 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-02-13 03:41:35,769 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-02-13 03:41:35,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-02-13 03:41:35,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-13 03:41:35,769 INFO L220 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-13 03:41:35,769 INFO L242 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-13 03:41:35,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-13 03:41:35,770 INFO L426 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-13 03:41:35,770 INFO L333 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2023-02-13 03:41:35,771 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-02-13 03:41:35,771 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-02-13 03:41:35,771 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-02-13 03:41:35,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.02 03:41:35 BasicIcfg [2023-02-13 03:41:35,779 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-02-13 03:41:35,779 INFO L158 Benchmark]: Toolchain (without parser) took 34099.54ms. Allocated memory was 2.1GB in the beginning and 2.6GB in the end (delta: 436.2MB). Free memory was 2.1GB in the beginning and 2.2GB in the end (delta: -121.4MB). Peak memory consumption was 317.1MB. Max. memory is 42.9GB. [2023-02-13 03:41:35,779 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 2.1GB. Free memory is still 2.1GB. There was no memory consumed. Max. memory is 42.9GB. [2023-02-13 03:41:35,779 INFO L158 Benchmark]: CACSL2BoogieTranslator took 141.90ms. Allocated memory is still 2.1GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 42.9GB. [2023-02-13 03:41:35,780 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.89ms. Allocated memory is still 2.1GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 42.9GB. [2023-02-13 03:41:35,780 INFO L158 Benchmark]: Boogie Preprocessor took 10.66ms. Allocated memory is still 2.1GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 42.9GB. [2023-02-13 03:41:35,780 INFO L158 Benchmark]: RCFGBuilder took 257.54ms. Allocated memory is still 2.1GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 42.9GB. [2023-02-13 03:41:35,780 INFO L158 Benchmark]: BlockEncodingV2 took 37.07ms. Allocated memory is still 2.1GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 42.9GB. [2023-02-13 03:41:35,780 INFO L158 Benchmark]: TraceAbstraction took 14.56ms. Allocated memory is still 2.1GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 42.9GB. [2023-02-13 03:41:35,781 INFO L158 Benchmark]: BuchiAutomizer took 33598.64ms. Allocated memory was 2.1GB in the beginning and 2.6GB in the end (delta: 436.2MB). Free memory was 2.1GB in the beginning and 2.2GB in the end (delta: -151.3MB). Peak memory consumption was 283.6MB. Max. memory is 42.9GB. [2023-02-13 03:41:35,782 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 8 locations, 10 edges - StatisticsResult: Encoded RCFG 3 locations, 4 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 2.1GB. Free memory is still 2.1GB. There was no memory consumed. Max. memory is 42.9GB. * CACSL2BoogieTranslator took 141.90ms. Allocated memory is still 2.1GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 42.9GB. * Boogie Procedure Inliner took 33.89ms. Allocated memory is still 2.1GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 42.9GB. * Boogie Preprocessor took 10.66ms. Allocated memory is still 2.1GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 42.9GB. * RCFGBuilder took 257.54ms. Allocated memory is still 2.1GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 42.9GB. * BlockEncodingV2 took 37.07ms. Allocated memory is still 2.1GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 42.9GB. * TraceAbstraction took 14.56ms. Allocated memory is still 2.1GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 42.9GB. * BuchiAutomizer took 33598.64ms. Allocated memory was 2.1GB in the beginning and 2.6GB in the end (delta: 436.2MB). Free memory was 2.1GB in the beginning and 2.2GB in the end (delta: -151.3MB). Peak memory consumption was 283.6MB. Max. memory is 42.9GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - AllSpecificationsHoldResult: All specifications hold We were not able to verify any specifiation because the program does not contain any specification. - StatisticsResult: Constructed decomposition of program Your program was decomposed into 16 terminating modules (6 trivial, 0 deterministic, 10 nondeterministic). One nondeterministic module has affine ranking function c and consists of 5 locations. One nondeterministic module has affine ranking function c and consists of 4 locations. One nondeterministic module has affine ranking function 211 + -2 * x and consists of 3 locations. One nondeterministic module has affine ranking function 211 + -2 * x and consists of 3 locations. One nondeterministic module has affine ranking function 201 + -2 * x and consists of 6 locations. One nondeterministic module has affine ranking function x and consists of 5 locations. One nondeterministic module has affine ranking function x and consists of 15 locations. One nondeterministic module has affine ranking function x and consists of 17 locations. One nondeterministic module has affine ranking function x and consists of 19 locations. One nondeterministic module has affine ranking function c and consists of 8 locations. 6 modules have a trivial ranking function, the largest among these consists of 24 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 33.5s and 13 iterations. TraceHistogramMax:21. Analysis of lassos took 6.8s. Construction of modules took 0.3s. Büchi inclusion checks took 25.9s. Highest rank in rank-based complementation 7. Minimization of det autom 2. Minimization of nondet autom 14. Automata minimization 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 2037 StatesRemovedByMinimization, 14 NontrivialMinimizations. Non-live state removal took 0.3s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [9, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 630/1066 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 181 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 167 mSDsluCounter, 204 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 153 mSDsCounter, 193 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 337 IncrementalHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 193 mSolverCounterUnsat, 51 mSDtfsCounter, 337 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT6 conc0 concLT3 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital21 mio100 ax157 hnf100 lsp38 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq155 hnf94 smp98 dnf100 smp100 tf110 neg100 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 21ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 8 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 10 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.2s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2023-02-13 03:41:35,823 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2023-02-13 03:41:36,026 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2023-02-13 03:41:36,224 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2023-02-13 03:41:36,434 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2023-02-13 03:41:36,628 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (1)] Ended with exit code 0 Received shutdown request...