./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-simple/nested_2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-simple/nested_2.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 d28004f57c6988e792d07d7254dfd532aeffd19f38063d85c3bfa2c0f504914f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-15 00:43:25,989 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 00:43:26,045 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-15 00:43:26,051 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 00:43:26,054 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 00:43:26,082 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 00:43:26,083 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 00:43:26,083 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 00:43:26,084 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 00:43:26,084 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 00:43:26,087 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 00:43:26,087 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 00:43:26,088 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 00:43:26,089 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-15 00:43:26,092 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-15 00:43:26,092 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-15 00:43:26,093 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-15 00:43:26,093 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-15 00:43:26,093 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-15 00:43:26,093 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 00:43:26,093 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-15 00:43:26,097 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-15 00:43:26,098 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 00:43:26,098 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-15 00:43:26,098 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 00:43:26,099 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-15 00:43:26,099 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-15 00:43:26,099 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-15 00:43:26,099 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 00:43:26,100 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-15 00:43:26,100 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-15 00:43:26,100 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 00:43:26,100 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-15 00:43:26,101 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 00:43:26,101 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 00:43:26,101 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 00:43:26,101 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 00:43:26,102 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 00:43:26,102 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-15 00:43:26,102 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 -> d28004f57c6988e792d07d7254dfd532aeffd19f38063d85c3bfa2c0f504914f [2024-10-15 00:43:26,316 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 00:43:26,335 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 00:43:26,337 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 00:43:26,338 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 00:43:26,338 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 00:43:26,339 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-simple/nested_2.c [2024-10-15 00:43:27,840 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 00:43:27,991 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 00:43:27,992 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-simple/nested_2.c [2024-10-15 00:43:27,998 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06ea7000f/d0ee7a4606b8471dae9aa48db3996a25/FLAG046f873a1 [2024-10-15 00:43:28,405 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06ea7000f/d0ee7a4606b8471dae9aa48db3996a25 [2024-10-15 00:43:28,408 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 00:43:28,409 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 00:43:28,410 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 00:43:28,410 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 00:43:28,415 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 00:43:28,415 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:43:28" (1/1) ... [2024-10-15 00:43:28,416 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@682f0e2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:43:28, skipping insertion in model container [2024-10-15 00:43:28,416 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:43:28" (1/1) ... [2024-10-15 00:43:28,432 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 00:43:28,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 00:43:28,562 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 00:43:28,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 00:43:28,588 INFO L204 MainTranslator]: Completed translation [2024-10-15 00:43:28,589 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:43:28 WrapperNode [2024-10-15 00:43:28,589 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 00:43:28,590 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 00:43:28,590 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 00:43:28,590 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 00:43:28,595 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:43:28" (1/1) ... [2024-10-15 00:43:28,602 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:43:28" (1/1) ... [2024-10-15 00:43:28,616 INFO L138 Inliner]: procedures = 10, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 32 [2024-10-15 00:43:28,616 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 00:43:28,617 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 00:43:28,617 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 00:43:28,617 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 00:43:28,625 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:43:28" (1/1) ... [2024-10-15 00:43:28,625 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:43:28" (1/1) ... [2024-10-15 00:43:28,626 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:43:28" (1/1) ... [2024-10-15 00:43:28,634 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-10-15 00:43:28,635 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:43:28" (1/1) ... [2024-10-15 00:43:28,635 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:43:28" (1/1) ... [2024-10-15 00:43:28,637 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:43:28" (1/1) ... [2024-10-15 00:43:28,639 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:43:28" (1/1) ... [2024-10-15 00:43:28,639 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:43:28" (1/1) ... [2024-10-15 00:43:28,640 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:43:28" (1/1) ... [2024-10-15 00:43:28,641 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 00:43:28,642 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 00:43:28,642 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 00:43:28,642 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 00:43:28,643 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:43:28" (1/1) ... [2024-10-15 00:43:28,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:28,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:28,668 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-10-15 00:43:28,673 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-10-15 00:43:28,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-15 00:43:28,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 00:43:28,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 00:43:28,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-15 00:43:28,772 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 00:43:28,774 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 00:43:28,863 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-10-15 00:43:28,863 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 00:43:28,875 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 00:43:28,876 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-15 00:43:28,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:43:28 BoogieIcfgContainer [2024-10-15 00:43:28,877 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 00:43:28,878 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-15 00:43:28,878 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-15 00:43:28,881 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-15 00:43:28,882 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:43:28,882 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.10 12:43:28" (1/3) ... [2024-10-15 00:43:28,884 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@118eef99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 12:43:28, skipping insertion in model container [2024-10-15 00:43:28,885 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:43:28,885 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:43:28" (2/3) ... [2024-10-15 00:43:28,885 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@118eef99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 12:43:28, skipping insertion in model container [2024-10-15 00:43:28,885 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:43:28,885 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:43:28" (3/3) ... [2024-10-15 00:43:28,887 INFO L332 chiAutomizerObserver]: Analyzing ICFG nested_2.c [2024-10-15 00:43:29,033 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-15 00:43:29,033 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-15 00:43:29,033 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-15 00:43:29,034 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-15 00:43:29,034 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-15 00:43:29,034 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-15 00:43:29,034 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-15 00:43:29,034 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-15 00:43:29,038 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 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-10-15 00:43:29,052 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-15 00:43:29,053 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:43:29,053 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:43:29,057 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:43:29,057 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-15 00:43:29,058 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-15 00:43:29,058 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 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-10-15 00:43:29,059 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-15 00:43:29,059 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:43:29,060 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:43:29,060 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:43:29,060 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-15 00:43:29,066 INFO L745 eck$LassoCheckResult]: Stem: 8#$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); 11#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_~a~0#1, main_~b~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~a~0#1 := 0; 6#L20-3true [2024-10-15 00:43:29,067 INFO L747 eck$LassoCheckResult]: Loop: 6#L20-3true assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 3#L21-3true assume !(main_~b~0#1 < 6); 7#L20-2true main_#t~pre5#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre5#1; 6#L20-3true [2024-10-15 00:43:29,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:43:29,072 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-15 00:43:29,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:43:29,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090587356] [2024-10-15 00:43:29,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:43:29,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:43:29,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:29,169 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:43:29,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:29,188 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:43:29,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:43:29,191 INFO L85 PathProgramCache]: Analyzing trace with hash 39921, now seen corresponding path program 1 times [2024-10-15 00:43:29,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:43:29,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018552922] [2024-10-15 00:43:29,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:43:29,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:43:29,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:43:29,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:43:29,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:43:29,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018552922] [2024-10-15 00:43:29,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018552922] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:43:29,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:43:29,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-15 00:43:29,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758032096] [2024-10-15 00:43:29,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:43:29,248 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:43:29,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:43:29,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 00:43:29,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 00:43:29,275 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 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) 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-10-15 00:43:29,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:43:29,293 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2024-10-15 00:43:29,295 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2024-10-15 00:43:29,295 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-10-15 00:43:29,297 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 8 states and 9 transitions. [2024-10-15 00:43:29,298 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-10-15 00:43:29,298 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-10-15 00:43:29,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. [2024-10-15 00:43:29,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:43:29,299 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 9 transitions. [2024-10-15 00:43:29,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. [2024-10-15 00:43:29,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2024-10-15 00:43:29,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 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-10-15 00:43:29,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2024-10-15 00:43:29,320 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions. [2024-10-15 00:43:29,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 00:43:29,327 INFO L425 stractBuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2024-10-15 00:43:29,327 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-15 00:43:29,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2024-10-15 00:43:29,328 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-15 00:43:29,328 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:43:29,328 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:43:29,329 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:43:29,329 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-15 00:43:29,329 INFO L745 eck$LassoCheckResult]: Stem: 38#$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); 39#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_~a~0#1, main_~b~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~a~0#1 := 0; 36#L20-3 [2024-10-15 00:43:29,329 INFO L747 eck$LassoCheckResult]: Loop: 36#L20-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 34#L21-3 assume !!(main_~b~0#1 < 6); 35#L21-2 main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1; 40#L21-3 assume !(main_~b~0#1 < 6); 37#L20-2 main_#t~pre5#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre5#1; 36#L20-3 [2024-10-15 00:43:29,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:43:29,330 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-10-15 00:43:29,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:43:29,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888059139] [2024-10-15 00:43:29,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:43:29,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:43:29,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:29,344 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:43:29,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:29,359 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:43:29,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:43:29,359 INFO L85 PathProgramCache]: Analyzing trace with hash 38420339, now seen corresponding path program 1 times [2024-10-15 00:43:29,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:43:29,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597664889] [2024-10-15 00:43:29,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:43:29,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:43:29,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:43:29,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:43:29,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:43:29,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597664889] [2024-10-15 00:43:29,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597664889] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:43:29,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245252560] [2024-10-15 00:43:29,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:43:29,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:43:29,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:29,423 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-10-15 00:43:29,424 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-10-15 00:43:29,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:43:29,452 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-15 00:43:29,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:43:29,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:43:29,482 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:43:29,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:43:29,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245252560] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:43:29,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:43:29,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-10-15 00:43:29,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595531117] [2024-10-15 00:43:29,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:43:29,505 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:43:29,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:43:29,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-15 00:43:29,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-15 00:43:29,506 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:43:29,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:43:29,525 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2024-10-15 00:43:29,526 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2024-10-15 00:43:29,526 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2024-10-15 00:43:29,526 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 14 transitions. [2024-10-15 00:43:29,527 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-10-15 00:43:29,527 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-10-15 00:43:29,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2024-10-15 00:43:29,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:43:29,527 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 14 transitions. [2024-10-15 00:43:29,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2024-10-15 00:43:29,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-10-15 00:43:29,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 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-10-15 00:43:29,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2024-10-15 00:43:29,529 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 14 transitions. [2024-10-15 00:43:29,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 00:43:29,530 INFO L425 stractBuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2024-10-15 00:43:29,530 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-15 00:43:29,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2024-10-15 00:43:29,531 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2024-10-15 00:43:29,531 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:43:29,531 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:43:29,531 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:43:29,531 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 1, 1, 1] [2024-10-15 00:43:29,531 INFO L745 eck$LassoCheckResult]: Stem: 92#$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); 93#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_~a~0#1, main_~b~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~a~0#1 := 0; 89#L20-3 [2024-10-15 00:43:29,532 INFO L747 eck$LassoCheckResult]: Loop: 89#L20-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 90#L21-3 assume !!(main_~b~0#1 < 6); 94#L21-2 main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1; 87#L21-3 assume !!(main_~b~0#1 < 6); 88#L21-2 main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1; 99#L21-3 assume !!(main_~b~0#1 < 6); 98#L21-2 main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1; 97#L21-3 assume !!(main_~b~0#1 < 6); 96#L21-2 main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1; 95#L21-3 assume !(main_~b~0#1 < 6); 91#L20-2 main_#t~pre5#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre5#1; 89#L20-3 [2024-10-15 00:43:29,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:43:29,532 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-10-15 00:43:29,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:43:29,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185913432] [2024-10-15 00:43:29,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:43:29,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:43:29,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:29,538 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:43:29,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:29,541 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:43:29,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:43:29,542 INFO L85 PathProgramCache]: Analyzing trace with hash 718182137, now seen corresponding path program 2 times [2024-10-15 00:43:29,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:43:29,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045236368] [2024-10-15 00:43:29,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:43:29,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:43:29,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:43:29,610 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:43:29,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:43:29,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045236368] [2024-10-15 00:43:29,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045236368] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:43:29,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592247366] [2024-10-15 00:43:29,611 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 00:43:29,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:43:29,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:29,613 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-10-15 00:43:29,620 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-10-15 00:43:29,649 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 00:43:29,649 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:43:29,650 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-15 00:43:29,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:43:29,671 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:43:29,671 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:43:29,715 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:43:29,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592247366] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:43:29,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:43:29,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2024-10-15 00:43:29,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800607682] [2024-10-15 00:43:29,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:43:29,717 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:43:29,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:43:29,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-15 00:43:29,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-10-15 00:43:29,718 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. cyclomatic complexity: 2 Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 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-10-15 00:43:29,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:43:29,738 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2024-10-15 00:43:29,738 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 18 transitions. [2024-10-15 00:43:29,739 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2024-10-15 00:43:29,739 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 18 transitions. [2024-10-15 00:43:29,740 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-10-15 00:43:29,740 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-10-15 00:43:29,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 18 transitions. [2024-10-15 00:43:29,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:43:29,740 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 18 transitions. [2024-10-15 00:43:29,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 18 transitions. [2024-10-15 00:43:29,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-10-15 00:43:29,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 16 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-10-15 00:43:29,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2024-10-15 00:43:29,742 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 18 transitions. [2024-10-15 00:43:29,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-15 00:43:29,743 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2024-10-15 00:43:29,743 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-15 00:43:29,743 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2024-10-15 00:43:29,744 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2024-10-15 00:43:29,744 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:43:29,744 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:43:29,744 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:43:29,744 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 1, 1, 1] [2024-10-15 00:43:29,744 INFO L745 eck$LassoCheckResult]: Stem: 193#$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); 194#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_~a~0#1, main_~b~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~a~0#1 := 0; 190#L20-3 [2024-10-15 00:43:29,744 INFO L747 eck$LassoCheckResult]: Loop: 190#L20-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 191#L21-3 assume !!(main_~b~0#1 < 6); 195#L21-2 main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1; 188#L21-3 assume !!(main_~b~0#1 < 6); 189#L21-2 main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1; 204#L21-3 assume !!(main_~b~0#1 < 6); 203#L21-2 main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1; 202#L21-3 assume !!(main_~b~0#1 < 6); 201#L21-2 main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1; 200#L21-3 assume !!(main_~b~0#1 < 6); 199#L21-2 main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1; 198#L21-3 assume !!(main_~b~0#1 < 6); 197#L21-2 main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1; 196#L21-3 assume !(main_~b~0#1 < 6); 192#L20-2 main_#t~pre5#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre5#1; 190#L20-3 [2024-10-15 00:43:29,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:43:29,745 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-10-15 00:43:29,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:43:29,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46328861] [2024-10-15 00:43:29,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:43:29,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:43:29,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:29,750 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:43:29,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:29,753 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:43:29,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:43:29,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1719812477, now seen corresponding path program 3 times [2024-10-15 00:43:29,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:43:29,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624507668] [2024-10-15 00:43:29,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:43:29,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:43:29,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:29,760 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:43:29,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:29,767 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:43:29,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:43:29,767 INFO L85 PathProgramCache]: Analyzing trace with hash 212205947, now seen corresponding path program 1 times [2024-10-15 00:43:29,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:43:29,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240896917] [2024-10-15 00:43:29,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:43:29,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:43:29,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:29,776 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:43:29,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:29,784 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:43:29,865 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:43:29,865 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:43:29,865 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:43:29,865 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:43:29,866 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-15 00:43:29,866 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:29,866 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:43:29,867 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:43:29,868 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_2.c_Iteration4_Loop [2024-10-15 00:43:29,868 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:43:29,869 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:43:29,882 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:29,892 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:29,896 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:29,899 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:29,934 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:43:29,935 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-15 00:43:29,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:29,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:29,942 INFO L229 MonitoredProcess]: Starting monitored process 4 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-10-15 00:43:29,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-15 00:43:29,947 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:43:29,947 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:43:29,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-10-15 00:43:29,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:29,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:29,973 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-10-15 00:43:29,974 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-10-15 00:43:29,975 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-15 00:43:29,975 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:43:30,005 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-15 00:43:30,014 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-10-15 00:43:30,017 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:43:30,017 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:43:30,018 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:43:30,018 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:43:30,018 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:43:30,018 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:30,018 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:43:30,018 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:43:30,018 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_2.c_Iteration4_Loop [2024-10-15 00:43:30,019 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:43:30,019 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:43:30,020 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:30,023 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:30,031 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:30,034 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:30,070 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:43:30,074 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:43:30,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:30,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:30,080 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-10-15 00:43:30,081 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-10-15 00:43:30,082 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-10-15 00:43:30,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:43:30,093 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:43:30,094 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:43:30,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:43:30,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:43:30,095 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:43:30,095 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:43:30,097 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:43:30,109 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-10-15 00:43:30,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:30,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:30,113 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-10-15 00:43:30,114 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-10-15 00:43:30,115 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-10-15 00:43:30,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:43:30,124 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:43:30,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:43:30,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:43:30,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:43:30,126 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:43:30,126 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:43:30,128 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:43:30,132 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-15 00:43:30,133 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-15 00:43:30,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:30,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:30,135 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-10-15 00:43:30,137 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-10-15 00:43:30,138 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:43:30,138 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-15 00:43:30,138 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:43:30,139 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-10-15 00:43:30,149 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-10-15 00:43:30,152 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-15 00:43:30,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:43:30,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:43:30,186 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:43:30,186 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:43:30,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:43:30,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:43:30,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:43:30,282 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-15 00:43:30,285 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-10-15 00:43:30,286 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 18 transitions. cyclomatic complexity: 2 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:43:30,312 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 18 transitions. cyclomatic complexity: 2. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 32 states and 35 transitions. Complement of second has 4 states. [2024-10-15 00:43:30,313 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-10-15 00:43:30,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:43:30,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2024-10-15 00:43:30,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 2 letters. Loop has 15 letters. [2024-10-15 00:43:30,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:43:30,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 17 letters. Loop has 15 letters. [2024-10-15 00:43:30,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:43:30,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 2 letters. Loop has 30 letters. [2024-10-15 00:43:30,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:43:30,318 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 35 transitions. [2024-10-15 00:43:30,319 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:43:30,319 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 31 states and 34 transitions. [2024-10-15 00:43:30,319 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2024-10-15 00:43:30,319 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2024-10-15 00:43:30,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 34 transitions. [2024-10-15 00:43:30,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:43:30,320 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 34 transitions. [2024-10-15 00:43:30,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 34 transitions. [2024-10-15 00:43:30,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 20. [2024-10-15 00:43:30,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 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-10-15 00:43:30,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2024-10-15 00:43:30,321 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 23 transitions. [2024-10-15 00:43:30,321 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2024-10-15 00:43:30,321 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-15 00:43:30,321 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2024-10-15 00:43:30,322 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:43:30,322 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:43:30,322 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:43:30,322 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-15 00:43:30,322 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:43:30,322 INFO L745 eck$LassoCheckResult]: Stem: 314#$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); 315#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_~a~0#1, main_~b~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~a~0#1 := 0; 311#L20-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 307#L21-3 [2024-10-15 00:43:30,322 INFO L747 eck$LassoCheckResult]: Loop: 307#L21-3 assume !!(main_~b~0#1 < 6); 308#L21-2 main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1; 307#L21-3 [2024-10-15 00:43:30,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:43:30,323 INFO L85 PathProgramCache]: Analyzing trace with hash 29863, now seen corresponding path program 1 times [2024-10-15 00:43:30,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:43:30,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040500084] [2024-10-15 00:43:30,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:43:30,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:43:30,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:30,328 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:43:30,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:30,334 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:43:30,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:43:30,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1539, now seen corresponding path program 1 times [2024-10-15 00:43:30,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:43:30,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645981867] [2024-10-15 00:43:30,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:43:30,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:43:30,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:30,340 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:43:30,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:30,341 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:43:30,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:43:30,342 INFO L85 PathProgramCache]: Analyzing trace with hash 28698921, now seen corresponding path program 1 times [2024-10-15 00:43:30,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:43:30,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038338288] [2024-10-15 00:43:30,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:43:30,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:43:30,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:30,347 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:43:30,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:30,351 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:43:30,362 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:43:30,362 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:43:30,362 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:43:30,362 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:43:30,362 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-15 00:43:30,362 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:30,362 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:43:30,362 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:43:30,362 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_2.c_Iteration5_Loop [2024-10-15 00:43:30,362 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:43:30,362 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:43:30,363 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:30,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:30,383 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:43:30,383 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-15 00:43:30,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:30,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:30,387 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-10-15 00:43:30,390 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-10-15 00:43:30,391 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:43:30,391 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:43:30,415 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-10-15 00:43:30,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:30,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:30,417 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-10-15 00:43:30,421 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-10-15 00:43:30,421 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-15 00:43:30,422 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:43:30,449 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-15 00:43:30,453 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-10-15 00:43:30,453 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:43:30,454 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:43:30,454 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:43:30,454 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:43:30,454 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:43:30,454 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:30,454 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:43:30,454 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:43:30,455 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_2.c_Iteration5_Loop [2024-10-15 00:43:30,455 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:43:30,455 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:43:30,457 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:30,464 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:30,481 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:43:30,481 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:43:30,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:30,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:30,483 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-10-15 00:43:30,505 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-10-15 00:43:30,513 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-10-15 00:43:30,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-10-15 00:43:30,524 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:43:30,524 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:43:30,524 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:43:30,524 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:43:30,524 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:43:30,525 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:43:30,525 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:43:30,526 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:43:30,537 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-10-15 00:43:30,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:30,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:30,540 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-10-15 00:43:30,542 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-10-15 00:43:30,543 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-10-15 00:43:30,554 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:43:30,554 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:43:30,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:43:30,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:43:30,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:43:30,555 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:43:30,555 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:43:30,557 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:43:30,559 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-15 00:43:30,559 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-15 00:43:30,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:30,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:30,564 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-10-15 00:43:30,565 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-10-15 00:43:30,566 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:43:30,566 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-15 00:43:30,566 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:43:30,566 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-10-15 00:43:30,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-10-15 00:43:30,578 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-15 00:43:30,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:43:30,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:43:30,619 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:43:30,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:43:30,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:43:30,629 WARN L253 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:43:30,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:43:30,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:43:30,642 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-10-15 00:43:30,642 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 23 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:43:30,661 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 23 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 47 states and 54 transitions. Complement of second has 7 states. [2024-10-15 00:43:30,662 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-10-15 00:43:30,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:43:30,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2024-10-15 00:43:30,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 3 letters. Loop has 2 letters. [2024-10-15 00:43:30,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:43:30,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 5 letters. Loop has 2 letters. [2024-10-15 00:43:30,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:43:30,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 3 letters. Loop has 4 letters. [2024-10-15 00:43:30,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:43:30,664 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 54 transitions. [2024-10-15 00:43:30,666 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:43:30,668 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 35 states and 39 transitions. [2024-10-15 00:43:30,669 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-10-15 00:43:30,669 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2024-10-15 00:43:30,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 39 transitions. [2024-10-15 00:43:30,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:43:30,669 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 39 transitions. [2024-10-15 00:43:30,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 39 transitions. [2024-10-15 00:43:30,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 20. [2024-10-15 00:43:30,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.1) internal successors, (22), 19 states have internal predecessors, (22), 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-10-15 00:43:30,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2024-10-15 00:43:30,674 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 22 transitions. [2024-10-15 00:43:30,674 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2024-10-15 00:43:30,674 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-15 00:43:30,674 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. [2024-10-15 00:43:30,675 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:43:30,675 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:43:30,675 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:43:30,675 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 2, 1, 1, 1, 1] [2024-10-15 00:43:30,675 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:43:30,676 INFO L745 eck$LassoCheckResult]: Stem: 420#$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); 421#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_~a~0#1, main_~b~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~a~0#1 := 0; 418#L20-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 419#L21-3 assume !!(main_~b~0#1 < 6); 422#L21-2 main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1; 414#L21-3 assume !!(main_~b~0#1 < 6); 415#L21-2 main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1; 431#L21-3 assume !!(main_~b~0#1 < 6); 430#L21-2 main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1; 429#L21-3 assume !!(main_~b~0#1 < 6); 428#L21-2 main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1; 427#L21-3 assume !!(main_~b~0#1 < 6); 426#L21-2 main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1; 425#L21-3 assume !!(main_~b~0#1 < 6); 424#L21-2 main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1; 423#L21-3 assume !(main_~b~0#1 < 6); 416#L20-2 main_#t~pre5#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre5#1; 417#L20-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 412#L21-3 [2024-10-15 00:43:30,676 INFO L747 eck$LassoCheckResult]: Loop: 412#L21-3 assume !!(main_~b~0#1 < 6); 413#L21-2 main_#t~pre4#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre4#1; 412#L21-3 [2024-10-15 00:43:30,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:43:30,676 INFO L85 PathProgramCache]: Analyzing trace with hash -2011550225, now seen corresponding path program 2 times [2024-10-15 00:43:30,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:43:30,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821030064] [2024-10-15 00:43:30,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:43:30,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:43:30,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:30,689 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:43:30,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:30,704 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:43:30,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:43:30,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1539, now seen corresponding path program 2 times [2024-10-15 00:43:30,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:43:30,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112521768] [2024-10-15 00:43:30,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:43:30,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:43:30,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:30,710 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:43:30,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:30,711 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:43:30,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:43:30,712 INFO L85 PathProgramCache]: Analyzing trace with hash -364482447, now seen corresponding path program 3 times [2024-10-15 00:43:30,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:43:30,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504604239] [2024-10-15 00:43:30,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:43:30,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:43:30,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:30,723 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:43:30,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:43:30,730 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:43:30,745 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:43:30,745 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:43:30,745 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:43:30,745 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:43:30,745 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-15 00:43:30,745 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:30,745 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:43:30,745 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:43:30,745 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_2.c_Iteration6_Loop [2024-10-15 00:43:30,745 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:43:30,745 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:43:30,746 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:30,750 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:30,771 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:43:30,772 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-15 00:43:30,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:30,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:30,776 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-10-15 00:43:30,780 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-10-15 00:43:30,781 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:43:30,783 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:43:30,806 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-10-15 00:43:30,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:30,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:30,808 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-10-15 00:43:30,809 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-10-15 00:43:30,810 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-15 00:43:30,810 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:43:30,838 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-15 00:43:30,848 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-10-15 00:43:30,849 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:43:30,849 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:43:30,849 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:43:30,849 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:43:30,849 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:43:30,849 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:30,849 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:43:30,849 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:43:30,849 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_2.c_Iteration6_Loop [2024-10-15 00:43:30,849 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:43:30,849 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:43:30,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:30,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:43:30,873 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:43:30,873 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:43:30,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:30,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:30,875 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-10-15 00:43:30,876 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-10-15 00:43:30,877 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-10-15 00:43:30,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:43:30,888 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:43:30,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:43:30,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:43:30,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:43:30,889 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:43:30,889 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:43:30,890 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:43:30,893 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-15 00:43:30,893 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-15 00:43:30,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:30,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:30,895 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-10-15 00:43:30,898 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-10-15 00:43:30,898 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:43:30,898 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-15 00:43:30,898 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:43:30,899 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-10-15 00:43:30,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-10-15 00:43:30,910 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-15 00:43:30,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:43:30,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:43:30,947 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:43:30,948 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:43:30,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:43:30,983 WARN L253 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:43:30,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:43:30,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:43:30,997 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-10-15 00:43:30,997 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4 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-10-15 00:43:31,012 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4. 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 43 states and 48 transitions. Complement of second has 7 states. [2024-10-15 00:43:31,014 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-10-15 00:43:31,014 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-10-15 00:43:31,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2024-10-15 00:43:31,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 18 letters. Loop has 2 letters. [2024-10-15 00:43:31,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:43:31,015 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:43:31,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:43:31,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:43:31,038 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:43:31,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:43:31,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:43:31,077 WARN L253 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:43:31,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:43:31,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:43:31,087 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-10-15 00:43:31,087 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4 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-10-15 00:43:31,105 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4. 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 43 states and 48 transitions. Complement of second has 7 states. [2024-10-15 00:43:31,105 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-10-15 00:43:31,106 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-10-15 00:43:31,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2024-10-15 00:43:31,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 18 letters. Loop has 2 letters. [2024-10-15 00:43:31,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:43:31,106 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:43:31,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:43:31,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:43:31,122 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:43:31,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:43:31,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:43:31,145 WARN L253 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:43:31,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:43:31,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:43:31,154 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-10-15 00:43:31,154 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4 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-10-15 00:43:31,180 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4. 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 30 states and 34 transitions. Complement of second has 6 states. [2024-10-15 00:43:31,181 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-10-15 00:43:31,181 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-10-15 00:43:31,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2024-10-15 00:43:31,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 18 letters. Loop has 2 letters. [2024-10-15 00:43:31,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:43:31,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 20 letters. Loop has 2 letters. [2024-10-15 00:43:31,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:43:31,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 18 letters. Loop has 4 letters. [2024-10-15 00:43:31,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:43:31,182 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 34 transitions. [2024-10-15 00:43:31,183 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-15 00:43:31,183 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 0 states and 0 transitions. [2024-10-15 00:43:31,183 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-15 00:43:31,183 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-15 00:43:31,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-15 00:43:31,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:43:31,183 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 00:43:31,183 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 00:43:31,183 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 00:43:31,183 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-15 00:43:31,183 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-15 00:43:31,183 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-15 00:43:31,183 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-15 00:43:31,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.10 12:43:31 BoogieIcfgContainer [2024-10-15 00:43:31,189 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-15 00:43:31,190 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-15 00:43:31,190 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-15 00:43:31,190 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-15 00:43:31,190 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:43:28" (3/4) ... [2024-10-15 00:43:31,192 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-15 00:43:31,192 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-15 00:43:31,193 INFO L158 Benchmark]: Toolchain (without parser) took 2783.30ms. Allocated memory is still 184.5MB. Free memory was 112.2MB in the beginning and 102.9MB in the end (delta: 9.2MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. [2024-10-15 00:43:31,193 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 184.5MB. Free memory is still 142.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 00:43:31,193 INFO L158 Benchmark]: CACSL2BoogieTranslator took 178.80ms. Allocated memory is still 184.5MB. Free memory was 111.9MB in the beginning and 101.0MB in the end (delta: 10.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-15 00:43:31,193 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.64ms. Allocated memory is still 184.5MB. Free memory was 101.0MB in the beginning and 99.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 00:43:31,194 INFO L158 Benchmark]: Boogie Preprocessor took 24.29ms. Allocated memory is still 184.5MB. Free memory was 99.6MB in the beginning and 98.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 00:43:31,194 INFO L158 Benchmark]: RCFGBuilder took 235.23ms. Allocated memory is still 184.5MB. Free memory was 98.0MB in the beginning and 88.2MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-15 00:43:31,194 INFO L158 Benchmark]: BuchiAutomizer took 2311.58ms. Allocated memory is still 184.5MB. Free memory was 88.2MB in the beginning and 104.0MB in the end (delta: -15.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 00:43:31,194 INFO L158 Benchmark]: Witness Printer took 2.43ms. Allocated memory is still 184.5MB. Free memory was 104.0MB in the beginning and 102.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 00:43:31,196 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.14ms. Allocated memory is still 184.5MB. Free memory is still 142.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 178.80ms. Allocated memory is still 184.5MB. Free memory was 111.9MB in the beginning and 101.0MB in the end (delta: 10.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.64ms. Allocated memory is still 184.5MB. Free memory was 101.0MB in the beginning and 99.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.29ms. Allocated memory is still 184.5MB. Free memory was 99.6MB in the beginning and 98.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 235.23ms. Allocated memory is still 184.5MB. Free memory was 98.0MB in the beginning and 88.2MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 2311.58ms. Allocated memory is still 184.5MB. Free memory was 88.2MB in the beginning and 104.0MB in the end (delta: -15.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.43ms. Allocated memory is still 184.5MB. Free memory was 104.0MB in the beginning and 102.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 6 terminating modules (3 trivial, 2 deterministic, 1 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 nondeterministic module has affine ranking function (((long long) -2 * b) + 11) and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.2s and 7 iterations. TraceHistogramMax:6. Analysis of lassos took 1.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 27 StatesRemovedByMinimization, 3 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 [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 36/36 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 45 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 40 mSDsluCounter, 70 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 68 IncrementalHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 49 mSDtfsCounter, 68 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital11 mio100 ax100 hnf100 lsp92 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-10-15 00:43:31,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-10-15 00:43:31,415 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-10-15 00:43:31,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-15 00:43:31,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-15 00:43:32,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE