./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-invgen/nested6.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loop-invgen/nested6.i -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 327b0d5e70f014fe291a4771fe2bbb17cb1148e77fe8f6a261d10a47df8adacc --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 16:04:44,021 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 16:04:44,072 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-04 16:04:44,075 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 16:04:44,075 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 16:04:44,075 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 16:04:44,096 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 16:04:44,097 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 16:04:44,097 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 16:04:44,097 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 16:04:44,097 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 16:04:44,097 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 16:04:44,097 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 16:04:44,097 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 16:04:44,097 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 16:04:44,097 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 16:04:44,097 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 16:04:44,097 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 16:04:44,098 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 16:04:44,098 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 16:04:44,098 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 16:04:44,098 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 16:04:44,098 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 16:04:44,098 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 16:04:44,098 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 16:04:44,098 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 16:04:44,098 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 16:04:44,098 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 16:04:44,098 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 16:04:44,098 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 16:04:44,098 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 16:04:44,098 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 16:04:44,098 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 16:04:44,098 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 16:04:44,098 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 16:04:44,098 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 16:04:44,098 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 16:04:44,098 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 16:04:44,099 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 16:04:44,099 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 16:04:44,099 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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 -> 327b0d5e70f014fe291a4771fe2bbb17cb1148e77fe8f6a261d10a47df8adacc [2025-03-04 16:04:44,288 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 16:04:44,294 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 16:04:44,296 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 16:04:44,296 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 16:04:44,297 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 16:04:44,297 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/nested6.i [2025-03-04 16:04:45,381 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4702b5a50/e405983ff1be444bb263a28f13453253/FLAG043cfdc99 [2025-03-04 16:04:45,570 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 16:04:45,571 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/nested6.i [2025-03-04 16:04:45,578 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4702b5a50/e405983ff1be444bb263a28f13453253/FLAG043cfdc99 [2025-03-04 16:04:45,589 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4702b5a50/e405983ff1be444bb263a28f13453253 [2025-03-04 16:04:45,590 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 16:04:45,592 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 16:04:45,593 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 16:04:45,593 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 16:04:45,596 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 16:04:45,596 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:04:45" (1/1) ... [2025-03-04 16:04:45,597 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e94045c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:04:45, skipping insertion in model container [2025-03-04 16:04:45,597 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:04:45" (1/1) ... [2025-03-04 16:04:45,608 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 16:04:45,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 16:04:45,714 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 16:04:45,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 16:04:45,734 INFO L204 MainTranslator]: Completed translation [2025-03-04 16:04:45,734 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:04:45 WrapperNode [2025-03-04 16:04:45,735 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 16:04:45,735 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 16:04:45,735 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 16:04:45,735 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 16:04:45,740 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:04:45" (1/1) ... [2025-03-04 16:04:45,745 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:04:45" (1/1) ... [2025-03-04 16:04:45,756 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 6, calls inlined = 8, statements flattened = 72 [2025-03-04 16:04:45,758 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 16:04:45,758 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 16:04:45,758 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 16:04:45,758 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 16:04:45,763 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:04:45" (1/1) ... [2025-03-04 16:04:45,763 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:04:45" (1/1) ... [2025-03-04 16:04:45,764 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:04:45" (1/1) ... [2025-03-04 16:04:45,772 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]. [2025-03-04 16:04:45,772 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:04:45" (1/1) ... [2025-03-04 16:04:45,772 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:04:45" (1/1) ... [2025-03-04 16:04:45,776 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:04:45" (1/1) ... [2025-03-04 16:04:45,778 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:04:45" (1/1) ... [2025-03-04 16:04:45,778 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:04:45" (1/1) ... [2025-03-04 16:04:45,782 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:04:45" (1/1) ... [2025-03-04 16:04:45,783 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 16:04:45,784 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 16:04:45,785 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 16:04:45,785 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 16:04:45,785 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:04:45" (1/1) ... [2025-03-04 16:04:45,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:45,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:45,811 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) [2025-03-04 16:04:45,814 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 [2025-03-04 16:04:45,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 16:04:45,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 16:04:45,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 16:04:45,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 16:04:45,875 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 16:04:45,876 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 16:04:45,999 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-03-04 16:04:46,000 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 16:04:46,007 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 16:04:46,008 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 16:04:46,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:04:46 BoogieIcfgContainer [2025-03-04 16:04:46,008 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 16:04:46,009 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 16:04:46,009 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 16:04:46,013 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 16:04:46,013 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:04:46,013 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 04:04:45" (1/3) ... [2025-03-04 16:04:46,014 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1407977a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 04:04:46, skipping insertion in model container [2025-03-04 16:04:46,014 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:04:46,015 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:04:45" (2/3) ... [2025-03-04 16:04:46,015 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1407977a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 04:04:46, skipping insertion in model container [2025-03-04 16:04:46,015 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:04:46,015 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:04:46" (3/3) ... [2025-03-04 16:04:46,016 INFO L363 chiAutomizerObserver]: Analyzing ICFG nested6.i [2025-03-04 16:04:46,053 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 16:04:46,054 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 16:04:46,054 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 16:04:46,054 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 16:04:46,054 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 16:04:46,054 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 16:04:46,054 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 16:04:46,054 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 16:04:46,057 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 28 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:04:46,065 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2025-03-04 16:04:46,066 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:04:46,066 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:04:46,068 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-04 16:04:46,069 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 16:04:46,069 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 16:04:46,069 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 28 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:04:46,071 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2025-03-04 16:04:46,071 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:04:46,071 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:04:46,071 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-04 16:04:46,072 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 16:04:46,076 INFO L752 eck$LassoCheckResult]: Stem: "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(9, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_#t~nondet1#1;main_~k~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~n~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !!(main_~n~0#1 < 1000000);" "assume main_~k~0#1 == main_~n~0#1;main_~i~0#1 := 0;" [2025-03-04 16:04:46,076 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~n~0#1;main_~j~0#1 := 2 * main_~i~0#1;" "assume !(main_~j~0#1 < main_~n~0#1);main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" [2025-03-04 16:04:46,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:04:46,079 INFO L85 PathProgramCache]: Analyzing trace with hash 2307773, now seen corresponding path program 1 times [2025-03-04 16:04:46,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:04:46,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309800632] [2025-03-04 16:04:46,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:04:46,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:04:46,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 16:04:46,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:04:46,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:46,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:46,134 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:04:46,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 16:04:46,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:04:46,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:46,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:46,152 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:04:46,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:04:46,154 INFO L85 PathProgramCache]: Analyzing trace with hash 2018, now seen corresponding path program 1 times [2025-03-04 16:04:46,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:04:46,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393936727] [2025-03-04 16:04:46,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:04:46,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:04:46,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:04:46,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:04:46,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:46,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:46,163 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:04:46,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:04:46,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:04:46,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:46,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:46,168 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:04:46,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:04:46,170 INFO L85 PathProgramCache]: Analyzing trace with hash -2077196386, now seen corresponding path program 1 times [2025-03-04 16:04:46,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:04:46,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096032196] [2025-03-04 16:04:46,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:04:46,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:04:46,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 16:04:46,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 16:04:46,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:46,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:04:46,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:04:46,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:04:46,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096032196] [2025-03-04 16:04:46,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096032196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:04:46,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:04:46,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 16:04:46,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246104026] [2025-03-04 16:04:46,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:04:46,351 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:04:46,351 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:04:46,351 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:04:46,351 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:04:46,351 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 16:04:46,351 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:46,351 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:04:46,351 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:04:46,352 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested6.i_Iteration1_Loop [2025-03-04 16:04:46,352 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:04:46,352 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:04:46,361 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:46,372 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:46,374 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:46,409 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:04:46,409 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 16:04:46,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:46,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:46,414 INFO L229 MonitoredProcess]: Starting monitored process 2 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) [2025-03-04 16:04:46,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-04 16:04:46,417 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:04:46,417 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:04:46,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-03-04 16:04:46,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:46,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:46,438 INFO L229 MonitoredProcess]: Starting monitored process 3 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) [2025-03-04 16:04:46,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-04 16:04:46,439 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 16:04:46,439 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:04:46,496 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 16:04:46,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-03-04 16:04:46,500 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:04:46,500 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:04:46,500 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:04:46,500 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:04:46,500 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 16:04:46,500 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:46,500 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:04:46,500 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:04:46,500 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested6.i_Iteration1_Loop [2025-03-04 16:04:46,500 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:04:46,500 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:04:46,501 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:46,508 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:46,510 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:46,532 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:04:46,535 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 16:04:46,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:46,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:46,538 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) [2025-03-04 16:04:46,539 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 [2025-03-04 16:04:46,540 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:04:46,551 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:04:46,551 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:04:46,552 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:04:46,552 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:04:46,552 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:04:46,555 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:04:46,555 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:04:46,557 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 16:04:46,561 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 16:04:46,564 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 16:04:46,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:46,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:46,566 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) [2025-03-04 16:04:46,567 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 [2025-03-04 16:04:46,568 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 16:04:46,568 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 16:04:46,568 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 16:04:46,569 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1, ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~n~0#1 - 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2025-03-04 16:04:46,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-03-04 16:04:46,577 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 16:04:46,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:04:46,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 16:04:46,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:04:46,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:46,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:04:46,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 16:04:46,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:04:46,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:04:46,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:04:46,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:46,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:04:46,627 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 16:04:46,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:04:46,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:04:46,657 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 [2025-03-04 16:04:46,659 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 28 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:04:46,709 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 28 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 71 states and 95 transitions. Complement of second has 6 states. [2025-03-04 16:04:46,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-04 16:04:46,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:04:46,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2025-03-04 16:04:46,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 68 transitions. Stem has 4 letters. Loop has 2 letters. [2025-03-04 16:04:46,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:04:46,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 68 transitions. Stem has 6 letters. Loop has 2 letters. [2025-03-04 16:04:46,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:04:46,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 68 transitions. Stem has 4 letters. Loop has 4 letters. [2025-03-04 16:04:46,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:04:46,719 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 95 transitions. [2025-03-04 16:04:46,721 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2025-03-04 16:04:46,723 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 27 states and 34 transitions. [2025-03-04 16:04:46,724 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2025-03-04 16:04:46,724 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2025-03-04 16:04:46,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 34 transitions. [2025-03-04 16:04:46,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:04:46,724 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 34 transitions. [2025-03-04 16:04:46,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 34 transitions. [2025-03-04 16:04:46,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2025-03-04 16:04:46,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:04:46,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2025-03-04 16:04:46,739 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 33 transitions. [2025-03-04 16:04:46,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:04:46,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 16:04:46,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 16:04:46,741 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:04:46,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:04:46,761 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2025-03-04 16:04:46,762 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 60 transitions. [2025-03-04 16:04:46,762 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2025-03-04 16:04:46,763 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 48 states and 60 transitions. [2025-03-04 16:04:46,763 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2025-03-04 16:04:46,763 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2025-03-04 16:04:46,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 60 transitions. [2025-03-04 16:04:46,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:04:46,763 INFO L218 hiAutomatonCegarLoop]: Abstraction has 48 states and 60 transitions. [2025-03-04 16:04:46,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 60 transitions. [2025-03-04 16:04:46,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 27. [2025-03-04 16:04:46,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 26 states have internal predecessors, (34), 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) [2025-03-04 16:04:46,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2025-03-04 16:04:46,768 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 34 transitions. [2025-03-04 16:04:46,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 16:04:46,769 INFO L432 stractBuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2025-03-04 16:04:46,770 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 16:04:46,770 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. [2025-03-04 16:04:46,771 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2025-03-04 16:04:46,771 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:04:46,771 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:04:46,771 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-04 16:04:46,774 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-04 16:04:46,774 INFO L752 eck$LassoCheckResult]: Stem: "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(9, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_#t~nondet1#1;main_~k~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~n~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !!(main_~n~0#1 < 1000000);" "assume main_~k~0#1 == main_~n~0#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~n~0#1;main_~j~0#1 := 2 * main_~i~0#1;" [2025-03-04 16:04:46,774 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~j~0#1 < main_~n~0#1;havoc main_#t~nondet3#1;" "assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_~j~0#1;" "assume !(main_~k~0#1 < main_~n~0#1);" "main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" [2025-03-04 16:04:46,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:04:46,774 INFO L85 PathProgramCache]: Analyzing trace with hash 71540997, now seen corresponding path program 1 times [2025-03-04 16:04:46,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:04:46,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236586010] [2025-03-04 16:04:46,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:04:46,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:04:46,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:04:46,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:04:46,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:46,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:46,780 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:04:46,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:04:46,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:04:46,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:46,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:46,784 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:04:46,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:04:46,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1921477, now seen corresponding path program 1 times [2025-03-04 16:04:46,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:04:46,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572054566] [2025-03-04 16:04:46,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:04:46,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:04:46,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 16:04:46,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:04:46,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:46,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:04:46,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:04:46,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:04:46,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572054566] [2025-03-04 16:04:46,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572054566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:04:46,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:04:46,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 16:04:46,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202724843] [2025-03-04 16:04:46,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:04:46,806 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:04:46,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:04:46,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 16:04:46,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 16:04:46,807 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. cyclomatic complexity: 9 Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:04:46,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:04:46,832 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2025-03-04 16:04:46,832 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 36 transitions. [2025-03-04 16:04:46,833 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2025-03-04 16:04:46,833 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 36 transitions. [2025-03-04 16:04:46,833 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2025-03-04 16:04:46,833 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2025-03-04 16:04:46,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 36 transitions. [2025-03-04 16:04:46,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:04:46,835 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 36 transitions. [2025-03-04 16:04:46,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 36 transitions. [2025-03-04 16:04:46,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-03-04 16:04:46,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 28 states have internal predecessors, (36), 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) [2025-03-04 16:04:46,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2025-03-04 16:04:46,837 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 36 transitions. [2025-03-04 16:04:46,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 16:04:46,838 INFO L432 stractBuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2025-03-04 16:04:46,838 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-04 16:04:46,838 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. [2025-03-04 16:04:46,839 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2025-03-04 16:04:46,839 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:04:46,839 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:04:46,839 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-04 16:04:46,839 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:04:46,839 INFO L752 eck$LassoCheckResult]: Stem: "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(9, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_#t~nondet1#1;main_~k~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~n~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !!(main_~n~0#1 < 1000000);" "assume main_~k~0#1 == main_~n~0#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~n~0#1;main_~j~0#1 := 2 * main_~i~0#1;" [2025-03-04 16:04:46,839 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~j~0#1 < main_~n~0#1;havoc main_#t~nondet3#1;" "assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_~j~0#1;" "assume main_~k~0#1 < main_~n~0#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 >= 2 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume !(main_~k~0#1 < main_~n~0#1);" "main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" [2025-03-04 16:04:46,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:04:46,841 INFO L85 PathProgramCache]: Analyzing trace with hash 71540997, now seen corresponding path program 2 times [2025-03-04 16:04:46,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:04:46,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389069287] [2025-03-04 16:04:46,841 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:04:46,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:04:46,845 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:04:46,851 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:04:46,851 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:04:46,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:46,851 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:04:46,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:04:46,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:04:46,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:46,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:46,857 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:04:46,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:04:46,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1407466509, now seen corresponding path program 1 times [2025-03-04 16:04:46,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:04:46,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642785089] [2025-03-04 16:04:46,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:04:46,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:04:46,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 16:04:46,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 16:04:46,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:46,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:46,873 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:04:46,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 16:04:46,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 16:04:46,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:46,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:46,877 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:04:46,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:04:46,877 INFO L85 PathProgramCache]: Analyzing trace with hash -889311607, now seen corresponding path program 1 times [2025-03-04 16:04:46,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:04:46,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632714777] [2025-03-04 16:04:46,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:04:46,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:04:46,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 16:04:46,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 16:04:46,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:46,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:46,884 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:04:46,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 16:04:46,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 16:04:46,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:46,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:46,898 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:04:46,956 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:04:46,956 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:04:46,957 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:04:46,957 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:04:46,957 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 16:04:46,957 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:46,957 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:04:46,957 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:04:46,957 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested6.i_Iteration3_Loop [2025-03-04 16:04:46,957 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:04:46,957 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:04:46,958 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:46,960 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:46,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:46,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:46,965 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:46,967 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:47,015 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 [2025-03-04 16:04:47,032 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:04:47,032 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 16:04:47,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:47,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:47,034 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) [2025-03-04 16:04:47,036 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 [2025-03-04 16:04:47,037 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:04:47,037 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:04:47,048 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:04:47,048 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post4#1=0} Honda state: {ULTIMATE.start_main_#t~post4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:04:47,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-03-04 16:04:47,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:47,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:47,055 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:04:47,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-04 16:04:47,057 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:04:47,057 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:04:47,068 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:04:47,068 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:04:47,073 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 [2025-03-04 16:04:47,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:47,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:47,075 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) [2025-03-04 16:04:47,077 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 [2025-03-04 16:04:47,078 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:04:47,078 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:04:47,088 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:04:47,088 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:04:47,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-03-04 16:04:47,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:47,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:47,096 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) [2025-03-04 16:04:47,096 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 [2025-03-04 16:04:47,097 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:04:47,097 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:04:47,107 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:04:47,107 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet3#1=0} Honda state: {ULTIMATE.start_main_#t~nondet3#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:04:47,112 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 [2025-03-04 16:04:47,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:47,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:47,114 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) [2025-03-04 16:04:47,116 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 [2025-03-04 16:04:47,117 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:04:47,117 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:04:47,127 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:04:47,127 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post5#1=0} Honda state: {ULTIMATE.start_main_#t~post5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:04:47,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-03-04 16:04:47,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:47,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:47,134 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) [2025-03-04 16:04:47,135 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 [2025-03-04 16:04:47,136 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:04:47,136 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:04:47,153 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 [2025-03-04 16:04:47,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:47,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:47,155 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) [2025-03-04 16:04:47,157 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 [2025-03-04 16:04:47,159 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 16:04:47,159 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:04:47,331 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 16:04:47,337 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 [2025-03-04 16:04:47,338 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:04:47,338 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:04:47,338 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:04:47,338 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:04:47,338 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 16:04:47,338 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:47,338 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:04:47,338 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:04:47,338 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested6.i_Iteration3_Loop [2025-03-04 16:04:47,338 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:04:47,338 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:04:47,339 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:47,343 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:47,345 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:47,346 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:47,351 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:47,352 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:47,399 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:04:47,399 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 16:04:47,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:47,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:47,401 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) [2025-03-04 16:04:47,402 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 [2025-03-04 16:04:47,402 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 [2025-03-04 16:04:47,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:04:47,412 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:04:47,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:04:47,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:04:47,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:04:47,412 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:04:47,412 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:04:47,414 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:04:47,418 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 [2025-03-04 16:04:47,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:47,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:47,420 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) [2025-03-04 16:04:47,421 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 [2025-03-04 16:04:47,422 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 [2025-03-04 16:04:47,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:04:47,431 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:04:47,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:04:47,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:04:47,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:04:47,432 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:04:47,432 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:04:47,433 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:04:47,438 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 [2025-03-04 16:04:47,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:47,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:47,440 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) [2025-03-04 16:04:47,440 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 [2025-03-04 16:04:47,441 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 [2025-03-04 16:04:47,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:04:47,451 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:04:47,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:04:47,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:04:47,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:04:47,451 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:04:47,451 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:04:47,453 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:04:47,457 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 [2025-03-04 16:04:47,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:47,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:47,459 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) [2025-03-04 16:04:47,460 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 [2025-03-04 16:04:47,461 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 [2025-03-04 16:04:47,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:04:47,470 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:04:47,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:04:47,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:04:47,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:04:47,471 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:04:47,471 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:04:47,472 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:04:47,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-03-04 16:04:47,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:47,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:47,480 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) [2025-03-04 16:04:47,481 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 [2025-03-04 16:04:47,481 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 [2025-03-04 16:04:47,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:04:47,492 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:04:47,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:04:47,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:04:47,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:04:47,493 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:04:47,493 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:04:47,494 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:04:47,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-03-04 16:04:47,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:47,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:47,501 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:04:47,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-03-04 16:04:47,504 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 [2025-03-04 16:04:47,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:04:47,514 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:04:47,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:04:47,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:04:47,514 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:04:47,516 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:04:47,516 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:04:47,518 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 16:04:47,522 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-03-04 16:04:47,522 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-04 16:04:47,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:47,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:47,524 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:04:47,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-03-04 16:04:47,526 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 16:04:47,526 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 16:04:47,526 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 16:04:47,526 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1, ULTIMATE.start_main_~j~0#1) = 1*ULTIMATE.start_main_~n~0#1 - 1*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2025-03-04 16:04:47,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-03-04 16:04:47,533 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 16:04:47,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:04:47,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:04:47,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:04:47,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:47,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:04:47,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 16:04:47,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:04:47,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 16:04:47,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 16:04:47,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:47,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:04:47,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 16:04:47,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:04:47,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 16:04:47,599 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 [2025-03-04 16:04:47,599 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 36 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:04:47,619 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 36 transitions. cyclomatic complexity: 9. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 72 states and 90 transitions. Complement of second has 5 states. [2025-03-04 16:04:47,620 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 [2025-03-04 16:04:47,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:04:47,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2025-03-04 16:04:47,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 7 letters. [2025-03-04 16:04:47,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:04:47,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 12 letters. Loop has 7 letters. [2025-03-04 16:04:47,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:04:47,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 14 letters. [2025-03-04 16:04:47,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:04:47,621 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 90 transitions. [2025-03-04 16:04:47,622 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2025-03-04 16:04:47,622 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 57 states and 71 transitions. [2025-03-04 16:04:47,622 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2025-03-04 16:04:47,622 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2025-03-04 16:04:47,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 71 transitions. [2025-03-04 16:04:47,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:04:47,622 INFO L218 hiAutomatonCegarLoop]: Abstraction has 57 states and 71 transitions. [2025-03-04 16:04:47,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 71 transitions. [2025-03-04 16:04:47,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 45. [2025-03-04 16:04:47,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 44 states have internal predecessors, (56), 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) [2025-03-04 16:04:47,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2025-03-04 16:04:47,624 INFO L240 hiAutomatonCegarLoop]: Abstraction has 45 states and 56 transitions. [2025-03-04 16:04:47,624 INFO L432 stractBuchiCegarLoop]: Abstraction has 45 states and 56 transitions. [2025-03-04 16:04:47,625 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-04 16:04:47,625 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 56 transitions. [2025-03-04 16:04:47,625 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2025-03-04 16:04:47,625 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:04:47,625 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:04:47,625 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:04:47,627 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 16:04:47,627 INFO L752 eck$LassoCheckResult]: Stem: "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(9, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_#t~nondet1#1;main_~k~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~n~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !!(main_~n~0#1 < 1000000);" "assume main_~k~0#1 == main_~n~0#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~n~0#1;main_~j~0#1 := 2 * main_~i~0#1;" "assume main_~j~0#1 < main_~n~0#1;havoc main_#t~nondet3#1;" "assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_~j~0#1;" [2025-03-04 16:04:47,627 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~k~0#1 < main_~n~0#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 >= 2 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" [2025-03-04 16:04:47,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:04:47,628 INFO L85 PathProgramCache]: Analyzing trace with hash 31422419, now seen corresponding path program 1 times [2025-03-04 16:04:47,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:04:47,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571373897] [2025-03-04 16:04:47,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:04:47,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:04:47,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 16:04:47,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 16:04:47,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:47,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:47,636 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:04:47,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 16:04:47,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 16:04:47,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:47,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:47,642 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:04:47,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:04:47,643 INFO L85 PathProgramCache]: Analyzing trace with hash 42661, now seen corresponding path program 1 times [2025-03-04 16:04:47,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:04:47,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915315800] [2025-03-04 16:04:47,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:04:47,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:04:47,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:04:47,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:04:47,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:47,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:47,650 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:04:47,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:04:47,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:04:47,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:47,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:47,656 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:04:47,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:04:47,656 INFO L85 PathProgramCache]: Analyzing trace with hash -197573229, now seen corresponding path program 1 times [2025-03-04 16:04:47,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:04:47,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393328281] [2025-03-04 16:04:47,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:04:47,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:04:47,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 16:04:47,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 16:04:47,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:47,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:47,667 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:04:47,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 16:04:47,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 16:04:47,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:47,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:47,676 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:04:47,699 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:04:47,699 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:04:47,699 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:04:47,699 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:04:47,699 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 16:04:47,699 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:47,699 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:04:47,699 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:04:47,699 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested6.i_Iteration4_Loop [2025-03-04 16:04:47,699 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:04:47,699 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:04:47,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:47,702 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:47,707 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:47,709 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:47,727 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:04:47,728 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 16:04:47,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:47,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:47,729 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:04:47,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-03-04 16:04:47,756 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:04:47,756 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:04:47,767 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:04:47,767 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:04:47,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-03-04 16:04:47,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:47,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:47,774 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:04:47,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-03-04 16:04:47,775 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:04:47,775 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:04:47,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-03-04 16:04:47,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:47,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:47,793 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:04:47,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-03-04 16:04:47,795 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 16:04:47,795 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:04:47,878 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 16:04:47,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-03-04 16:04:47,883 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:04:47,883 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:04:47,883 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:04:47,883 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:04:47,883 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 16:04:47,883 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:47,883 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:04:47,883 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:04:47,883 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested6.i_Iteration4_Loop [2025-03-04 16:04:47,883 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:04:47,883 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:04:47,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:47,885 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:47,890 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:47,892 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:47,921 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:04:47,921 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 16:04:47,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:47,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:47,924 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:04:47,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-03-04 16:04:47,927 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 [2025-03-04 16:04:47,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:04:47,937 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:04:47,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:04:47,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:04:47,937 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:04:47,937 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:04:47,937 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:04:47,939 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:04:47,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-03-04 16:04:47,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:47,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:47,947 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:04:47,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-03-04 16:04:47,950 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 [2025-03-04 16:04:47,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:04:47,960 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:04:47,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:04:47,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:04:47,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:04:47,961 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:04:47,961 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:04:47,962 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 16:04:47,964 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 16:04:47,964 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-04 16:04:47,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:47,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:47,966 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:04:47,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-03-04 16:04:47,968 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 16:04:47,969 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 16:04:47,969 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 16:04:47,969 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1, ULTIMATE.start_main_~n~0#1) = -1*ULTIMATE.start_main_~k~0#1 + 1*ULTIMATE.start_main_~n~0#1 Supporting invariants [] [2025-03-04 16:04:47,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-03-04 16:04:47,975 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 16:04:47,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:04:47,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 16:04:47,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 16:04:47,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:47,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:04:47,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 16:04:47,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:04:48,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:04:48,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:04:48,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:48,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:04:48,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 16:04:48,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:04:48,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:04:48,022 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 [2025-03-04 16:04:48,022 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 56 transitions. cyclomatic complexity: 15 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) [2025-03-04 16:04:48,046 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 56 transitions. cyclomatic complexity: 15. 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 140 states and 175 transitions. Complement of second has 7 states. [2025-03-04 16:04:48,046 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 [2025-03-04 16:04:48,047 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) [2025-03-04 16:04:48,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2025-03-04 16:04:48,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 7 letters. Loop has 3 letters. [2025-03-04 16:04:48,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:04:48,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 10 letters. Loop has 3 letters. [2025-03-04 16:04:48,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:04:48,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 7 letters. Loop has 6 letters. [2025-03-04 16:04:48,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:04:48,047 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 140 states and 175 transitions. [2025-03-04 16:04:48,049 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 28 [2025-03-04 16:04:48,050 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 140 states to 103 states and 127 transitions. [2025-03-04 16:04:48,050 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2025-03-04 16:04:48,050 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2025-03-04 16:04:48,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 127 transitions. [2025-03-04 16:04:48,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:04:48,050 INFO L218 hiAutomatonCegarLoop]: Abstraction has 103 states and 127 transitions. [2025-03-04 16:04:48,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states and 127 transitions. [2025-03-04 16:04:48,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 71. [2025-03-04 16:04:48,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 70 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:04:48,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 87 transitions. [2025-03-04 16:04:48,052 INFO L240 hiAutomatonCegarLoop]: Abstraction has 71 states and 87 transitions. [2025-03-04 16:04:48,052 INFO L432 stractBuchiCegarLoop]: Abstraction has 71 states and 87 transitions. [2025-03-04 16:04:48,052 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-04 16:04:48,052 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 87 transitions. [2025-03-04 16:04:48,053 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2025-03-04 16:04:48,053 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:04:48,053 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:04:48,053 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:04:48,053 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 16:04:48,053 INFO L752 eck$LassoCheckResult]: Stem: "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(9, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_#t~nondet1#1;main_~k~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~n~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !!(main_~n~0#1 < 1000000);" "assume main_~k~0#1 == main_~n~0#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~n~0#1;main_~j~0#1 := 2 * main_~i~0#1;" "assume main_~j~0#1 < main_~n~0#1;havoc main_#t~nondet3#1;" "assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_~j~0#1;" "assume main_~k~0#1 < main_~n~0#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 >= 2 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume !(main_~k~0#1 < main_~n~0#1);" "main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~j~0#1 < main_~n~0#1;havoc main_#t~nondet3#1;" "assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~k~0#1 := main_~j~0#1;" [2025-03-04 16:04:48,053 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~k~0#1 < main_~n~0#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 >= 2 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;main_#t~post4#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" [2025-03-04 16:04:48,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:04:48,054 INFO L85 PathProgramCache]: Analyzing trace with hash 70038615, now seen corresponding path program 2 times [2025-03-04 16:04:48,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:04:48,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720838785] [2025-03-04 16:04:48,054 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:04:48,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:04:48,057 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-04 16:04:48,063 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 16:04:48,066 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 16:04:48,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:04:48,124 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:04:48,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:04:48,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720838785] [2025-03-04 16:04:48,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720838785] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:04:48,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996448477] [2025-03-04 16:04:48,124 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:04:48,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:04:48,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:48,127 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 16:04:48,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-04 16:04:48,146 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-04 16:04:48,150 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 16:04:48,150 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 16:04:48,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:04:48,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 16:04:48,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:04:48,169 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:04:48,169 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:04:48,190 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:04:48,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996448477] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:04:48,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:04:48,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-03-04 16:04:48,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816912304] [2025-03-04 16:04:48,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:04:48,191 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 16:04:48,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:04:48,191 INFO L85 PathProgramCache]: Analyzing trace with hash 42661, now seen corresponding path program 2 times [2025-03-04 16:04:48,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:04:48,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370203438] [2025-03-04 16:04:48,191 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:04:48,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:04:48,193 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:04:48,195 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:04:48,195 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:04:48,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:48,195 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:04:48,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:04:48,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:04:48,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:48,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:48,201 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:04:48,228 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:04:48,228 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:04:48,228 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:04:48,228 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:04:48,228 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 16:04:48,228 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:48,228 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:04:48,228 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:04:48,228 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested6.i_Iteration5_Loop [2025-03-04 16:04:48,228 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:04:48,228 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:04:48,229 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:48,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:48,237 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:48,240 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:48,260 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:04:48,261 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 16:04:48,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:48,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:48,263 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:04:48,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-03-04 16:04:48,265 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:04:48,266 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:04:48,276 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:04:48,276 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:04:48,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-03-04 16:04:48,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:48,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:48,283 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:04:48,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-03-04 16:04:48,284 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:04:48,284 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:04:48,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-03-04 16:04:48,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:48,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:48,305 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:04:48,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-03-04 16:04:48,307 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 16:04:48,307 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:04:48,393 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 16:04:48,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-03-04 16:04:48,398 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:04:48,398 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:04:48,398 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:04:48,398 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:04:48,398 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 16:04:48,398 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:48,398 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:04:48,398 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:04:48,398 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested6.i_Iteration5_Loop [2025-03-04 16:04:48,398 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:04:48,398 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:04:48,399 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:48,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:48,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-03-04 16:04:48,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-03-04 16:04:48,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:48,427 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:48,444 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:04:48,444 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 16:04:48,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:48,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:48,448 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:04:48,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-03-04 16:04:48,450 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 [2025-03-04 16:04:48,460 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:04:48,460 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:04:48,460 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:04:48,460 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:04:48,460 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:04:48,460 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:04:48,460 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:04:48,461 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:04:48,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-03-04 16:04:48,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:48,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:48,468 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:04:48,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-03-04 16:04:48,470 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 [2025-03-04 16:04:48,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:04:48,480 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:04:48,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:04:48,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:04:48,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:04:48,480 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:04:48,480 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:04:48,482 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 16:04:48,488 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-03-04 16:04:48,488 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-04 16:04:48,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:48,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:48,490 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:04:48,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-03-04 16:04:48,492 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 16:04:48,493 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 16:04:48,493 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 16:04:48,493 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1, ULTIMATE.start_main_~n~0#1) = -1*ULTIMATE.start_main_~k~0#1 + 1*ULTIMATE.start_main_~n~0#1 Supporting invariants [] [2025-03-04 16:04:48,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-03-04 16:04:48,499 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 16:04:48,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:04:48,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 16:04:48,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 16:04:48,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:48,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:04:48,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 16:04:48,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:04:48,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:04:48,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:04:48,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:48,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:04:48,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 16:04:48,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:04:48,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:04:48,559 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 [2025-03-04 16:04:48,559 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 71 states and 87 transitions. cyclomatic complexity: 24 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:04:48,589 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 71 states and 87 transitions. cyclomatic complexity: 24. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 133 states and 165 transitions. Complement of second has 7 states. [2025-03-04 16:04:48,589 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 [2025-03-04 16:04:48,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:04:48,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2025-03-04 16:04:48,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 14 letters. Loop has 3 letters. [2025-03-04 16:04:48,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:04:48,590 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 16:04:48,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:04:48,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 16:04:48,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 16:04:48,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:48,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:04:48,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 16:04:48,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:04:48,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:04:48,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:04:48,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:48,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:04:48,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 16:04:48,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:04:48,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:04:48,642 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 [2025-03-04 16:04:48,643 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 71 states and 87 transitions. cyclomatic complexity: 24 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:04:48,663 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 71 states and 87 transitions. cyclomatic complexity: 24. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 133 states and 165 transitions. Complement of second has 7 states. [2025-03-04 16:04:48,665 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 [2025-03-04 16:04:48,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:04:48,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2025-03-04 16:04:48,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 14 letters. Loop has 3 letters. [2025-03-04 16:04:48,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:04:48,666 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 16:04:48,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:04:48,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 16:04:48,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 16:04:48,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:48,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:04:48,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 16:04:48,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:04:48,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:04:48,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:04:48,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:48,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:04:48,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 16:04:48,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:04:48,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:04:48,718 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 [2025-03-04 16:04:48,718 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 71 states and 87 transitions. cyclomatic complexity: 24 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:04:48,744 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 71 states and 87 transitions. cyclomatic complexity: 24. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 107 states and 134 transitions. Complement of second has 6 states. [2025-03-04 16:04:48,744 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 [2025-03-04 16:04:48,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:04:48,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2025-03-04 16:04:48,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 14 letters. Loop has 3 letters. [2025-03-04 16:04:48,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:04:48,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 17 letters. Loop has 3 letters. [2025-03-04 16:04:48,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:04:48,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 14 letters. Loop has 6 letters. [2025-03-04 16:04:48,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:04:48,745 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 134 transitions. [2025-03-04 16:04:48,746 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2025-03-04 16:04:48,747 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 49 states and 60 transitions. [2025-03-04 16:04:48,747 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2025-03-04 16:04:48,747 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2025-03-04 16:04:48,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 60 transitions. [2025-03-04 16:04:48,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:04:48,747 INFO L218 hiAutomatonCegarLoop]: Abstraction has 49 states and 60 transitions. [2025-03-04 16:04:48,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 60 transitions. [2025-03-04 16:04:48,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 29. [2025-03-04 16:04:48,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 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) [2025-03-04 16:04:48,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2025-03-04 16:04:48,748 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 35 transitions. [2025-03-04 16:04:48,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:04:48,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 16:04:48,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 16:04:48,749 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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) [2025-03-04 16:04:48,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:04:48,794 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2025-03-04 16:04:48,794 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 50 transitions. [2025-03-04 16:04:48,794 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2025-03-04 16:04:48,794 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 41 states and 48 transitions. [2025-03-04 16:04:48,794 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-03-04 16:04:48,794 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-03-04 16:04:48,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 48 transitions. [2025-03-04 16:04:48,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:04:48,795 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 48 transitions. [2025-03-04 16:04:48,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 48 transitions. [2025-03-04 16:04:48,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2025-03-04 16:04:48,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 36 states have internal predecessors, (44), 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) [2025-03-04 16:04:48,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2025-03-04 16:04:48,796 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 44 transitions. [2025-03-04 16:04:48,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 16:04:48,796 INFO L432 stractBuchiCegarLoop]: Abstraction has 37 states and 44 transitions. [2025-03-04 16:04:48,797 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-04 16:04:48,797 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 44 transitions. [2025-03-04 16:04:48,797 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2025-03-04 16:04:48,797 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:04:48,797 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:04:48,798 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:04:48,798 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:04:48,798 INFO L752 eck$LassoCheckResult]: Stem: "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(9, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~n~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~n~0#1;havoc main_#t~nondet1#1;main_~k~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;main_~n~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !!(main_~n~0#1 < 1000000);" "assume main_~k~0#1 == main_~n~0#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~n~0#1;main_~j~0#1 := 2 * main_~i~0#1;" "assume main_~j~0#1 < main_~n~0#1;havoc main_#t~nondet3#1;" "assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 >= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~j~0#1 < main_~n~0#1);main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~0#1 < main_~n~0#1;main_~j~0#1 := 2 * main_~i~0#1;" [2025-03-04 16:04:48,798 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~j~0#1 < main_~n~0#1;havoc main_#t~nondet3#1;" "assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 >= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" [2025-03-04 16:04:48,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:04:48,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1211527827, now seen corresponding path program 1 times [2025-03-04 16:04:48,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:04:48,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398441448] [2025-03-04 16:04:48,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:04:48,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:04:48,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 16:04:48,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 16:04:48,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:48,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:04:48,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:04:48,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:04:48,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398441448] [2025-03-04 16:04:48,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398441448] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:04:48,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502096608] [2025-03-04 16:04:48,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:04:48,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:04:48,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:48,858 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 16:04:48,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-03-04 16:04:48,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 16:04:48,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 16:04:48,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:48,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:04:48,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 16:04:48,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:04:48,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:04:48,938 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:04:48,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:04:48,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502096608] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:04:48,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:04:48,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 16:04:48,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963213331] [2025-03-04 16:04:48,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:04:48,970 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 16:04:48,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:04:48,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1911160306, now seen corresponding path program 1 times [2025-03-04 16:04:48,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:04:48,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844682623] [2025-03-04 16:04:48,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:04:48,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:04:48,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 16:04:48,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 16:04:48,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:48,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:48,977 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:04:48,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 16:04:48,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 16:04:48,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:48,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:04:48,986 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:04:49,016 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:04:49,016 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:04:49,016 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:04:49,016 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:04:49,017 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 16:04:49,017 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:49,017 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:04:49,017 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:04:49,017 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested6.i_Iteration6_Loop [2025-03-04 16:04:49,017 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:04:49,017 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:04:49,017 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:49,022 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:49,025 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:49,026 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:49,028 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:49,050 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:04:49,053 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 16:04:49,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:49,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:49,055 INFO L229 MonitoredProcess]: Starting monitored process 34 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) [2025-03-04 16:04:49,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-03-04 16:04:49,058 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:04:49,058 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:04:49,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2025-03-04 16:04:49,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:49,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:49,075 INFO L229 MonitoredProcess]: Starting monitored process 35 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) [2025-03-04 16:04:49,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-03-04 16:04:49,077 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 16:04:49,077 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:04:49,221 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 16:04:49,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-03-04 16:04:49,227 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:04:49,227 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:04:49,227 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:04:49,227 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:04:49,227 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 16:04:49,227 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:49,227 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:04:49,228 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:04:49,228 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested6.i_Iteration6_Loop [2025-03-04 16:04:49,228 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:04:49,228 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:04:49,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:49,236 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:49,237 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:49,239 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:49,240 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:04:49,266 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:04:49,266 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 16:04:49,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:49,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:49,268 INFO L229 MonitoredProcess]: Starting monitored process 36 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) [2025-03-04 16:04:49,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-03-04 16:04:49,270 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:04:49,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:04:49,280 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:04:49,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:04:49,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:04:49,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:04:49,281 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:04:49,281 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:04:49,282 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 16:04:49,285 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-03-04 16:04:49,285 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-04 16:04:49,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:04:49,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:04:49,286 INFO L229 MonitoredProcess]: Starting monitored process 37 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) [2025-03-04 16:04:49,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-03-04 16:04:49,288 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 16:04:49,288 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 16:04:49,288 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 16:04:49,288 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1, ULTIMATE.start_main_~n~0#1) = -1*ULTIMATE.start_main_~j~0#1 + 1*ULTIMATE.start_main_~n~0#1 Supporting invariants [] [2025-03-04 16:04:49,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2025-03-04 16:04:49,293 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 16:04:49,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:04:49,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 16:04:49,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 16:04:49,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:49,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:04:49,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 16:04:49,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:04:49,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 16:04:49,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 16:04:49,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:49,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:04:49,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 16:04:49,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:04:49,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:04:49,353 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 [2025-03-04 16:04:49,353 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 44 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2025-03-04 16:04:49,371 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 44 transitions. cyclomatic complexity: 9. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 67 states and 81 transitions. Complement of second has 5 states. [2025-03-04 16:04:49,371 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 [2025-03-04 16:04:49,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2025-03-04 16:04:49,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2025-03-04 16:04:49,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 14 letters. Loop has 7 letters. [2025-03-04 16:04:49,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:04:49,372 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 16:04:49,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:04:49,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 16:04:49,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 16:04:49,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:49,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:04:49,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 16:04:49,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:04:49,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 16:04:49,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 16:04:49,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:49,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:04:49,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 16:04:49,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:04:49,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:04:49,436 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 [2025-03-04 16:04:49,436 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 44 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2025-03-04 16:04:49,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-03-04 16:04:49,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2025-03-04 16:04:49,484 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 44 transitions. cyclomatic complexity: 9. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 67 states and 81 transitions. Complement of second has 5 states. [2025-03-04 16:04:49,484 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 [2025-03-04 16:04:49,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2025-03-04 16:04:49,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2025-03-04 16:04:49,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 14 letters. Loop has 7 letters. [2025-03-04 16:04:49,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:04:49,485 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 16:04:49,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:04:49,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 16:04:49,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 16:04:49,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:49,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:04:49,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 16:04:49,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:04:49,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 16:04:49,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 16:04:49,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:04:49,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:04:49,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 16:04:49,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:04:49,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:04:49,548 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 [2025-03-04 16:04:49,548 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 44 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2025-03-04 16:04:49,568 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 44 transitions. cyclomatic complexity: 9. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 65 states and 78 transitions. Complement of second has 4 states. [2025-03-04 16:04:49,569 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 [2025-03-04 16:04:49,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2025-03-04 16:04:49,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2025-03-04 16:04:49,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 14 letters. Loop has 7 letters. [2025-03-04 16:04:49,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:04:49,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 21 letters. Loop has 7 letters. [2025-03-04 16:04:49,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:04:49,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 14 letters. Loop has 14 letters. [2025-03-04 16:04:49,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:04:49,570 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 78 transitions. [2025-03-04 16:04:49,571 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 16:04:49,571 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 0 states and 0 transitions. [2025-03-04 16:04:49,571 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-04 16:04:49,571 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-04 16:04:49,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-04 16:04:49,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:04:49,571 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 16:04:49,571 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 16:04:49,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:04:49,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 16:04:49,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 16:04:49,571 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 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) [2025-03-04 16:04:49,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:04:49,571 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-03-04 16:04:49,571 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-03-04 16:04:49,571 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 16:04:49,571 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 16:04:49,572 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-04 16:04:49,572 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-04 16:04:49,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-04 16:04:49,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:04:49,572 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 16:04:49,572 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 16:04:49,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 16:04:49,572 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 16:04:49,572 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-04 16:04:49,572 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-04 16:04:49,572 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 16:04:49,572 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-04 16:04:49,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 04.03 04:04:49 BoogieIcfgContainer [2025-03-04 16:04:49,580 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-04 16:04:49,581 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 16:04:49,581 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 16:04:49,581 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 16:04:49,581 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:04:46" (3/4) ... [2025-03-04 16:04:49,582 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 16:04:49,583 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 16:04:49,584 INFO L158 Benchmark]: Toolchain (without parser) took 3991.84ms. Allocated memory is still 167.8MB. Free memory was 134.9MB in the beginning and 121.1MB in the end (delta: 13.8MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. [2025-03-04 16:04:49,584 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:04:49,584 INFO L158 Benchmark]: CACSL2BoogieTranslator took 142.24ms. Allocated memory is still 167.8MB. Free memory was 134.9MB in the beginning and 123.7MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 16:04:49,585 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.64ms. Allocated memory is still 167.8MB. Free memory was 123.7MB in the beginning and 122.9MB in the end (delta: 867.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:04:49,585 INFO L158 Benchmark]: Boogie Preprocessor took 25.04ms. Allocated memory is still 167.8MB. Free memory was 122.9MB in the beginning and 121.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:04:49,585 INFO L158 Benchmark]: IcfgBuilder took 223.80ms. Allocated memory is still 167.8MB. Free memory was 121.6MB in the beginning and 109.6MB in the end (delta: 12.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 16:04:49,585 INFO L158 Benchmark]: BuchiAutomizer took 3571.20ms. Allocated memory is still 167.8MB. Free memory was 109.6MB in the beginning and 121.2MB in the end (delta: -11.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:04:49,585 INFO L158 Benchmark]: Witness Printer took 2.26ms. Allocated memory is still 167.8MB. Free memory was 121.2MB in the beginning and 121.1MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:04:49,587 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.16ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 142.24ms. Allocated memory is still 167.8MB. Free memory was 134.9MB in the beginning and 123.7MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.64ms. Allocated memory is still 167.8MB. Free memory was 123.7MB in the beginning and 122.9MB in the end (delta: 867.6kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.04ms. Allocated memory is still 167.8MB. Free memory was 122.9MB in the beginning and 121.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 223.80ms. Allocated memory is still 167.8MB. Free memory was 121.6MB in the beginning and 109.6MB in the end (delta: 12.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 3571.20ms. Allocated memory is still 167.8MB. Free memory was 109.6MB in the beginning and 121.2MB in the end (delta: -11.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.26ms. Allocated memory is still 167.8MB. Free memory was 121.2MB in the beginning and 121.1MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (4 trivial, 3 deterministic, 2 nondeterministic). One deterministic module has affine ranking function (((long long) -1 * i) + n) and consists of 4 locations. One deterministic module has affine ranking function (((long long) -1 * j) + n) and consists of 3 locations. One deterministic module has affine ranking function (n + ((long long) -1 * k)) and consists of 4 locations. One nondeterministic module has affine ranking function (n + ((long long) -1 * k)) and consists of 4 locations. One nondeterministic module has affine ranking function (((long long) -1 * j) + n) and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.5s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 2.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 90 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 299 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 290 mSDsluCounter, 293 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 99 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 255 IncrementalHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 194 mSDtfsCounter, 255 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT2 conc0 concLT1 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq143 hnf94 smp97 dnf100 smp100 tf108 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 32ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-03-04 16:04:49,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2025-03-04 16:04:49,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-03-04 16:04:50,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE