./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-simple/nested_3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loop-simple/nested_3.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6a30debb45adf4eb2040807436dec0136066a492a6c11eb0dbebd1f179f328d9 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 15:52:26,230 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 15:52:26,294 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-09 15:52:26,300 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 15:52:26,301 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 15:52:26,335 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 15:52:26,336 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 15:52:26,336 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 15:52:26,337 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 15:52:26,340 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 15:52:26,341 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 15:52:26,341 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 15:52:26,341 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 15:52:26,341 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-09 15:52:26,342 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-09 15:52:26,342 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-09 15:52:26,342 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-09 15:52:26,342 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-09 15:52:26,343 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-09 15:52:26,343 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 15:52:26,343 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-09 15:52:26,344 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 15:52:26,345 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 15:52:26,345 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 15:52:26,345 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 15:52:26,345 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-09 15:52:26,346 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-09 15:52:26,346 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-09 15:52:26,346 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 15:52:26,346 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 15:52:26,347 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 15:52:26,347 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 15:52:26,347 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-09 15:52:26,348 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 15:52:26,348 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 15:52:26,348 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 15:52:26,348 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 15:52:26,348 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 15:52:26,349 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-09 15:52:26,349 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6a30debb45adf4eb2040807436dec0136066a492a6c11eb0dbebd1f179f328d9 [2024-11-09 15:52:26,637 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 15:52:26,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 15:52:26,661 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 15:52:26,662 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 15:52:26,663 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 15:52:26,664 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-simple/nested_3.c [2024-11-09 15:52:28,092 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 15:52:28,276 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 15:52:28,277 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-simple/nested_3.c [2024-11-09 15:52:28,287 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb879a153/4e25048091b44c039c944078616e9105/FLAG708abe1e9 [2024-11-09 15:52:28,305 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb879a153/4e25048091b44c039c944078616e9105 [2024-11-09 15:52:28,308 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 15:52:28,310 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 15:52:28,311 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 15:52:28,311 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 15:52:28,318 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 15:52:28,319 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:52:28" (1/1) ... [2024-11-09 15:52:28,320 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@219d05b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:52:28, skipping insertion in model container [2024-11-09 15:52:28,320 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:52:28" (1/1) ... [2024-11-09 15:52:28,340 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 15:52:28,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:52:28,542 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 15:52:28,558 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:52:28,575 INFO L204 MainTranslator]: Completed translation [2024-11-09 15:52:28,575 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:52:28 WrapperNode [2024-11-09 15:52:28,576 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 15:52:28,577 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 15:52:28,577 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 15:52:28,577 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 15:52:28,584 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:52:28" (1/1) ... [2024-11-09 15:52:28,591 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:52:28" (1/1) ... [2024-11-09 15:52:28,607 INFO L138 Inliner]: procedures = 10, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 41 [2024-11-09 15:52:28,608 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 15:52:28,609 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 15:52:28,609 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 15:52:28,609 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 15:52:28,619 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:52:28" (1/1) ... [2024-11-09 15:52:28,619 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:52:28" (1/1) ... [2024-11-09 15:52:28,621 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:52:28" (1/1) ... [2024-11-09 15:52:28,631 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 15:52:28,632 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:52:28" (1/1) ... [2024-11-09 15:52:28,632 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:52:28" (1/1) ... [2024-11-09 15:52:28,634 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:52:28" (1/1) ... [2024-11-09 15:52:28,638 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:52:28" (1/1) ... [2024-11-09 15:52:28,643 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:52:28" (1/1) ... [2024-11-09 15:52:28,644 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:52:28" (1/1) ... [2024-11-09 15:52:28,645 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 15:52:28,646 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 15:52:28,646 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 15:52:28,647 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 15:52:28,647 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:52:28" (1/1) ... [2024-11-09 15:52:28,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:28,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:52:28,686 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:52:28,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-09 15:52:28,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 15:52:28,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 15:52:28,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 15:52:28,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 15:52:28,808 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 15:52:28,811 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 15:52:28,972 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-11-09 15:52:28,973 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 15:52:28,990 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 15:52:28,990 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-09 15:52:28,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:52:28 BoogieIcfgContainer [2024-11-09 15:52:28,991 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 15:52:28,992 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-09 15:52:28,992 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-09 15:52:28,996 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-09 15:52:28,997 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:52:28,997 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 03:52:28" (1/3) ... [2024-11-09 15:52:29,000 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@8d6332a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:52:28, skipping insertion in model container [2024-11-09 15:52:29,000 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:52:29,000 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:52:28" (2/3) ... [2024-11-09 15:52:29,000 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@8d6332a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:52:29, skipping insertion in model container [2024-11-09 15:52:29,000 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:52:29,000 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:52:28" (3/3) ... [2024-11-09 15:52:29,002 INFO L332 chiAutomizerObserver]: Analyzing ICFG nested_3.c [2024-11-09 15:52:29,055 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-09 15:52:29,056 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-09 15:52:29,056 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-09 15:52:29,056 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-09 15:52:29,056 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-09 15:52:29,056 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-09 15:52:29,056 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-09 15:52:29,057 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-09 15:52:29,060 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 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) [2024-11-09 15:52:29,075 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-09 15:52:29,075 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:52:29,076 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:52:29,080 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:52:29,080 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-09 15:52:29,080 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-09 15:52:29,080 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 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) [2024-11-09 15:52:29,082 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-09 15:52:29,082 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:52:29,082 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:52:29,082 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:52:29,082 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-09 15:52:29,089 INFO L745 eck$LassoCheckResult]: Stem: 10#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 4#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0; 3#L21-3true [2024-11-09 15:52:29,089 INFO L747 eck$LassoCheckResult]: Loop: 3#L21-3true assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 11#L22-3true assume !(main_~b~0#1 < 6); 13#L21-2true main_#t~pre6#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre6#1; 3#L21-3true [2024-11-09 15:52:29,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:52:29,094 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-09 15:52:29,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:52:29,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277617253] [2024-11-09 15:52:29,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:52:29,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:52:29,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:29,194 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:52:29,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:29,218 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:52:29,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:52:29,222 INFO L85 PathProgramCache]: Analyzing trace with hash 39933, now seen corresponding path program 1 times [2024-11-09 15:52:29,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:52:29,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884109759] [2024-11-09 15:52:29,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:52:29,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:52:29,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:52:29,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:52:29,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:52:29,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884109759] [2024-11-09 15:52:29,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884109759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:52:29,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:52:29,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 15:52:29,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752303678] [2024-11-09 15:52:29,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:52:29,308 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:52:29,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:52:29,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:52:29,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:52:29,336 INFO L87 Difference]: Start difference. First operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 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) [2024-11-09 15:52:29,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:52:29,359 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2024-11-09 15:52:29,360 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2024-11-09 15:52:29,361 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2024-11-09 15:52:29,364 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 12 states and 15 transitions. [2024-11-09 15:52:29,364 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-09 15:52:29,365 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-09 15:52:29,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 15 transitions. [2024-11-09 15:52:29,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:52:29,365 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 15 transitions. [2024-11-09 15:52:29,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 15 transitions. [2024-11-09 15:52:29,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 9. [2024-11-09 15:52:29,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 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) [2024-11-09 15:52:29,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2024-11-09 15:52:29,389 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 11 transitions. [2024-11-09 15:52:29,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:52:29,397 INFO L425 stractBuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2024-11-09 15:52:29,398 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-09 15:52:29,399 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2024-11-09 15:52:29,399 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-09 15:52:29,400 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:52:29,400 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:52:29,400 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:52:29,401 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-09 15:52:29,401 INFO L745 eck$LassoCheckResult]: Stem: 44#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 45#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0; 40#L21-3 [2024-11-09 15:52:29,401 INFO L747 eck$LassoCheckResult]: Loop: 40#L21-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 41#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 43#L23-3 assume !(main_~c~0#1 < 6); 47#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 48#L22-3 assume !(main_~b~0#1 < 6); 46#L21-2 main_#t~pre6#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre6#1; 40#L21-3 [2024-11-09 15:52:29,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:52:29,402 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-11-09 15:52:29,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:52:29,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456922862] [2024-11-09 15:52:29,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:52:29,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:52:29,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:29,419 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:52:29,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:29,429 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:52:29,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:52:29,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1191164837, now seen corresponding path program 1 times [2024-11-09 15:52:29,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:52:29,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865229515] [2024-11-09 15:52:29,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:52:29,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:52:29,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:52:29,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:52:29,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:52:29,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865229515] [2024-11-09 15:52:29,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865229515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:52:29,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:52:29,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:52:29,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599332911] [2024-11-09 15:52:29,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:52:29,484 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:52:29,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:52:29,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:52:29,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:52:29,487 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. cyclomatic complexity: 3 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) [2024-11-09 15:52:29,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:52:29,500 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2024-11-09 15:52:29,500 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2024-11-09 15:52:29,501 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-11-09 15:52:29,502 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 13 transitions. [2024-11-09 15:52:29,502 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-09 15:52:29,503 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-09 15:52:29,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2024-11-09 15:52:29,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:52:29,503 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 13 transitions. [2024-11-09 15:52:29,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2024-11-09 15:52:29,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2024-11-09 15:52:29,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 9 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) [2024-11-09 15:52:29,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2024-11-09 15:52:29,505 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 12 transitions. [2024-11-09 15:52:29,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:52:29,506 INFO L425 stractBuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2024-11-09 15:52:29,507 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-09 15:52:29,508 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2024-11-09 15:52:29,508 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-09 15:52:29,508 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:52:29,508 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:52:29,509 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:52:29,510 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:52:29,510 INFO L745 eck$LassoCheckResult]: Stem: 70#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 71#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0; 66#L21-3 [2024-11-09 15:52:29,510 INFO L747 eck$LassoCheckResult]: Loop: 66#L21-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 67#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 72#L23-3 assume !!(main_~c~0#1 < 6); 68#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 69#L23-3 assume !(main_~c~0#1 < 6); 74#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 75#L22-3 assume !(main_~b~0#1 < 6); 73#L21-2 main_#t~pre6#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre6#1; 66#L21-3 [2024-11-09 15:52:29,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:52:29,511 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-11-09 15:52:29,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:52:29,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344188470] [2024-11-09 15:52:29,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:52:29,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:52:29,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:29,524 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:52:29,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:29,536 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:52:29,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:52:29,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1993060441, now seen corresponding path program 1 times [2024-11-09 15:52:29,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:52:29,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651574650] [2024-11-09 15:52:29,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:52:29,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:52:29,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:52:29,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:52:29,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:52:29,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651574650] [2024-11-09 15:52:29,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651574650] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:52:29,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298447528] [2024-11-09 15:52:29,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:52:29,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:52:29,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:52:29,608 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:52:29,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 15:52:29,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:52:29,661 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 15:52:29,663 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:52:29,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:52:29,698 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:52:29,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:52:29,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298447528] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:52:29,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:52:29,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-09 15:52:29,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233745637] [2024-11-09 15:52:29,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:52:29,738 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:52:29,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:52:29,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 15:52:29,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 15:52:29,741 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. cyclomatic complexity: 3 Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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) [2024-11-09 15:52:29,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:52:29,773 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2024-11-09 15:52:29,774 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 18 transitions. [2024-11-09 15:52:29,774 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2024-11-09 15:52:29,775 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 18 transitions. [2024-11-09 15:52:29,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2024-11-09 15:52:29,775 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2024-11-09 15:52:29,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 18 transitions. [2024-11-09 15:52:29,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:52:29,775 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 18 transitions. [2024-11-09 15:52:29,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 18 transitions. [2024-11-09 15:52:29,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-09 15:52:29,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.125) internal successors, (18), 15 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) [2024-11-09 15:52:29,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2024-11-09 15:52:29,781 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 18 transitions. [2024-11-09 15:52:29,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 15:52:29,782 INFO L425 stractBuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2024-11-09 15:52:29,783 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-09 15:52:29,783 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 18 transitions. [2024-11-09 15:52:29,784 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2024-11-09 15:52:29,784 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:52:29,784 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:52:29,785 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:52:29,785 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 1, 1, 1, 1, 1, 1] [2024-11-09 15:52:29,785 INFO L745 eck$LassoCheckResult]: Stem: 147#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 148#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0; 143#L21-3 [2024-11-09 15:52:29,785 INFO L747 eck$LassoCheckResult]: Loop: 143#L21-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 144#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 149#L23-3 assume !!(main_~c~0#1 < 6); 145#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 146#L23-3 assume !!(main_~c~0#1 < 6); 158#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 157#L23-3 assume !!(main_~c~0#1 < 6); 156#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 155#L23-3 assume !!(main_~c~0#1 < 6); 154#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 153#L23-3 assume !(main_~c~0#1 < 6); 151#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 152#L22-3 assume !(main_~b~0#1 < 6); 150#L21-2 main_#t~pre6#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre6#1; 143#L21-3 [2024-11-09 15:52:29,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:52:29,786 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-11-09 15:52:29,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:52:29,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347662500] [2024-11-09 15:52:29,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:52:29,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:52:29,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:29,800 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:52:29,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:29,805 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:52:29,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:52:29,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1917011795, now seen corresponding path program 2 times [2024-11-09 15:52:29,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:52:29,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474908938] [2024-11-09 15:52:29,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:52:29,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:52:29,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:52:29,885 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 15:52:29,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:52:29,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474908938] [2024-11-09 15:52:29,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474908938] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:52:29,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588976325] [2024-11-09 15:52:29,887 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 15:52:29,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:52:29,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:52:29,891 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:52:29,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 15:52:29,941 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 15:52:29,941 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:52:29,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 15:52:29,944 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:52:30,044 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:52:30,045 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:52:30,114 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:52:30,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588976325] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:52:30,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:52:30,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 10 [2024-11-09 15:52:30,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053340293] [2024-11-09 15:52:30,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:52:30,116 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:52:30,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:52:30,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 15:52:30,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-09 15:52:30,118 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. cyclomatic complexity: 3 Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 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) [2024-11-09 15:52:30,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:52:30,332 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2024-11-09 15:52:30,332 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 53 transitions. [2024-11-09 15:52:30,334 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2024-11-09 15:52:30,335 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 53 transitions. [2024-11-09 15:52:30,335 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2024-11-09 15:52:30,335 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2024-11-09 15:52:30,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 53 transitions. [2024-11-09 15:52:30,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:52:30,336 INFO L218 hiAutomatonCegarLoop]: Abstraction has 49 states and 53 transitions. [2024-11-09 15:52:30,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 53 transitions. [2024-11-09 15:52:30,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 35. [2024-11-09 15:52:30,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 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) [2024-11-09 15:52:30,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2024-11-09 15:52:30,340 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-11-09 15:52:30,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 15:52:30,345 INFO L425 stractBuchiCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-11-09 15:52:30,345 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-09 15:52:30,345 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 38 transitions. [2024-11-09 15:52:30,346 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2024-11-09 15:52:30,346 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:52:30,346 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:52:30,347 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:52:30,347 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [12, 12, 2, 2, 2, 1, 1, 1] [2024-11-09 15:52:30,347 INFO L745 eck$LassoCheckResult]: Stem: 327#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 328#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0; 323#L21-3 [2024-11-09 15:52:30,351 INFO L747 eck$LassoCheckResult]: Loop: 323#L21-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 324#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 348#L23-3 assume !!(main_~c~0#1 < 6); 347#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 346#L23-3 assume !!(main_~c~0#1 < 6); 345#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 344#L23-3 assume !!(main_~c~0#1 < 6); 343#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 342#L23-3 assume !!(main_~c~0#1 < 6); 341#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 340#L23-3 assume !!(main_~c~0#1 < 6); 339#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 338#L23-3 assume !!(main_~c~0#1 < 6); 337#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 336#L23-3 assume !(main_~c~0#1 < 6); 333#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 330#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 331#L23-3 assume !!(main_~c~0#1 < 6); 325#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 326#L23-3 assume !!(main_~c~0#1 < 6); 329#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 357#L23-3 assume !!(main_~c~0#1 < 6); 356#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 355#L23-3 assume !!(main_~c~0#1 < 6); 354#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 353#L23-3 assume !!(main_~c~0#1 < 6); 352#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 351#L23-3 assume !!(main_~c~0#1 < 6); 350#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 349#L23-3 assume !(main_~c~0#1 < 6); 335#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 334#L22-3 assume !(main_~b~0#1 < 6); 332#L21-2 main_#t~pre6#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre6#1; 323#L21-3 [2024-11-09 15:52:30,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:52:30,352 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2024-11-09 15:52:30,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:52:30,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127087487] [2024-11-09 15:52:30,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:52:30,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:52:30,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:30,360 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:52:30,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:30,367 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:52:30,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:52:30,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1010871677, now seen corresponding path program 3 times [2024-11-09 15:52:30,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:52:30,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858919411] [2024-11-09 15:52:30,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:52:30,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:52:30,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:52:30,524 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 89 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-09 15:52:30,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:52:30,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858919411] [2024-11-09 15:52:30,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858919411] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:52:30,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575584363] [2024-11-09 15:52:30,525 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 15:52:30,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:52:30,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:52:30,528 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:52:30,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 15:52:30,574 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2024-11-09 15:52:30,574 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:52:30,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:52:30,577 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:52:30,668 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 89 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-09 15:52:30,668 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:52:30,768 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 89 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-09 15:52:30,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575584363] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:52:30,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:52:30,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-09 15:52:30,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535441184] [2024-11-09 15:52:30,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:52:30,771 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:52:30,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:52:30,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 15:52:30,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-09 15:52:30,772 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. cyclomatic complexity: 4 Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 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) [2024-11-09 15:52:30,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:52:30,812 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2024-11-09 15:52:30,813 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 102 transitions. [2024-11-09 15:52:30,815 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2024-11-09 15:52:30,816 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 95 states and 102 transitions. [2024-11-09 15:52:30,818 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2024-11-09 15:52:30,819 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2024-11-09 15:52:30,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 102 transitions. [2024-11-09 15:52:30,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:52:30,821 INFO L218 hiAutomatonCegarLoop]: Abstraction has 95 states and 102 transitions. [2024-11-09 15:52:30,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 102 transitions. [2024-11-09 15:52:30,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-09 15:52:30,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 95 states have (on average 1.0736842105263158) internal successors, (102), 94 states have internal predecessors, (102), 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) [2024-11-09 15:52:30,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2024-11-09 15:52:30,832 INFO L240 hiAutomatonCegarLoop]: Abstraction has 95 states and 102 transitions. [2024-11-09 15:52:30,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 15:52:30,836 INFO L425 stractBuchiCegarLoop]: Abstraction has 95 states and 102 transitions. [2024-11-09 15:52:30,836 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-09 15:52:30,837 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states and 102 transitions. [2024-11-09 15:52:30,838 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2024-11-09 15:52:30,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:52:30,838 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:52:30,840 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:52:30,841 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [36, 36, 6, 6, 6, 1, 1, 1] [2024-11-09 15:52:30,841 INFO L745 eck$LassoCheckResult]: Stem: 660#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 661#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0; 656#L21-3 [2024-11-09 15:52:30,844 INFO L747 eck$LassoCheckResult]: Loop: 656#L21-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 657#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 662#L23-3 assume !!(main_~c~0#1 < 6); 658#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 659#L23-3 assume !!(main_~c~0#1 < 6); 747#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 745#L23-3 assume !!(main_~c~0#1 < 6); 743#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 741#L23-3 assume !!(main_~c~0#1 < 6); 739#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 737#L23-3 assume !!(main_~c~0#1 < 6); 735#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 733#L23-3 assume !!(main_~c~0#1 < 6); 731#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 730#L23-3 assume !(main_~c~0#1 < 6); 664#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 665#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 750#L23-3 assume !!(main_~c~0#1 < 6); 749#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 748#L23-3 assume !!(main_~c~0#1 < 6); 746#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 744#L23-3 assume !!(main_~c~0#1 < 6); 742#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 740#L23-3 assume !!(main_~c~0#1 < 6); 738#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 736#L23-3 assume !!(main_~c~0#1 < 6); 734#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 732#L23-3 assume !!(main_~c~0#1 < 6); 729#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 728#L23-3 assume !(main_~c~0#1 < 6); 727#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 726#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 725#L23-3 assume !!(main_~c~0#1 < 6); 724#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 723#L23-3 assume !!(main_~c~0#1 < 6); 722#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 721#L23-3 assume !!(main_~c~0#1 < 6); 720#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 719#L23-3 assume !!(main_~c~0#1 < 6); 718#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 717#L23-3 assume !!(main_~c~0#1 < 6); 716#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 715#L23-3 assume !!(main_~c~0#1 < 6); 714#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 713#L23-3 assume !(main_~c~0#1 < 6); 712#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 711#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 710#L23-3 assume !!(main_~c~0#1 < 6); 709#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 708#L23-3 assume !!(main_~c~0#1 < 6); 707#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 706#L23-3 assume !!(main_~c~0#1 < 6); 705#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 704#L23-3 assume !!(main_~c~0#1 < 6); 703#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 702#L23-3 assume !!(main_~c~0#1 < 6); 701#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 700#L23-3 assume !!(main_~c~0#1 < 6); 699#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 698#L23-3 assume !(main_~c~0#1 < 6); 697#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 696#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 695#L23-3 assume !!(main_~c~0#1 < 6); 694#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 693#L23-3 assume !!(main_~c~0#1 < 6); 692#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 691#L23-3 assume !!(main_~c~0#1 < 6); 690#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 689#L23-3 assume !!(main_~c~0#1 < 6); 688#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 687#L23-3 assume !!(main_~c~0#1 < 6); 686#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 685#L23-3 assume !!(main_~c~0#1 < 6); 684#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 683#L23-3 assume !(main_~c~0#1 < 6); 682#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 681#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 667#L23-3 assume !!(main_~c~0#1 < 6); 680#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 679#L23-3 assume !!(main_~c~0#1 < 6); 678#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 677#L23-3 assume !!(main_~c~0#1 < 6); 676#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 675#L23-3 assume !!(main_~c~0#1 < 6); 674#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 673#L23-3 assume !!(main_~c~0#1 < 6); 672#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 671#L23-3 assume !!(main_~c~0#1 < 6); 670#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 669#L23-3 assume !(main_~c~0#1 < 6); 668#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 666#L22-3 assume !(main_~b~0#1 < 6); 663#L21-2 main_#t~pre6#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre6#1; 656#L21-3 [2024-11-09 15:52:30,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:52:30,844 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2024-11-09 15:52:30,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:52:30,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926668199] [2024-11-09 15:52:30,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:52:30,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:52:30,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:30,852 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:52:30,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:30,860 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:52:30,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:52:30,861 INFO L85 PathProgramCache]: Analyzing trace with hash -655757187, now seen corresponding path program 4 times [2024-11-09 15:52:30,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:52:30,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397655564] [2024-11-09 15:52:30,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:52:30,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:52:30,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:30,912 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:52:30,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:30,945 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:52:30,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:52:30,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1993610245, now seen corresponding path program 1 times [2024-11-09 15:52:30,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:52:30,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768898957] [2024-11-09 15:52:30,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:52:30,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:52:30,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:30,993 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:52:31,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:31,044 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:52:31,888 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:52:31,889 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:52:31,889 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:52:31,889 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:52:31,889 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:52:31,889 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:31,889 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:52:31,889 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:52:31,889 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration6_Loop [2024-11-09 15:52:31,889 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:52:31,890 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:52:31,904 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:52:31,912 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:52:31,918 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:52:31,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:52:31,926 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:52:31,928 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:52:31,987 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:52:31,988 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:52:31,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:31,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:52:31,992 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:52:31,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-09 15:52:31,994 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:52:31,994 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:52:32,008 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:52:32,009 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~pre5#1=0} Honda state: {ULTIMATE.start_main_#t~pre5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 15:52:32,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-09 15:52:32,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:32,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:52:32,021 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:52:32,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-09 15:52:32,023 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:52:32,023 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:52:32,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-09 15:52:32,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:32,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:52:32,055 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:52:32,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-09 15:52:32,057 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:52:32,057 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:52:32,091 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:52:32,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-09 15:52:32,097 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:52:32,097 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:52:32,097 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:52:32,098 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:52:32,098 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:52:32,098 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:32,098 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:52:32,098 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:52:32,098 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration6_Loop [2024-11-09 15:52:32,098 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:52:32,098 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:52:32,099 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:52:32,105 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:52:32,109 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:52:32,111 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:52:32,114 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:52:32,119 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:52:32,162 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:52:32,165 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:52:32,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:32,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:52:32,167 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:52:32,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-09 15:52:32,169 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 [2024-11-09 15:52:32,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:52:32,180 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:52:32,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:52:32,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:52:32,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:52:32,182 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:52:32,182 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:52:32,184 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:52:32,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-11-09 15:52:32,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:32,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:52:32,196 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:52:32,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-09 15:52:32,199 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 [2024-11-09 15:52:32,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:52:32,208 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:52:32,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:52:32,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:52:32,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:52:32,209 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:52:32,209 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:52:32,213 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:52:32,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-09 15:52:32,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:32,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:52:32,230 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:52:32,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-09 15:52:32,233 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 [2024-11-09 15:52:32,245 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:52:32,246 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:52:32,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:52:32,246 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:52:32,246 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:52:32,247 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:52:32,247 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:52:32,250 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:52:32,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-11-09 15:52:32,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:32,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:52:32,268 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:52:32,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-09 15:52:32,270 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 [2024-11-09 15:52:32,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:52:32,281 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:52:32,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:52:32,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:52:32,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:52:32,282 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:52:32,282 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:52:32,284 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:52:32,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-11-09 15:52:32,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:32,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:52:32,301 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:52:32,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-09 15:52:32,305 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 [2024-11-09 15:52:32,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:52:32,318 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:52:32,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:52:32,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:52:32,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:52:32,320 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:52:32,320 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:52:32,322 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:52:32,326 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-09 15:52:32,326 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-09 15:52:32,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:32,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:52:32,329 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:52:32,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-09 15:52:32,332 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:52:32,332 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 15:52:32,333 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:52:32,333 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~a~0#1) = -2*ULTIMATE.start_main_~a~0#1 + 11 Supporting invariants [] [2024-11-09 15:52:32,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-09 15:52:32,352 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 15:52:32,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:52:32,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:52:32,390 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:52:32,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:52:32,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:52:32,433 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:52:32,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:52:32,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-11-09 15:52:32,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1527 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1527 trivial. 0 not checked. [2024-11-09 15:52:32,872 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-09 15:52:32,873 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 95 states and 102 transitions. cyclomatic complexity: 8 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) [2024-11-09 15:52:32,914 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 95 states and 102 transitions. cyclomatic complexity: 8. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) Result 188 states and 203 transitions. Complement of second has 4 states. [2024-11-09 15:52:32,915 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 [2024-11-09 15:52:32,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) [2024-11-09 15:52:32,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2024-11-09 15:52:32,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 2 letters. Loop has 93 letters. [2024-11-09 15:52:32,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:52:32,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 95 letters. Loop has 93 letters. [2024-11-09 15:52:32,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:52:32,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 2 letters. Loop has 186 letters. [2024-11-09 15:52:32,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:52:32,927 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 188 states and 203 transitions. [2024-11-09 15:52:32,930 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 25 [2024-11-09 15:52:32,934 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 188 states to 187 states and 202 transitions. [2024-11-09 15:52:32,935 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 93 [2024-11-09 15:52:32,935 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2024-11-09 15:52:32,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 187 states and 202 transitions. [2024-11-09 15:52:32,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:52:32,935 INFO L218 hiAutomatonCegarLoop]: Abstraction has 187 states and 202 transitions. [2024-11-09 15:52:32,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states and 202 transitions. [2024-11-09 15:52:32,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 111. [2024-11-09 15:52:32,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 111 states have (on average 1.09009009009009) internal successors, (121), 110 states have internal predecessors, (121), 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) [2024-11-09 15:52:32,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2024-11-09 15:52:32,946 INFO L240 hiAutomatonCegarLoop]: Abstraction has 111 states and 121 transitions. [2024-11-09 15:52:32,946 INFO L425 stractBuchiCegarLoop]: Abstraction has 111 states and 121 transitions. [2024-11-09 15:52:32,946 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-09 15:52:32,946 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states and 121 transitions. [2024-11-09 15:52:32,947 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2024-11-09 15:52:32,950 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:52:32,950 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:52:32,950 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-09 15:52:32,950 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 1, 1, 1] [2024-11-09 15:52:32,951 INFO L745 eck$LassoCheckResult]: Stem: 1251#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 1252#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0; 1243#L21-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 1245#L22-3 [2024-11-09 15:52:32,951 INFO L747 eck$LassoCheckResult]: Loop: 1245#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 1253#L23-3 assume !!(main_~c~0#1 < 6); 1247#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 1248#L23-3 assume !!(main_~c~0#1 < 6); 1353#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 1352#L23-3 assume !!(main_~c~0#1 < 6); 1351#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 1350#L23-3 assume !!(main_~c~0#1 < 6); 1349#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 1348#L23-3 assume !!(main_~c~0#1 < 6); 1347#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 1346#L23-3 assume !!(main_~c~0#1 < 6); 1345#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 1344#L23-3 assume !(main_~c~0#1 < 6); 1257#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 1245#L22-3 [2024-11-09 15:52:32,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:52:32,951 INFO L85 PathProgramCache]: Analyzing trace with hash 29863, now seen corresponding path program 1 times [2024-11-09 15:52:32,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:52:32,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720563623] [2024-11-09 15:52:32,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:52:32,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:52:32,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:32,962 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:52:32,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:32,965 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:52:32,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:52:32,965 INFO L85 PathProgramCache]: Analyzing trace with hash -706979195, now seen corresponding path program 1 times [2024-11-09 15:52:32,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:52:32,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050652144] [2024-11-09 15:52:32,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:52:32,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:52:32,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:32,970 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:52:32,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:32,973 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:52:32,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:52:32,974 INFO L85 PathProgramCache]: Analyzing trace with hash 855328031, now seen corresponding path program 1 times [2024-11-09 15:52:32,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:52:32,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800279742] [2024-11-09 15:52:32,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:52:32,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:52:32,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:32,979 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:52:32,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:32,984 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:52:33,041 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:52:33,041 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:52:33,041 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:52:33,041 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:52:33,041 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:52:33,041 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:33,041 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:52:33,041 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:52:33,041 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration7_Loop [2024-11-09 15:52:33,041 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:52:33,041 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:52:33,042 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:52:33,047 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:52:33,050 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:52:33,052 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:52:33,078 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:52:33,078 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:52:33,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:33,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:52:33,080 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:52:33,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-09 15:52:33,085 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:52:33,085 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:52:33,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-11-09 15:52:33,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:33,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:52:33,116 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:52:33,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-09 15:52:33,120 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:52:33,120 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:52:33,155 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:52:33,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-09 15:52:33,162 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:52:33,162 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:52:33,162 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:52:33,162 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:52:33,162 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:52:33,162 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:33,162 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:52:33,163 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:52:33,163 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration7_Loop [2024-11-09 15:52:33,163 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:52:33,163 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:52:33,164 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:52:33,169 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:52:33,171 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:52:33,173 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:52:33,199 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:52:33,200 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:52:33,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:33,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:52:33,201 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:52:33,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-09 15:52:33,204 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 [2024-11-09 15:52:33,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:52:33,217 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:52:33,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:52:33,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:52:33,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:52:33,218 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:52:33,218 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:52:33,221 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:52:33,224 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-09 15:52:33,224 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-09 15:52:33,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:33,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:52:33,226 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:52:33,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-09 15:52:33,228 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:52:33,228 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 15:52:33,228 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:52:33,228 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~b~0#1) = -2*ULTIMATE.start_main_~b~0#1 + 11 Supporting invariants [] [2024-11-09 15:52:33,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-09 15:52:33,245 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 15:52:33,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:52:33,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:52:33,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:52:33,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:52:33,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:52:33,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:52:33,280 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:52:33,335 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-09 15:52:33,336 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-09 15:52:33,336 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 111 states and 121 transitions. cyclomatic complexity: 12 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) [2024-11-09 15:52:33,364 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 111 states and 121 transitions. cyclomatic complexity: 12. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 320 states and 348 transitions. Complement of second has 7 states. [2024-11-09 15:52:33,368 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 [2024-11-09 15:52:33,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) [2024-11-09 15:52:33,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2024-11-09 15:52:33,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 3 letters. Loop has 15 letters. [2024-11-09 15:52:33,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:52:33,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 18 letters. Loop has 15 letters. [2024-11-09 15:52:33,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:52:33,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 3 letters. Loop has 30 letters. [2024-11-09 15:52:33,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:52:33,369 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 320 states and 348 transitions. [2024-11-09 15:52:33,373 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2024-11-09 15:52:33,374 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 320 states to 233 states and 254 transitions. [2024-11-09 15:52:33,374 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2024-11-09 15:52:33,374 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2024-11-09 15:52:33,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 233 states and 254 transitions. [2024-11-09 15:52:33,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:52:33,374 INFO L218 hiAutomatonCegarLoop]: Abstraction has 233 states and 254 transitions. [2024-11-09 15:52:33,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states and 254 transitions. [2024-11-09 15:52:33,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 129. [2024-11-09 15:52:33,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 129 states have (on average 1.1007751937984496) internal successors, (142), 128 states have internal predecessors, (142), 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) [2024-11-09 15:52:33,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 142 transitions. [2024-11-09 15:52:33,391 INFO L240 hiAutomatonCegarLoop]: Abstraction has 129 states and 142 transitions. [2024-11-09 15:52:33,391 INFO L425 stractBuchiCegarLoop]: Abstraction has 129 states and 142 transitions. [2024-11-09 15:52:33,391 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-09 15:52:33,391 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 129 states and 142 transitions. [2024-11-09 15:52:33,392 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2024-11-09 15:52:33,392 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:52:33,392 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:52:33,393 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-09 15:52:33,393 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:52:33,394 INFO L745 eck$LassoCheckResult]: Stem: 1760#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 1761#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0; 1751#L21-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 1753#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 1757#L23-3 [2024-11-09 15:52:33,394 INFO L747 eck$LassoCheckResult]: Loop: 1757#L23-3 assume !!(main_~c~0#1 < 6); 1756#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 1757#L23-3 [2024-11-09 15:52:33,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:52:33,394 INFO L85 PathProgramCache]: Analyzing trace with hash 925771, now seen corresponding path program 1 times [2024-11-09 15:52:33,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:52:33,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417812019] [2024-11-09 15:52:33,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:52:33,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:52:33,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:33,402 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:52:33,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:33,405 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:52:33,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:52:33,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1795, now seen corresponding path program 1 times [2024-11-09 15:52:33,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:52:33,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776065204] [2024-11-09 15:52:33,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:52:33,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:52:33,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:33,408 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:52:33,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:33,409 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:52:33,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:52:33,410 INFO L85 PathProgramCache]: Analyzing trace with hash 889666765, now seen corresponding path program 1 times [2024-11-09 15:52:33,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:52:33,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115919408] [2024-11-09 15:52:33,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:52:33,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:52:33,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:33,413 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:52:33,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:33,416 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:52:33,429 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:52:33,429 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:52:33,429 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:52:33,429 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:52:33,429 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:52:33,429 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:33,429 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:52:33,429 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:52:33,429 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration8_Loop [2024-11-09 15:52:33,429 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:52:33,429 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:52:33,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:52:33,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:52:33,451 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:52:33,451 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:52:33,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:33,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:52:33,453 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:52:33,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-09 15:52:33,456 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:52:33,456 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:52:33,473 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:52:33,473 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~pre4#1=0} Honda state: {ULTIMATE.start_main_#t~pre4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 15:52:33,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-11-09 15:52:33,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:33,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:52:33,489 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:52:33,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-09 15:52:33,493 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:52:33,493 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:52:33,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-11-09 15:52:33,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:33,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:52:33,527 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:52:33,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-09 15:52:33,529 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:52:33,529 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:52:33,567 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:52:33,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-11-09 15:52:33,572 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:52:33,572 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:52:33,572 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:52:33,572 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:52:33,572 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:52:33,573 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:33,573 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:52:33,573 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:52:33,573 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration8_Loop [2024-11-09 15:52:33,573 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:52:33,573 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:52:33,573 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:52:33,580 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:52:33,596 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:52:33,596 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:52:33,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:33,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:52:33,598 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:52:33,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-09 15:52:33,600 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 [2024-11-09 15:52:33,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:52:33,613 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:52:33,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:52:33,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:52:33,614 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:52:33,615 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:52:33,618 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:52:33,623 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:52:33,627 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-09 15:52:33,628 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-09 15:52:33,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:33,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:52:33,630 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:52:33,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-09 15:52:33,632 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:52:33,632 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 15:52:33,632 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:52:33,632 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0#1) = -2*ULTIMATE.start_main_~c~0#1 + 11 Supporting invariants [] [2024-11-09 15:52:33,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-11-09 15:52:33,644 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 15:52:33,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:52:33,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:52:33,663 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:52:33,664 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:52:33,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:52:33,670 WARN L253 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:52:33,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:52:33,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:52:33,683 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-09 15:52:33,683 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 129 states and 142 transitions. cyclomatic complexity: 17 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) [2024-11-09 15:52:33,709 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 129 states and 142 transitions. cyclomatic complexity: 17. 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 180 states and 199 transitions. Complement of second has 7 states. [2024-11-09 15:52:33,709 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 [2024-11-09 15:52:33,710 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) [2024-11-09 15:52:33,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2024-11-09 15:52:33,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 4 letters. Loop has 2 letters. [2024-11-09 15:52:33,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:52:33,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2024-11-09 15:52:33,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:52:33,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 4 letters. Loop has 4 letters. [2024-11-09 15:52:33,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:52:33,710 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 180 states and 199 transitions. [2024-11-09 15:52:33,712 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2024-11-09 15:52:33,713 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 180 states to 160 states and 175 transitions. [2024-11-09 15:52:33,713 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-11-09 15:52:33,713 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2024-11-09 15:52:33,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 160 states and 175 transitions. [2024-11-09 15:52:33,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:52:33,718 INFO L218 hiAutomatonCegarLoop]: Abstraction has 160 states and 175 transitions. [2024-11-09 15:52:33,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states and 175 transitions. [2024-11-09 15:52:33,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 129. [2024-11-09 15:52:33,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 129 states have (on average 1.0930232558139534) internal successors, (141), 128 states have internal predecessors, (141), 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) [2024-11-09 15:52:33,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 141 transitions. [2024-11-09 15:52:33,727 INFO L240 hiAutomatonCegarLoop]: Abstraction has 129 states and 141 transitions. [2024-11-09 15:52:33,727 INFO L425 stractBuchiCegarLoop]: Abstraction has 129 states and 141 transitions. [2024-11-09 15:52:33,727 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-09 15:52:33,727 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 129 states and 141 transitions. [2024-11-09 15:52:33,728 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2024-11-09 15:52:33,728 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:52:33,728 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:52:33,731 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 2, 1, 1, 1, 1, 1] [2024-11-09 15:52:33,731 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:52:33,731 INFO L745 eck$LassoCheckResult]: Stem: 2110#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 2111#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0; 2101#L21-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 2103#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 2112#L23-3 assume !!(main_~c~0#1 < 6); 2108#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 2109#L23-3 assume !!(main_~c~0#1 < 6); 2228#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 2226#L23-3 assume !!(main_~c~0#1 < 6); 2224#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 2222#L23-3 assume !!(main_~c~0#1 < 6); 2220#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 2218#L23-3 assume !!(main_~c~0#1 < 6); 2216#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 2214#L23-3 assume !!(main_~c~0#1 < 6); 2211#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 2210#L23-3 assume !(main_~c~0#1 < 6); 2207#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 2147#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 2107#L23-3 [2024-11-09 15:52:33,731 INFO L747 eck$LassoCheckResult]: Loop: 2107#L23-3 assume !!(main_~c~0#1 < 6); 2106#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 2107#L23-3 [2024-11-09 15:52:33,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:52:33,732 INFO L85 PathProgramCache]: Analyzing trace with hash 745365203, now seen corresponding path program 2 times [2024-11-09 15:52:33,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:52:33,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543389520] [2024-11-09 15:52:33,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:52:33,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:52:33,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:33,740 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:52:33,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:33,747 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:52:33,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:52:33,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1795, now seen corresponding path program 2 times [2024-11-09 15:52:33,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:52:33,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468785599] [2024-11-09 15:52:33,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:52:33,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:52:33,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:33,752 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:52:33,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:33,754 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:52:33,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:52:33,755 INFO L85 PathProgramCache]: Analyzing trace with hash -963577515, now seen corresponding path program 3 times [2024-11-09 15:52:33,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:52:33,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833082928] [2024-11-09 15:52:33,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:52:33,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:52:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:33,761 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:52:33,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:33,769 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:52:33,782 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:52:33,782 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:52:33,782 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:52:33,782 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:52:33,782 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:52:33,782 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:33,782 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:52:33,782 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:52:33,782 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration9_Loop [2024-11-09 15:52:33,782 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:52:33,782 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:52:33,783 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:52:33,785 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:52:33,806 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:52:33,806 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:52:33,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:33,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:52:33,809 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:52:33,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-09 15:52:33,812 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:52:33,812 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:52:33,828 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:52:33,828 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~pre4#1=0} Honda state: {ULTIMATE.start_main_#t~pre4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 15:52:33,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-11-09 15:52:33,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:33,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:52:33,845 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:52:33,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-09 15:52:33,848 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:52:33,848 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:52:33,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-11-09 15:52:33,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:33,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:52:33,882 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:52:33,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-09 15:52:33,885 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:52:33,885 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:52:33,917 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:52:33,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-11-09 15:52:33,921 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:52:33,921 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:52:33,921 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:52:33,921 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:52:33,922 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:52:33,922 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:33,922 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:52:33,922 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:52:33,922 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration9_Loop [2024-11-09 15:52:33,922 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:52:33,922 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:52:33,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:52:33,925 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:52:33,948 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:52:33,948 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:52:33,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:33,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:52:33,950 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:52:33,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-09 15:52:33,952 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 [2024-11-09 15:52:33,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:52:33,964 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:52:33,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:52:33,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:52:33,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:52:33,965 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:52:33,965 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:52:33,968 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:52:33,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-11-09 15:52:33,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:33,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:52:33,986 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:52:33,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-09 15:52:33,988 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 [2024-11-09 15:52:34,001 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:52:34,001 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:52:34,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:52:34,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:52:34,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:52:34,005 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:52:34,005 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:52:34,008 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:52:34,011 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-09 15:52:34,011 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-09 15:52:34,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:34,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:52:34,013 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:52:34,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-09 15:52:34,044 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:52:34,044 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 15:52:34,044 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:52:34,044 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0#1) = -2*ULTIMATE.start_main_~c~0#1 + 11 Supporting invariants [] [2024-11-09 15:52:34,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-11-09 15:52:34,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-11-09 15:52:34,064 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 15:52:34,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-09 15:52:34,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:52:34,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:52:34,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:52:34,107 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:52:34,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:52:34,135 WARN L253 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:52:34,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:52:34,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:52:34,149 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-09 15:52:34,149 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 129 states and 141 transitions. cyclomatic complexity: 16 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) [2024-11-09 15:52:34,170 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 129 states and 141 transitions. cyclomatic complexity: 16. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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 176 states and 193 transitions. Complement of second has 7 states. [2024-11-09 15:52:34,171 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 [2024-11-09 15:52:34,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) [2024-11-09 15:52:34,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2024-11-09 15:52:34,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 19 letters. Loop has 2 letters. [2024-11-09 15:52:34,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:52:34,172 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:52:34,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:52:34,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:52:34,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:52:34,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:52:34,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:52:34,221 WARN L253 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:52:34,221 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:52:34,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:52:34,233 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-09 15:52:34,234 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 129 states and 141 transitions. cyclomatic complexity: 16 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) [2024-11-09 15:52:34,251 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 129 states and 141 transitions. cyclomatic complexity: 16. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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 176 states and 193 transitions. Complement of second has 7 states. [2024-11-09 15:52:34,252 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 [2024-11-09 15:52:34,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) [2024-11-09 15:52:34,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2024-11-09 15:52:34,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 19 letters. Loop has 2 letters. [2024-11-09 15:52:34,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:52:34,253 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:52:34,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:52:34,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:52:34,276 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:52:34,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:52:34,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:52:34,305 WARN L253 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:52:34,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:52:34,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:52:34,316 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 [2024-11-09 15:52:34,317 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 129 states and 141 transitions. cyclomatic complexity: 16 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) [2024-11-09 15:52:34,335 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 129 states and 141 transitions. cyclomatic complexity: 16. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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 200 states and 221 transitions. Complement of second has 6 states. [2024-11-09 15:52:34,335 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 [2024-11-09 15:52:34,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) [2024-11-09 15:52:34,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2024-11-09 15:52:34,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 19 letters. Loop has 2 letters. [2024-11-09 15:52:34,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:52:34,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 21 letters. Loop has 2 letters. [2024-11-09 15:52:34,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:52:34,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 19 letters. Loop has 4 letters. [2024-11-09 15:52:34,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:52:34,337 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 200 states and 221 transitions. [2024-11-09 15:52:34,338 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2024-11-09 15:52:34,339 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 200 states to 112 states and 121 transitions. [2024-11-09 15:52:34,339 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-11-09 15:52:34,339 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2024-11-09 15:52:34,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 112 states and 121 transitions. [2024-11-09 15:52:34,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:52:34,340 INFO L218 hiAutomatonCegarLoop]: Abstraction has 112 states and 121 transitions. [2024-11-09 15:52:34,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states and 121 transitions. [2024-11-09 15:52:34,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2024-11-09 15:52:34,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 111 states have (on average 1.0810810810810811) internal successors, (120), 110 states have internal predecessors, (120), 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) [2024-11-09 15:52:34,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2024-11-09 15:52:34,344 INFO L240 hiAutomatonCegarLoop]: Abstraction has 111 states and 120 transitions. [2024-11-09 15:52:34,344 INFO L425 stractBuchiCegarLoop]: Abstraction has 111 states and 120 transitions. [2024-11-09 15:52:34,344 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-09 15:52:34,345 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states and 120 transitions. [2024-11-09 15:52:34,345 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2024-11-09 15:52:34,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:52:34,345 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:52:34,350 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [36, 36, 6, 6, 6, 2, 1, 1, 1, 1] [2024-11-09 15:52:34,350 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 1, 1, 1] [2024-11-09 15:52:34,350 INFO L745 eck$LassoCheckResult]: Stem: 3015#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 3016#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0; 3009#L21-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 3010#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 3119#L23-3 assume !!(main_~c~0#1 < 6); 3118#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3117#L23-3 assume !!(main_~c~0#1 < 6); 3115#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3113#L23-3 assume !!(main_~c~0#1 < 6); 3111#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3109#L23-3 assume !!(main_~c~0#1 < 6); 3107#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3105#L23-3 assume !!(main_~c~0#1 < 6); 3103#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3101#L23-3 assume !!(main_~c~0#1 < 6); 3098#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3097#L23-3 assume !(main_~c~0#1 < 6); 3023#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 3020#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 3019#L23-3 assume !!(main_~c~0#1 < 6); 3013#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3014#L23-3 assume !!(main_~c~0#1 < 6); 3116#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3114#L23-3 assume !!(main_~c~0#1 < 6); 3112#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3110#L23-3 assume !!(main_~c~0#1 < 6); 3108#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3106#L23-3 assume !!(main_~c~0#1 < 6); 3104#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3102#L23-3 assume !!(main_~c~0#1 < 6); 3100#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3099#L23-3 assume !(main_~c~0#1 < 6); 3096#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 3095#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 3094#L23-3 assume !!(main_~c~0#1 < 6); 3093#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3092#L23-3 assume !!(main_~c~0#1 < 6); 3091#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3090#L23-3 assume !!(main_~c~0#1 < 6); 3089#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3088#L23-3 assume !!(main_~c~0#1 < 6); 3087#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3086#L23-3 assume !!(main_~c~0#1 < 6); 3085#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3084#L23-3 assume !!(main_~c~0#1 < 6); 3083#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3082#L23-3 assume !(main_~c~0#1 < 6); 3081#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 3080#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 3079#L23-3 assume !!(main_~c~0#1 < 6); 3078#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3077#L23-3 assume !!(main_~c~0#1 < 6); 3076#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3075#L23-3 assume !!(main_~c~0#1 < 6); 3074#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3073#L23-3 assume !!(main_~c~0#1 < 6); 3072#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3071#L23-3 assume !!(main_~c~0#1 < 6); 3070#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3069#L23-3 assume !!(main_~c~0#1 < 6); 3068#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3067#L23-3 assume !(main_~c~0#1 < 6); 3066#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 3065#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 3064#L23-3 assume !!(main_~c~0#1 < 6); 3063#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3062#L23-3 assume !!(main_~c~0#1 < 6); 3061#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3060#L23-3 assume !!(main_~c~0#1 < 6); 3059#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3058#L23-3 assume !!(main_~c~0#1 < 6); 3057#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3056#L23-3 assume !!(main_~c~0#1 < 6); 3055#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3054#L23-3 assume !!(main_~c~0#1 < 6); 3053#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3052#L23-3 assume !(main_~c~0#1 < 6); 3051#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 3050#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 3027#L23-3 assume !!(main_~c~0#1 < 6); 3049#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3048#L23-3 assume !!(main_~c~0#1 < 6); 3047#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3046#L23-3 assume !!(main_~c~0#1 < 6); 3044#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3042#L23-3 assume !!(main_~c~0#1 < 6); 3040#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3038#L23-3 assume !!(main_~c~0#1 < 6); 3036#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3034#L23-3 assume !!(main_~c~0#1 < 6); 3031#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3030#L23-3 assume !(main_~c~0#1 < 6); 3028#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 3026#L22-3 assume !(main_~b~0#1 < 6); 3021#L21-2 main_#t~pre6#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre6#1; 3011#L21-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 3012#L22-3 [2024-11-09 15:52:34,351 INFO L747 eck$LassoCheckResult]: Loop: 3012#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 3017#L23-3 assume !!(main_~c~0#1 < 6); 3018#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3045#L23-3 assume !!(main_~c~0#1 < 6); 3043#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3041#L23-3 assume !!(main_~c~0#1 < 6); 3039#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3037#L23-3 assume !!(main_~c~0#1 < 6); 3035#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3033#L23-3 assume !!(main_~c~0#1 < 6); 3032#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3029#L23-3 assume !!(main_~c~0#1 < 6); 3025#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3024#L23-3 assume !(main_~c~0#1 < 6); 3022#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 3012#L22-3 [2024-11-09 15:52:34,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:52:34,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1672375441, now seen corresponding path program 2 times [2024-11-09 15:52:34,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:52:34,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853851591] [2024-11-09 15:52:34,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:52:34,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:52:34,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:34,365 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:52:34,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:34,384 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:52:34,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:52:34,385 INFO L85 PathProgramCache]: Analyzing trace with hash -706979195, now seen corresponding path program 2 times [2024-11-09 15:52:34,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:52:34,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402421629] [2024-11-09 15:52:34,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:52:34,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:52:34,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:34,389 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:52:34,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:34,391 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:52:34,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:52:34,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1669350057, now seen corresponding path program 3 times [2024-11-09 15:52:34,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:52:34,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241194943] [2024-11-09 15:52:34,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:52:34,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:52:34,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:34,407 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:52:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:52:34,422 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:52:34,494 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:52:34,494 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:52:34,495 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:52:34,495 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:52:34,495 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:52:34,495 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:34,495 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:52:34,495 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:52:34,495 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration10_Loop [2024-11-09 15:52:34,495 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:52:34,495 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:52:34,496 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:52:34,501 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:52:34,502 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:52:34,505 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:52:34,528 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:52:34,528 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:52:34,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:34,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:52:34,530 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:52:34,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-09 15:52:34,532 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:52:34,533 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:52:34,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-11-09 15:52:34,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:34,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:52:34,563 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:52:34,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-09 15:52:34,566 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:52:34,566 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:52:34,599 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:52:34,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-11-09 15:52:34,603 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:52:34,603 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:52:34,603 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:52:34,603 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:52:34,604 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:52:34,604 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:34,604 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:52:34,604 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:52:34,604 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration10_Loop [2024-11-09 15:52:34,604 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:52:34,604 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:52:34,604 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:52:34,609 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:52:34,611 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:52:34,613 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:52:34,637 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:52:34,638 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:52:34,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:34,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:52:34,640 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:52:34,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-11-09 15:52:34,642 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 [2024-11-09 15:52:34,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:52:34,652 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:52:34,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:52:34,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:52:34,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:52:34,653 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:52:34,653 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:52:34,655 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:52:34,657 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-09 15:52:34,657 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-09 15:52:34,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:52:34,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:52:34,659 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:52:34,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-11-09 15:52:34,661 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:52:34,661 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 15:52:34,661 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:52:34,661 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~b~0#1) = -2*ULTIMATE.start_main_~b~0#1 + 11 Supporting invariants [] [2024-11-09 15:52:34,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-11-09 15:52:34,672 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 15:52:34,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:52:34,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:52:34,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:52:34,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:52:34,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:52:34,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:52:34,827 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:52:34,880 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-09 15:52:34,882 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-09 15:52:34,883 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 111 states and 120 transitions. cyclomatic complexity: 11 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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) [2024-11-09 15:52:34,901 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 111 states and 120 transitions. cyclomatic complexity: 11. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 290 states and 314 transitions. Complement of second has 7 states. [2024-11-09 15:52:34,902 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 [2024-11-09 15:52:34,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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) [2024-11-09 15:52:34,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2024-11-09 15:52:34,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 96 letters. Loop has 15 letters. [2024-11-09 15:52:34,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:52:34,903 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:52:34,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:52:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:52:34,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:52:34,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:52:35,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:52:35,065 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:52:35,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:52:35,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2024-11-09 15:52:35,151 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-09 15:52:35,151 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-09 15:52:35,152 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 111 states and 120 transitions. cyclomatic complexity: 11 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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) [2024-11-09 15:52:35,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-11-09 15:52:35,167 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 111 states and 120 transitions. cyclomatic complexity: 11. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 290 states and 314 transitions. Complement of second has 7 states. [2024-11-09 15:52:35,168 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 [2024-11-09 15:52:35,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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) [2024-11-09 15:52:35,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2024-11-09 15:52:35,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 96 letters. Loop has 15 letters. [2024-11-09 15:52:35,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:52:35,169 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:52:35,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:52:35,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:52:35,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:52:35,213 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:52:35,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:52:35,322 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:52:35,322 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:52:35,377 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-09 15:52:35,377 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 [2024-11-09 15:52:35,377 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 111 states and 120 transitions. cyclomatic complexity: 11 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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) [2024-11-09 15:52:35,395 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 111 states and 120 transitions. cyclomatic complexity: 11. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 212 states and 230 transitions. Complement of second has 6 states. [2024-11-09 15:52:35,396 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 [2024-11-09 15:52:35,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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) [2024-11-09 15:52:35,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2024-11-09 15:52:35,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 96 letters. Loop has 15 letters. [2024-11-09 15:52:35,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:52:35,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 111 letters. Loop has 15 letters. [2024-11-09 15:52:35,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:52:35,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 96 letters. Loop has 30 letters. [2024-11-09 15:52:35,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:52:35,398 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 212 states and 230 transitions. [2024-11-09 15:52:35,399 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-09 15:52:35,399 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 212 states to 0 states and 0 transitions. [2024-11-09 15:52:35,399 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-09 15:52:35,399 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-09 15:52:35,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-09 15:52:35,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:52:35,399 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 15:52:35,399 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 15:52:35,400 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 15:52:35,400 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-09 15:52:35,400 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-09 15:52:35,400 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-09 15:52:35,400 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-09 15:52:35,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.11 03:52:35 BoogieIcfgContainer [2024-11-09 15:52:35,410 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-09 15:52:35,410 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 15:52:35,410 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 15:52:35,411 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 15:52:35,411 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:52:28" (3/4) ... [2024-11-09 15:52:35,413 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 15:52:35,414 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 15:52:35,414 INFO L158 Benchmark]: Toolchain (without parser) took 7104.88ms. Allocated memory was 138.4MB in the beginning and 186.6MB in the end (delta: 48.2MB). Free memory was 92.7MB in the beginning and 121.4MB in the end (delta: -28.8MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. [2024-11-09 15:52:35,415 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 100.7MB. Free memory is still 66.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:52:35,415 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.27ms. Allocated memory is still 138.4MB. Free memory was 92.7MB in the beginning and 80.6MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 15:52:35,415 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.32ms. Allocated memory is still 138.4MB. Free memory was 80.6MB in the beginning and 79.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:52:35,415 INFO L158 Benchmark]: Boogie Preprocessor took 36.60ms. Allocated memory is still 138.4MB. Free memory was 79.5MB in the beginning and 78.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 15:52:35,416 INFO L158 Benchmark]: RCFGBuilder took 344.80ms. Allocated memory is still 138.4MB. Free memory was 77.5MB in the beginning and 105.5MB in the end (delta: -28.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 15:52:35,416 INFO L158 Benchmark]: BuchiAutomizer took 6417.54ms. Allocated memory was 138.4MB in the beginning and 186.6MB in the end (delta: 48.2MB). Free memory was 105.5MB in the beginning and 121.4MB in the end (delta: -16.0MB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. [2024-11-09 15:52:35,418 INFO L158 Benchmark]: Witness Printer took 3.78ms. Allocated memory is still 186.6MB. Free memory is still 121.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:52:35,420 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 100.7MB. Free memory is still 66.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 265.27ms. Allocated memory is still 138.4MB. Free memory was 92.7MB in the beginning and 80.6MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.32ms. Allocated memory is still 138.4MB. Free memory was 80.6MB in the beginning and 79.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.60ms. Allocated memory is still 138.4MB. Free memory was 79.5MB in the beginning and 78.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 344.80ms. Allocated memory is still 138.4MB. Free memory was 77.5MB in the beginning and 105.5MB in the end (delta: -28.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 6417.54ms. Allocated memory was 138.4MB in the beginning and 186.6MB in the end (delta: 48.2MB). Free memory was 105.5MB in the beginning and 121.4MB in the end (delta: -16.0MB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. * Witness Printer took 3.78ms. Allocated memory is still 186.6MB. Free memory is still 121.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (5 trivial, 3 deterministic, 2 nondeterministic). One deterministic module has affine ranking function (((long long) -2 * a) + 11) and consists of 3 locations. One deterministic module has affine ranking function (((long long) -2 * b) + 11) and consists of 4 locations. One deterministic module has affine ranking function (((long long) -2 * c) + 11) and consists of 4 locations. One nondeterministic module has affine ranking function (((long long) -2 * c) + 11) and consists of 4 locations. One nondeterministic module has affine ranking function (((long long) -2 * b) + 11) and consists of 4 locations. 5 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.3s and 11 iterations. TraceHistogramMax:36. Analysis of lassos took 4.0s. Construction of modules took 0.1s. Büchi inclusion checks took 1.9s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 4. Automata minimization 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 230 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1599/1599 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 165 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 156 mSDsluCounter, 224 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 101 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 154 IncrementalHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 123 mSDtfsCounter, 154 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI5 SFLT5 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax100 hnf100 lsp83 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 18ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 3 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-09 15:52:35,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 15:52:35,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 15:52:35,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 15:52:36,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE