./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/count_down-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e2fb8bed 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/termination-memory-alloca/count_down-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash 99c02e26cc69c81635e61f874ccaf79837a3339fa533477441a437bf8690e003 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 06:53:50,168 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:53:50,213 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-09 06:53:50,216 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:53:50,216 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:53:50,216 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-09 06:53:50,239 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:53:50,240 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:53:50,240 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:53:50,240 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:53:50,240 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:53:50,240 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:53:50,241 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:53:50,242 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:53:50,242 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-09 06:53:50,242 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-09 06:53:50,242 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-09 06:53:50,242 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-09 06:53:50,242 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-09 06:53:50,242 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-09 06:53:50,242 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:53:50,242 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-09 06:53:50,242 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:53:50,242 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:53:50,242 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-09 06:53:50,242 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-09 06:53:50,242 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-09 06:53:50,242 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:53:50,242 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:53:50,242 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-09 06:53:50,242 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:53:50,242 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:53:50,242 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:53:50,243 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:53:50,243 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:53:50,243 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:53:50,243 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-09 06:53:50,243 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 99c02e26cc69c81635e61f874ccaf79837a3339fa533477441a437bf8690e003 [2025-03-09 06:53:50,443 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:53:50,449 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:53:50,450 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:53:50,451 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:53:50,451 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:53:50,452 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/count_down-alloca-2.i [2025-03-09 06:53:51,565 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49a034992/6fc968854f2d4207b09d53a72899914c/FLAG48f02da14 [2025-03-09 06:53:51,838 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:53:51,839 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/count_down-alloca-2.i [2025-03-09 06:53:51,852 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49a034992/6fc968854f2d4207b09d53a72899914c/FLAG48f02da14 [2025-03-09 06:53:52,112 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49a034992/6fc968854f2d4207b09d53a72899914c [2025-03-09 06:53:52,114 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:53:52,115 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:53:52,117 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:53:52,117 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:53:52,121 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:53:52,121 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:53:52" (1/1) ... [2025-03-09 06:53:52,123 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34f45f58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:53:52, skipping insertion in model container [2025-03-09 06:53:52,123 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:53:52" (1/1) ... [2025-03-09 06:53:52,140 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:53:52,283 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:53:52,292 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:53:52,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:53:52,349 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:53:52,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:53:52 WrapperNode [2025-03-09 06:53:52,349 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:53:52,350 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:53:52,350 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:53:52,350 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:53:52,354 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:53:52" (1/1) ... [2025-03-09 06:53:52,364 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:53:52" (1/1) ... [2025-03-09 06:53:52,382 INFO L138 Inliner]: procedures = 110, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 52 [2025-03-09 06:53:52,382 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:53:52,384 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:53:52,384 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:53:52,384 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:53:52,389 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:53:52" (1/1) ... [2025-03-09 06:53:52,389 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:53:52" (1/1) ... [2025-03-09 06:53:52,391 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:53:52" (1/1) ... [2025-03-09 06:53:52,400 INFO L175 MemorySlicer]: Split 4 memory accesses to 1 slices as follows [4]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2025-03-09 06:53:52,400 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:53:52" (1/1) ... [2025-03-09 06:53:52,400 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:53:52" (1/1) ... [2025-03-09 06:53:52,403 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:53:52" (1/1) ... [2025-03-09 06:53:52,403 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:53:52" (1/1) ... [2025-03-09 06:53:52,404 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:53:52" (1/1) ... [2025-03-09 06:53:52,404 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:53:52" (1/1) ... [2025-03-09 06:53:52,405 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:53:52,406 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:53:52,406 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:53:52,406 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:53:52,406 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:53:52" (1/1) ... [2025-03-09 06:53:52,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:52,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:52,433 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-09 06:53:52,438 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-09 06:53:52,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 06:53:52,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 06:53:52,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 06:53:52,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 06:53:52,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:53:52,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:53:52,519 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:53:52,520 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:53:52,631 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L552: call ULTIMATE.dealloc(main_#t~malloc3#1.base, main_#t~malloc3#1.offset);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; [2025-03-09 06:53:52,639 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-03-09 06:53:52,640 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:53:52,648 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:53:52,648 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 06:53:52,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:53:52 BoogieIcfgContainer [2025-03-09 06:53:52,649 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:53:52,649 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-09 06:53:52,649 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-09 06:53:52,653 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-09 06:53:52,654 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:53:52,654 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.03 06:53:52" (1/3) ... [2025-03-09 06:53:52,655 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5bbcd709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 06:53:52, skipping insertion in model container [2025-03-09 06:53:52,655 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:53:52,655 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:53:52" (2/3) ... [2025-03-09 06:53:52,655 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5bbcd709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 06:53:52, skipping insertion in model container [2025-03-09 06:53:52,655 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:53:52,655 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:53:52" (3/3) ... [2025-03-09 06:53:52,656 INFO L363 chiAutomizerObserver]: Analyzing ICFG count_down-alloca-2.i [2025-03-09 06:53:52,688 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-09 06:53:52,689 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-09 06:53:52,689 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-09 06:53:52,689 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-09 06:53:52,689 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-09 06:53:52,689 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-09 06:53:52,689 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-09 06:53:52,689 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-09 06:53:52,694 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09 06:53:52,706 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2025-03-09 06:53:52,706 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:53:52,706 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:53:52,710 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-09 06:53:52,710 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 06:53:52,710 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-09 06:53:52,710 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09 06:53:52,711 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2025-03-09 06:53:52,711 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:53:52,711 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:53:52,711 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-09 06:53:52,711 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 06:53:52,715 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0;" [2025-03-09 06:53:52,716 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume main_~val~0#1 < 0;main_~val~0#1 := 0;" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" [2025-03-09 06:53:52,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:52,719 INFO L85 PathProgramCache]: Analyzing trace with hash 53409239, now seen corresponding path program 1 times [2025-03-09 06:53:52,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:52,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022802565] [2025-03-09 06:53:52,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:53:52,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:52,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:53:52,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:53:52,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:52,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:52,788 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:52,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:53:52,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:53:52,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:52,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:52,805 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:52,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:52,807 INFO L85 PathProgramCache]: Analyzing trace with hash 45614, now seen corresponding path program 1 times [2025-03-09 06:53:52,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:52,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437881395] [2025-03-09 06:53:52,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:53:52,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:52,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:53:52,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:53:52,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:52,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:52,816 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:52,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:53:52,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:53:52,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:52,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:52,823 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:52,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:52,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1976755352, now seen corresponding path program 1 times [2025-03-09 06:53:52,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:52,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001489549] [2025-03-09 06:53:52,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:53:52,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:52,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:53:52,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:53:52,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:52,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:52,842 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:52,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:53:52,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:53:52,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:52,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:52,853 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:53,074 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:53:53,075 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:53:53,075 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:53:53,075 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:53:53,075 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:53:53,076 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:53,076 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:53:53,076 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:53:53,077 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration1_Lasso [2025-03-09 06:53:53,077 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:53:53,077 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:53:53,090 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:53,095 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:53,223 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:53,225 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:53,227 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:53,230 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:53,246 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:53,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:53,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:53,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:53,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:53,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:53,263 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:53,266 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:53,268 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:53,473 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:53:53,476 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:53:53,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:53,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:53,479 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-09 06:53:53,480 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-09 06:53:53,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-09 06:53:53,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:53,491 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:53,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:53,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:53,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:53,495 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:53,495 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:53,496 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:53,502 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-09 06:53:53,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:53,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:53,504 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-09 06:53:53,505 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-09 06:53:53,507 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-09 06:53:53,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:53,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:53,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:53,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:53,520 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:53,520 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:53,524 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:53,530 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-09 06:53:53,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:53,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:53,532 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-09 06:53:53,534 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-09 06:53:53,535 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-09 06:53:53,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:53,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:53,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:53,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:53,551 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:53,551 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:53,559 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:53:53,589 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2025-03-09 06:53:53,591 INFO L444 ModelExtractionUtils]: 1 out of 19 variables were initially zero. Simplification set additionally 14 variables to zero. [2025-03-09 06:53:53,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:53,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:53,595 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-09 06:53:53,596 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-09 06:53:53,598 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:53:53,608 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-03-09 06:53:53,609 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:53:53,609 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1, ULTIMATE.start_main_~i~0#1) = 1*v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1 - 4*ULTIMATE.start_main_~i~0#1 Supporting invariants [1*ULTIMATE.start_main_~arr~0#1.offset >= 0] [2025-03-09 06:53:53,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:53,624 INFO L156 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2025-03-09 06:53:53,631 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-09 06:53:53,632 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-09 06:53:53,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:53,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:53:53,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:53:53,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:53,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:53,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:53:53,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:53,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:53:53,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:53:53,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:53,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:53,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:53:53,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:53,712 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-09 06:53:53,730 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2025-03-09 06:53:53,731 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:53,769 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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). Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 22 states and 31 transitions. Complement of second has 6 states. [2025-03-09 06:53:53,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-09 06:53:53,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:53,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2025-03-09 06:53:53,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 5 letters. Loop has 3 letters. [2025-03-09 06:53:53,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:53,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 8 letters. Loop has 3 letters. [2025-03-09 06:53:53,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:53,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 5 letters. Loop has 6 letters. [2025-03-09 06:53:53,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:53,784 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 31 transitions. [2025-03-09 06:53:53,786 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-09 06:53:53,788 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 14 states and 20 transitions. [2025-03-09 06:53:53,789 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-09 06:53:53,789 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-09 06:53:53,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 20 transitions. [2025-03-09 06:53:53,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:53:53,790 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 20 transitions. [2025-03-09 06:53:53,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 20 transitions. [2025-03-09 06:53:53,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2025-03-09 06:53:53,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 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-09 06:53:53,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2025-03-09 06:53:53,806 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 19 transitions. [2025-03-09 06:53:53,807 INFO L432 stractBuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2025-03-09 06:53:53,807 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-09 06:53:53,807 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. [2025-03-09 06:53:53,807 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-09 06:53:53,808 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:53:53,808 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:53:53,808 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-09 06:53:53,808 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 06:53:53,809 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" [2025-03-09 06:53:53,809 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~j~0#1 < main_~length~0#1;" "assume !true;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" [2025-03-09 06:53:53,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:53,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1655686421, now seen corresponding path program 1 times [2025-03-09 06:53:53,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:53,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3086519] [2025-03-09 06:53:53,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:53:53,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:53,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:53:53,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:53:53,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:53,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:53,867 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-09 06:53:53,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:53:53,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3086519] [2025-03-09 06:53:53,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3086519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:53:53,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:53:53,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:53:53,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954460371] [2025-03-09 06:53:53,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:53:53,870 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:53:53,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:53,870 INFO L85 PathProgramCache]: Analyzing trace with hash 40676, now seen corresponding path program 1 times [2025-03-09 06:53:53,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:53,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096191902] [2025-03-09 06:53:53,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:53:53,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:53,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:53:53,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:53:53,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:53,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:53,877 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-09 06:53:53,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:53:53,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096191902] [2025-03-09 06:53:53,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096191902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:53:53,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:53:53,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:53:53,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676114345] [2025-03-09 06:53:53,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:53:53,877 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 06:53:53,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:53:53,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 06:53:53,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 06:53:53,881 INFO L87 Difference]: Start difference. First operand 13 states and 19 transitions. cyclomatic complexity: 8 Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:53,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:53:53,884 INFO L93 Difference]: Finished difference Result 13 states and 18 transitions. [2025-03-09 06:53:53,884 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 18 transitions. [2025-03-09 06:53:53,884 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-09 06:53:53,885 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 18 transitions. [2025-03-09 06:53:53,885 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-09 06:53:53,885 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-09 06:53:53,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2025-03-09 06:53:53,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:53:53,886 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2025-03-09 06:53:53,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2025-03-09 06:53:53,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-03-09 06:53:53,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:53,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2025-03-09 06:53:53,889 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2025-03-09 06:53:53,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 06:53:53,889 INFO L432 stractBuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2025-03-09 06:53:53,889 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-09 06:53:53,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2025-03-09 06:53:53,890 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-09 06:53:53,890 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:53:53,890 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:53:53,890 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-09 06:53:53,890 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-09 06:53:53,890 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" [2025-03-09 06:53:53,890 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" [2025-03-09 06:53:53,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:53,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1655686421, now seen corresponding path program 2 times [2025-03-09 06:53:53,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:53,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633588495] [2025-03-09 06:53:53,891 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:53:53,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:53,894 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:53:53,897 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:53:53,897 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:53:53,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:53,936 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-09 06:53:53,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:53:53,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633588495] [2025-03-09 06:53:53,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633588495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:53:53,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:53:53,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:53:53,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351045281] [2025-03-09 06:53:53,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:53:53,937 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:53:53,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:53,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1260092, now seen corresponding path program 1 times [2025-03-09 06:53:53,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:53,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025520383] [2025-03-09 06:53:53,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:53:53,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:53,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:53:53,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:53:53,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:53,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:53,942 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:53,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:53:53,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:53:53,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:53,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:53,945 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:53,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:53:53,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:53:53,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:53:53,980 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 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-09 06:53:53,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:53:53,993 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2025-03-09 06:53:53,993 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 20 transitions. [2025-03-09 06:53:53,994 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-09 06:53:53,994 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 20 transitions. [2025-03-09 06:53:53,994 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-09 06:53:53,994 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-09 06:53:53,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2025-03-09 06:53:53,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:53:53,995 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 20 transitions. [2025-03-09 06:53:53,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2025-03-09 06:53:53,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2025-03-09 06:53:53,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 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-09 06:53:53,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2025-03-09 06:53:53,996 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 17 transitions. [2025-03-09 06:53:53,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:53:53,996 INFO L432 stractBuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2025-03-09 06:53:53,996 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-09 06:53:53,997 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2025-03-09 06:53:53,997 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-09 06:53:53,997 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:53:53,997 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:53:53,997 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:53:53,997 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-09 06:53:53,997 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" [2025-03-09 06:53:53,997 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" [2025-03-09 06:53:53,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:53,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1149874741, now seen corresponding path program 1 times [2025-03-09 06:53:53,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:53,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544116194] [2025-03-09 06:53:53,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:53:53,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:54,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:53:54,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:53:54,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:54,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:54,006 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:54,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:53:54,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:53:54,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:54,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:54,013 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:54,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:54,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1260092, now seen corresponding path program 2 times [2025-03-09 06:53:54,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:54,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870514782] [2025-03-09 06:53:54,014 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:53:54,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:54,020 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:53:54,021 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:53:54,021 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:53:54,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:54,021 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:54,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:53:54,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:53:54,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:54,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:54,027 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:54,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:54,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1487883664, now seen corresponding path program 1 times [2025-03-09 06:53:54,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:54,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024530513] [2025-03-09 06:53:54,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:53:54,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:54,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 06:53:54,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 06:53:54,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:54,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:54,044 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:54,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 06:53:54,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 06:53:54,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:54,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:54,059 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:54,158 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-09 06:53:54,247 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:53:54,248 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:53:54,248 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:53:54,248 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:53:54,248 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:53:54,248 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:54,248 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:53:54,248 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:53:54,248 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration4_Lasso [2025-03-09 06:53:54,248 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:53:54,248 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:53:54,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:54,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:54,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:54,254 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:54,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:54,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:54,258 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:54,260 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:54,262 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:54,349 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:54,351 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:54,352 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:54,355 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:54,356 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:54,357 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:54,502 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:53:54,503 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:53:54,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:54,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:54,505 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-09 06:53:54,506 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-09 06:53:54,508 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:53:54,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:54,519 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:54,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:54,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:54,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:54,519 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:54,520 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:54,521 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:54,526 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-09 06:53:54,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:54,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:54,528 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-09 06:53:54,528 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-09 06:53:54,529 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-09 06:53:54,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:54,539 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:54,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:54,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:54,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:54,539 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:54,540 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:54,541 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:54,546 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-09 06:53:54,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:54,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:54,548 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-09 06:53:54,549 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-09 06:53:54,550 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-09 06:53:54,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:54,559 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:54,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:54,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:54,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:54,562 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:54,562 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:54,564 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:54,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-03-09 06:53:54,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:54,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:54,572 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-09 06:53:54,573 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-09 06:53:54,575 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-09 06:53:54,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:54,585 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:54,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:54,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:54,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:54,586 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:54,586 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:54,587 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:54,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:54,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:54,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:54,596 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-09 06:53:54,597 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-09 06:53:54,598 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-09 06:53:54,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:54,608 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:54,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:54,608 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:54,608 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:54,609 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:54,609 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:54,610 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:54,615 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-09 06:53:54,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:54,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:54,617 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-09 06:53:54,618 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-09 06:53:54,619 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-09 06:53:54,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:54,629 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:54,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:54,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:54,629 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:54,629 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:54,629 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:54,630 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:54,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-03-09 06:53:54,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:54,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:54,637 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-09 06:53:54,638 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-09 06:53:54,641 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-09 06:53:54,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:54,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:54,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:54,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:54,652 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:54,652 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:54,654 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:54,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-03-09 06:53:54,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:54,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:54,662 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-09 06:53:54,663 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-09 06:53:54,665 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-09 06:53:54,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:54,675 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:54,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:54,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:54,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:54,675 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:54,675 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:54,676 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:54,681 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-09 06:53:54,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:54,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:54,683 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-09 06:53:54,684 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-09 06:53:54,685 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-09 06:53:54,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:54,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:54,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:54,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:54,699 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:54,699 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:54,705 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:53:54,717 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-03-09 06:53:54,717 INFO L444 ModelExtractionUtils]: 3 out of 19 variables were initially zero. Simplification set additionally 13 variables to zero. [2025-03-09 06:53:54,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:54,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:54,719 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-09 06:53:54,721 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-09 06:53:54,722 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:53:54,733 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:53:54,733 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:53:54,733 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length~0#1, ULTIMATE.start_main_~j~0#1) = 1*ULTIMATE.start_main_~length~0#1 - 1*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2025-03-09 06:53:54,739 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-09 06:53:54,744 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2025-03-09 06:53:54,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:54,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:53:54,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:53:54,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:54,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:54,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:53:54,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:54,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:53:54,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:53:54,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:54,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:54,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:53:54,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:54,802 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-09 06:53:54,803 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-09 06:53:54,803 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:54,822 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 18 states and 24 transitions. Complement of second has 4 states. [2025-03-09 06:53:54,823 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-09 06:53:54,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:54,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2025-03-09 06:53:54,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 9 letters. Loop has 4 letters. [2025-03-09 06:53:54,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:54,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 13 letters. Loop has 4 letters. [2025-03-09 06:53:54,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:54,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 9 letters. Loop has 8 letters. [2025-03-09 06:53:54,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:54,824 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 24 transitions. [2025-03-09 06:53:54,825 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:53:54,825 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 17 states and 23 transitions. [2025-03-09 06:53:54,825 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-09 06:53:54,825 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-09 06:53:54,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2025-03-09 06:53:54,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:53:54,825 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 23 transitions. [2025-03-09 06:53:54,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2025-03-09 06:53:54,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2025-03-09 06:53:54,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:54,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2025-03-09 06:53:54,826 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 22 transitions. [2025-03-09 06:53:54,826 INFO L432 stractBuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2025-03-09 06:53:54,826 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-09 06:53:54,826 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2025-03-09 06:53:54,829 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:53:54,829 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:53:54,829 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:53:54,829 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:53:54,829 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:53:54,830 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" [2025-03-09 06:53:54,830 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem6#1 > 0;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" [2025-03-09 06:53:54,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:54,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1286378614, now seen corresponding path program 1 times [2025-03-09 06:53:54,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:54,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317470661] [2025-03-09 06:53:54,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:53:54,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:54,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 06:53:54,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 06:53:54,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:54,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:54,841 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:54,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 06:53:54,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 06:53:54,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:54,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:54,855 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:54,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:54,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 1 times [2025-03-09 06:53:54,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:54,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690361914] [2025-03-09 06:53:54,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:53:54,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:54,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:53:54,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:53:54,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:54,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:54,859 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:54,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:53:54,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:53:54,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:54,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:54,866 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:54,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:54,867 INFO L85 PathProgramCache]: Analyzing trace with hash -740732907, now seen corresponding path program 1 times [2025-03-09 06:53:54,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:54,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981377874] [2025-03-09 06:53:54,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:53:54,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:54,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:53:54,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:53:54,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:54,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:54,885 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:54,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:53:54,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:53:54,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:54,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:54,899 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:54,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:55,087 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:53:55,087 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:53:55,087 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:53:55,087 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:53:55,087 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:53:55,087 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:55,087 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:53:55,087 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:53:55,087 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration5_Lasso [2025-03-09 06:53:55,087 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:53:55,087 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:53:55,089 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:55,095 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:55,097 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:55,099 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:55,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:55,102 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:55,104 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:55,105 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:55,107 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:55,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:55,110 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:55,112 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:55,114 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:55,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:55,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:55,204 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:55,352 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:53:55,352 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:53:55,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:55,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:55,356 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-09 06:53:55,358 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-09 06:53:55,360 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-09 06:53:55,370 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:55,370 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:55,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:55,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:55,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:55,371 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:55,371 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:55,373 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:55,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:55,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:55,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:55,381 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-09 06:53:55,382 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-09 06:53:55,385 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-09 06:53:55,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:55,394 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:55,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:55,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:55,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:55,396 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:55,396 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:55,397 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:55,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:55,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:55,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:55,404 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-09 06:53:55,405 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-09 06:53:55,406 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-09 06:53:55,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:55,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:55,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:55,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:55,417 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:55,417 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:55,419 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:55,425 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-09 06:53:55,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:55,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:55,427 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-09 06:53:55,429 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-09 06:53:55,430 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-09 06:53:55,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:55,439 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:55,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:55,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:55,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:55,440 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:55,440 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:55,441 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:55,446 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-09 06:53:55,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:55,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:55,448 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-09 06:53:55,449 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-09 06:53:55,449 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-09 06:53:55,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:55,460 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:55,460 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:55,460 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:55,460 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:55,460 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:55,460 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:55,461 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:55,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-03-09 06:53:55,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:55,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:55,469 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-09 06:53:55,471 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-09 06:53:55,473 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-09 06:53:55,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:55,483 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:55,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:55,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:55,484 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:55,484 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:55,484 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:55,485 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:55,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:55,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:55,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:55,495 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-09 06:53:55,496 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-09 06:53:55,498 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-09 06:53:55,508 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:55,508 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:55,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:55,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:55,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:55,509 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:55,509 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:55,510 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:55,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-03-09 06:53:55,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:55,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:55,518 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-09 06:53:55,518 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-09 06:53:55,520 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-09 06:53:55,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:55,529 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:55,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:55,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:55,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:55,530 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:55,530 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:55,531 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:55,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-03-09 06:53:55,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:55,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:55,539 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-09 06:53:55,540 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-09 06:53:55,542 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-09 06:53:55,552 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:55,552 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:55,552 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:55,552 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:55,552 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:55,553 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:55,553 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:55,554 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:55,559 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-09 06:53:55,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:55,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:55,561 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-09 06:53:55,562 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-09 06:53:55,563 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-09 06:53:55,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:55,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:55,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:55,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:55,573 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:55,573 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:55,576 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:55,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-03-09 06:53:55,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:55,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:55,583 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:53:55,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-03-09 06:53:55,586 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-09 06:53:55,596 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:55,596 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:55,596 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:55,596 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:55,596 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:55,597 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:55,597 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:55,598 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:55,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-03-09 06:53:55,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:55,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:55,606 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-09 06:53:55,607 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-09 06:53:55,609 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-09 06:53:55,618 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:55,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:55,618 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:55,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:55,619 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:55,619 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:55,622 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:55,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-03-09 06:53:55,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:55,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:55,630 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-09 06:53:55,631 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-09 06:53:55,633 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-09 06:53:55,644 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:55,644 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:55,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:55,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:55,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:55,645 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:55,645 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:55,649 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:55,656 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-09 06:53:55,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:55,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:55,658 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-09 06:53:55,659 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-09 06:53:55,661 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-09 06:53:55,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:55,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:55,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:55,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:55,673 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:55,674 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:55,678 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:53:55,690 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-03-09 06:53:55,690 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-03-09 06:53:55,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:55,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:55,692 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-09 06:53:55,693 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-09 06:53:55,694 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:53:55,704 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:53:55,704 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:53:55,704 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) ULTIMATE.start_main_~arr~0#1.offset)_2) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) ULTIMATE.start_main_~arr~0#1.offset)_2 Supporting invariants [] [2025-03-09 06:53:55,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-03-09 06:53:55,719 INFO L156 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2025-03-09 06:53:55,720 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-09 06:53:55,721 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-09 06:53:55,721 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2025-03-09 06:53:55,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:55,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 06:53:55,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 06:53:55,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:55,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:55,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:53:55,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:55,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:53:55,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:53:55,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:55,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:55,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:53:55,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:55,793 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-09 06:53:55,794 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2025-03-09 06:53:55,794 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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-09 06:53:55,830 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-09 06:53:55,842 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 22 transitions. cyclomatic complexity: 9. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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 25 states and 33 transitions. Complement of second has 8 states. [2025-03-09 06:53:55,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-09 06:53:55,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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-09 06:53:55,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2025-03-09 06:53:55,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 10 letters. Loop has 2 letters. [2025-03-09 06:53:55,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:55,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 12 letters. Loop has 2 letters. [2025-03-09 06:53:55,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:55,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 10 letters. Loop has 4 letters. [2025-03-09 06:53:55,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:55,845 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 33 transitions. [2025-03-09 06:53:55,845 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:53:55,845 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 20 states and 26 transitions. [2025-03-09 06:53:55,845 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-09 06:53:55,845 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-09 06:53:55,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2025-03-09 06:53:55,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:53:55,845 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 26 transitions. [2025-03-09 06:53:55,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2025-03-09 06:53:55,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2025-03-09 06:53:55,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:55,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2025-03-09 06:53:55,846 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 25 transitions. [2025-03-09 06:53:55,846 INFO L432 stractBuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2025-03-09 06:53:55,846 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-09 06:53:55,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2025-03-09 06:53:55,847 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:53:55,847 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:53:55,847 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:53:55,847 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:53:55,847 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:53:55,847 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-03-09 06:53:55,847 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem6#1 > 0;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" [2025-03-09 06:53:55,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:55,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1120246683, now seen corresponding path program 2 times [2025-03-09 06:53:55,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:55,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693801452] [2025-03-09 06:53:55,850 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:53:55,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:55,855 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-09 06:53:55,864 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:53:55,864 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:53:55,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:55,915 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-09 06:53:55,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:53:55,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693801452] [2025-03-09 06:53:55,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693801452] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:53:55,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805768372] [2025-03-09 06:53:55,916 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:53:55,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:53:55,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:55,918 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:53:55,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-03-09 06:53:55,948 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-09 06:53:55,955 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:53:55,955 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:53:55,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:55,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 06:53:55,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:55,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:53:55,994 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:53:56,021 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:53:56,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805768372] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:53:56,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:53:56,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-09 06:53:56,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431196137] [2025-03-09 06:53:56,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:53:56,022 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:53:56,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:56,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 2 times [2025-03-09 06:53:56,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:56,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134862679] [2025-03-09 06:53:56,022 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:53:56,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:56,024 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:53:56,026 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:53:56,026 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:53:56,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:56,026 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:56,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:53:56,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:53:56,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:56,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:56,028 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:56,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:53:56,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 06:53:56,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-09 06:53:56,059 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. cyclomatic complexity: 10 Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 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-09 06:53:56,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:53:56,097 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2025-03-09 06:53:56,097 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2025-03-09 06:53:56,098 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:53:56,098 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 24 states and 32 transitions. [2025-03-09 06:53:56,098 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-09 06:53:56,098 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-09 06:53:56,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 32 transitions. [2025-03-09 06:53:56,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:53:56,098 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 32 transitions. [2025-03-09 06:53:56,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 32 transitions. [2025-03-09 06:53:56,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2025-03-09 06:53:56,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 21 states have internal predecessors, (29), 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-09 06:53:56,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2025-03-09 06:53:56,099 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 29 transitions. [2025-03-09 06:53:56,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:53:56,101 INFO L432 stractBuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2025-03-09 06:53:56,101 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-09 06:53:56,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 29 transitions. [2025-03-09 06:53:56,102 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:53:56,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:53:56,102 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:53:56,102 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:53:56,102 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:53:56,102 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-03-09 06:53:56,102 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem6#1 > 0;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" [2025-03-09 06:53:56,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:56,102 INFO L85 PathProgramCache]: Analyzing trace with hash 519071931, now seen corresponding path program 3 times [2025-03-09 06:53:56,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:56,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995214325] [2025-03-09 06:53:56,103 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:53:56,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:56,108 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 3 equivalence classes. [2025-03-09 06:53:56,119 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 06:53:56,121 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-09 06:53:56,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:56,121 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:56,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 06:53:56,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 06:53:56,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:56,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:56,130 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:56,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:56,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 3 times [2025-03-09 06:53:56,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:56,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195816131] [2025-03-09 06:53:56,131 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:53:56,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:56,133 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:53:56,134 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:53:56,134 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 06:53:56,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:56,134 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:56,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:53:56,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:53:56,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:56,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:56,136 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:56,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:56,136 INFO L85 PathProgramCache]: Analyzing trace with hash 611919642, now seen corresponding path program 1 times [2025-03-09 06:53:56,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:56,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442716349] [2025-03-09 06:53:56,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:53:56,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:56,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 06:53:56,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 06:53:56,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:56,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:56,154 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:56,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 06:53:56,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 06:53:56,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:56,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:56,168 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:56,404 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:53:56,404 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:53:56,404 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:53:56,404 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:53:56,404 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:53:56,404 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:56,404 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:53:56,404 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:53:56,405 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration7_Lasso [2025-03-09 06:53:56,405 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:53:56,405 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:53:56,406 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:56,407 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:56,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:56,505 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:56,507 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:56,508 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:56,510 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:56,511 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:56,512 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:56,516 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:56,518 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:56,520 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:56,521 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:56,522 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:56,523 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:56,525 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:56,683 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:53:56,683 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:53:56,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:56,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:56,688 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-09 06:53:56,688 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-09 06:53:56,689 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-09 06:53:56,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:56,699 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:56,699 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:56,699 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:56,699 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:56,700 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:56,700 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:56,701 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:56,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-03-09 06:53:56,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:56,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:56,709 INFO L229 MonitoredProcess]: Starting monitored process 33 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-09 06:53:56,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-03-09 06:53:56,712 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-09 06:53:56,721 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:56,721 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:56,721 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:56,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:56,721 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:56,722 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:56,722 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:56,723 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:56,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-03-09 06:53:56,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:56,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:56,731 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-09 06:53:56,732 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-09 06:53:56,733 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-09 06:53:56,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:56,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:56,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:56,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:56,745 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:56,745 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:56,751 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:53:56,761 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-03-09 06:53:56,761 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-03-09 06:53:56,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:56,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:56,763 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-09 06:53:56,764 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-09 06:53:56,765 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:53:56,775 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:53:56,775 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:53:56,775 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 4))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 4))_1 Supporting invariants [] [2025-03-09 06:53:56,781 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-09 06:53:56,789 INFO L156 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2025-03-09 06:53:56,790 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-09 06:53:56,790 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-09 06:53:56,790 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2025-03-09 06:53:56,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:56,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 06:53:56,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 06:53:56,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:56,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:56,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 06:53:56,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:56,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:53:56,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:53:56,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:56,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:56,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:53:56,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:56,892 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-09 06:53:56,892 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2025-03-09 06:53:56,893 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 29 transitions. cyclomatic complexity: 11 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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-09 06:53:56,910 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 29 transitions. cyclomatic complexity: 11. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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 23 states and 31 transitions. Complement of second has 4 states. [2025-03-09 06:53:56,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-09 06:53:56,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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-09 06:53:56,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2025-03-09 06:53:56,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 17 letters. Loop has 2 letters. [2025-03-09 06:53:56,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:56,911 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:53:56,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:56,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 06:53:56,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 06:53:56,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:56,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:56,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 06:53:56,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:56,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:53:56,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:53:56,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:56,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:56,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:53:56,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:56,998 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-09 06:53:56,999 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 2 loop predicates [2025-03-09 06:53:56,999 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 29 transitions. cyclomatic complexity: 11 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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-09 06:53:57,014 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 29 transitions. cyclomatic complexity: 11. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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 23 states and 31 transitions. Complement of second has 4 states. [2025-03-09 06:53:57,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-09 06:53:57,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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-09 06:53:57,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2025-03-09 06:53:57,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 17 letters. Loop has 2 letters. [2025-03-09 06:53:57,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:57,015 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:53:57,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:57,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 06:53:57,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 06:53:57,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:57,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:57,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 06:53:57,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:57,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:53:57,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:53:57,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:57,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:57,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:53:57,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:57,101 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-09 06:53:57,101 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2025-03-09 06:53:57,101 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 29 transitions. cyclomatic complexity: 11 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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-09 06:53:57,159 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 29 transitions. cyclomatic complexity: 11. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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 37 states and 48 transitions. Complement of second has 10 states. [2025-03-09 06:53:57,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 3 stem states 2 non-accepting loop states 2 accepting loop states [2025-03-09 06:53:57,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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-09 06:53:57,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2025-03-09 06:53:57,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 32 transitions. Stem has 17 letters. Loop has 2 letters. [2025-03-09 06:53:57,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:57,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 32 transitions. Stem has 19 letters. Loop has 2 letters. [2025-03-09 06:53:57,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:57,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 32 transitions. Stem has 17 letters. Loop has 4 letters. [2025-03-09 06:53:57,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:57,161 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 48 transitions. [2025-03-09 06:53:57,162 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:53:57,162 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 32 states and 41 transitions. [2025-03-09 06:53:57,162 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-09 06:53:57,162 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-09 06:53:57,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 41 transitions. [2025-03-09 06:53:57,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:53:57,162 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 41 transitions. [2025-03-09 06:53:57,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 41 transitions. [2025-03-09 06:53:57,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2025-03-09 06:53:57,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 26 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-09 06:53:57,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2025-03-09 06:53:57,166 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 35 transitions. [2025-03-09 06:53:57,166 INFO L432 stractBuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2025-03-09 06:53:57,166 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-09 06:53:57,166 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 35 transitions. [2025-03-09 06:53:57,167 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:53:57,167 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:53:57,167 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:53:57,167 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 06:53:57,167 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:53:57,167 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-03-09 06:53:57,168 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem6#1 > 0;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" [2025-03-09 06:53:57,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:57,168 INFO L85 PathProgramCache]: Analyzing trace with hash -355744416, now seen corresponding path program 4 times [2025-03-09 06:53:57,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:57,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021924749] [2025-03-09 06:53:57,168 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:53:57,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:57,176 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-03-09 06:53:57,182 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 20 of 21 statements. [2025-03-09 06:53:57,182 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 06:53:57,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:57,263 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:53:57,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:53:57,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021924749] [2025-03-09 06:53:57,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021924749] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:53:57,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186875925] [2025-03-09 06:53:57,264 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:53:57,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:53:57,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:57,266 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:53:57,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2025-03-09 06:53:57,296 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-03-09 06:53:57,302 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 20 of 21 statements. [2025-03-09 06:53:57,303 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 06:53:57,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:57,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 06:53:57,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:57,371 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:53:57,371 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:53:57,407 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:53:57,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186875925] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:53:57,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:53:57,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-09 06:53:57,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159685080] [2025-03-09 06:53:57,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:53:57,408 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:53:57,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:57,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 4 times [2025-03-09 06:53:57,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:57,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44378532] [2025-03-09 06:53:57,408 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:53:57,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:57,412 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-03-09 06:53:57,414 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:53:57,414 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:53:57,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:57,414 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:57,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:53:57,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:53:57,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:57,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:57,416 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:57,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:53:57,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 06:53:57,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-03-09 06:53:57,439 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. cyclomatic complexity: 13 Second operand has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 13 states have internal predecessors, (40), 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-09 06:53:57,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:53:57,491 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2025-03-09 06:53:57,491 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 55 transitions. [2025-03-09 06:53:57,492 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:53:57,492 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 32 states and 42 transitions. [2025-03-09 06:53:57,492 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-09 06:53:57,492 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-09 06:53:57,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 42 transitions. [2025-03-09 06:53:57,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:53:57,492 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 42 transitions. [2025-03-09 06:53:57,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 42 transitions. [2025-03-09 06:53:57,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2025-03-09 06:53:57,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.3) internal successors, (39), 29 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-09 06:53:57,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2025-03-09 06:53:57,494 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 39 transitions. [2025-03-09 06:53:57,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 06:53:57,494 INFO L432 stractBuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2025-03-09 06:53:57,494 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-09 06:53:57,494 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 39 transitions. [2025-03-09 06:53:57,495 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:53:57,495 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:53:57,495 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:53:57,495 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 06:53:57,495 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:53:57,495 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-03-09 06:53:57,495 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem6#1 > 0;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" [2025-03-09 06:53:57,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:57,495 INFO L85 PathProgramCache]: Analyzing trace with hash 947254336, now seen corresponding path program 5 times [2025-03-09 06:53:57,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:57,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772262350] [2025-03-09 06:53:57,495 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:53:57,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:57,500 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 24 statements into 4 equivalence classes. [2025-03-09 06:53:57,506 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 06:53:57,506 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-09 06:53:57,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:57,506 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:57,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 06:53:57,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 06:53:57,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:57,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:57,518 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:57,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:57,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 5 times [2025-03-09 06:53:57,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:57,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278439094] [2025-03-09 06:53:57,519 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:53:57,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:57,521 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:53:57,522 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:53:57,522 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:53:57,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:57,522 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:57,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:53:57,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:53:57,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:57,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:57,524 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:57,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:57,524 INFO L85 PathProgramCache]: Analyzing trace with hash -221649569, now seen corresponding path program 2 times [2025-03-09 06:53:57,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:57,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336484447] [2025-03-09 06:53:57,524 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:53:57,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:57,528 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-09 06:53:57,536 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 06:53:57,537 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:53:57,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:57,537 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:57,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 06:53:57,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 06:53:57,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:57,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:57,550 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:57,911 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:53:57,911 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:53:57,911 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:53:57,911 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:53:57,911 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:53:57,911 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:57,911 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:53:57,911 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:53:57,911 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration9_Lasso [2025-03-09 06:53:57,911 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:53:57,911 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:53:57,913 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:57,914 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:57,917 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:57,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:57,920 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:57,921 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:57,923 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:57,925 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:57,927 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:57,928 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:57,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:57,930 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:57,931 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:57,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:58,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:58,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:58,261 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:53:58,261 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:53:58,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:58,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:58,263 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-09 06:53:58,264 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-09 06:53:58,265 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-09 06:53:58,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:58,275 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:58,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:58,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:58,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:58,276 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:58,276 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:58,276 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:58,282 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-09 06:53:58,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:58,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:58,283 INFO L229 MonitoredProcess]: Starting monitored process 38 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-09 06:53:58,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-03-09 06:53:58,287 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-09 06:53:58,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:58,296 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:58,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:58,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:58,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:58,296 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:58,296 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:58,297 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:58,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:58,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:58,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:58,304 INFO L229 MonitoredProcess]: Starting monitored process 39 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-09 06:53:58,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-03-09 06:53:58,306 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-09 06:53:58,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:58,316 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:58,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:58,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:58,316 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:58,316 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:58,316 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:58,317 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:58,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:58,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:58,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:58,324 INFO L229 MonitoredProcess]: Starting monitored process 40 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-09 06:53:58,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-03-09 06:53:58,326 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-09 06:53:58,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:58,336 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:58,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:58,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:58,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:58,337 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:58,337 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:58,337 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:58,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:58,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:58,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:58,345 INFO L229 MonitoredProcess]: Starting monitored process 41 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-09 06:53:58,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-03-09 06:53:58,348 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-09 06:53:58,357 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:58,357 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:58,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:58,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:58,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:58,357 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:58,357 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:58,358 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:58,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:58,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:58,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:58,365 INFO L229 MonitoredProcess]: Starting monitored process 42 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-09 06:53:58,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-03-09 06:53:58,366 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-09 06:53:58,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:58,376 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:58,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:58,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:58,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:58,376 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:58,376 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:58,377 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:58,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-03-09 06:53:58,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:58,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:58,384 INFO L229 MonitoredProcess]: Starting monitored process 43 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-09 06:53:58,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-03-09 06:53:58,386 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-09 06:53:58,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:58,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:58,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:58,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:58,396 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:58,396 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:58,398 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:58,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-03-09 06:53:58,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:58,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:58,405 INFO L229 MonitoredProcess]: Starting monitored process 44 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-09 06:53:58,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-03-09 06:53:58,407 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-09 06:53:58,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:58,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:58,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:58,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:58,418 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:58,418 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:58,420 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:58,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2025-03-09 06:53:58,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:58,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:58,428 INFO L229 MonitoredProcess]: Starting monitored process 45 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-09 06:53:58,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-03-09 06:53:58,429 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-09 06:53:58,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:58,439 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:58,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:58,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:58,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:58,440 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:58,440 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:58,441 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:58,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-03-09 06:53:58,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:58,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:58,447 INFO L229 MonitoredProcess]: Starting monitored process 46 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-09 06:53:58,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-03-09 06:53:58,449 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-09 06:53:58,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:58,458 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:58,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:58,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:58,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:58,459 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:58,459 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:58,460 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:58,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:58,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:58,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:58,466 INFO L229 MonitoredProcess]: Starting monitored process 47 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-09 06:53:58,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-03-09 06:53:58,468 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-09 06:53:58,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:58,478 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:58,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:58,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:58,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:58,478 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:58,478 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:58,479 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:58,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2025-03-09 06:53:58,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:58,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:58,486 INFO L229 MonitoredProcess]: Starting monitored process 48 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-09 06:53:58,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-03-09 06:53:58,487 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-09 06:53:58,496 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:58,496 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:53:58,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:58,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:58,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:58,497 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:53:58,497 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:53:58,498 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:58,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2025-03-09 06:53:58,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:58,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:58,504 INFO L229 MonitoredProcess]: Starting monitored process 49 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-09 06:53:58,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-03-09 06:53:58,506 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-09 06:53:58,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:58,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:58,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:58,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:58,519 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:58,519 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:58,525 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:58,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-03-09 06:53:58,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:58,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:58,532 INFO L229 MonitoredProcess]: Starting monitored process 50 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-09 06:53:58,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-03-09 06:53:58,534 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-09 06:53:58,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:58,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:58,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:58,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:58,545 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:58,545 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:58,548 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:58,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2025-03-09 06:53:58,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:58,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:58,556 INFO L229 MonitoredProcess]: Starting monitored process 51 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-09 06:53:58,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-03-09 06:53:58,557 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-09 06:53:58,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:58,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:58,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:58,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:58,568 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:58,568 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:58,570 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:53:58,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-03-09 06:53:58,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:58,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:58,577 INFO L229 MonitoredProcess]: Starting monitored process 52 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-09 06:53:58,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-03-09 06:53:58,579 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-09 06:53:58,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:53:58,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:53:58,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:53:58,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:53:58,590 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:53:58,590 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:53:58,594 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:53:58,602 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-03-09 06:53:58,602 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-03-09 06:53:58,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:58,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:58,604 INFO L229 MonitoredProcess]: Starting monitored process 53 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-09 06:53:58,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-03-09 06:53:58,607 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:53:58,617 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:53:58,617 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:53:58,617 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 8))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 8))_1 Supporting invariants [] [2025-03-09 06:53:58,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2025-03-09 06:53:58,635 INFO L156 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2025-03-09 06:53:58,637 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-09 06:53:58,637 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-09 06:53:58,637 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2025-03-09 06:53:58,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:58,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 06:53:58,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 06:53:58,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:58,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:58,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 06:53:58,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:58,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:53:58,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:53:58,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:58,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:58,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:53:58,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:58,729 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-09 06:53:58,729 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2025-03-09 06:53:58,729 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 39 transitions. cyclomatic complexity: 14 Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:58,749 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 39 transitions. cyclomatic complexity: 14. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 31 states and 41 transitions. Complement of second has 4 states. [2025-03-09 06:53:58,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-09 06:53:58,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:58,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2025-03-09 06:53:58,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 24 letters. Loop has 2 letters. [2025-03-09 06:53:58,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:58,750 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:53:58,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:58,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 06:53:58,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 06:53:58,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:58,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:58,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 06:53:58,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:58,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:53:58,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:53:58,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:58,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:58,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:53:58,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:58,846 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-09 06:53:58,846 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 2 loop predicates [2025-03-09 06:53:58,847 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 39 transitions. cyclomatic complexity: 14 Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:58,863 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 39 transitions. cyclomatic complexity: 14. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 31 states and 41 transitions. Complement of second has 4 states. [2025-03-09 06:53:58,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-09 06:53:58,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:58,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2025-03-09 06:53:58,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 24 letters. Loop has 2 letters. [2025-03-09 06:53:58,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:58,864 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:53:58,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:58,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 06:53:58,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 06:53:58,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:58,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:58,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 06:53:58,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:58,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:53:58,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:53:58,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:58,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:58,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:53:58,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:58,952 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-09 06:53:58,953 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2025-03-09 06:53:58,953 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 39 transitions. cyclomatic complexity: 14 Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:59,010 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 39 transitions. cyclomatic complexity: 14. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 46 states and 60 transitions. Complement of second has 12 states. [2025-03-09 06:53:59,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2025-03-09 06:53:59,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:53:59,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 38 transitions. [2025-03-09 06:53:59,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 38 transitions. Stem has 24 letters. Loop has 2 letters. [2025-03-09 06:53:59,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:59,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 38 transitions. Stem has 26 letters. Loop has 2 letters. [2025-03-09 06:53:59,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:59,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 38 transitions. Stem has 24 letters. Loop has 4 letters. [2025-03-09 06:53:59,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:53:59,011 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 60 transitions. [2025-03-09 06:53:59,012 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:53:59,012 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 41 states and 53 transitions. [2025-03-09 06:53:59,012 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-09 06:53:59,012 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-09 06:53:59,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 53 transitions. [2025-03-09 06:53:59,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:53:59,012 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 53 transitions. [2025-03-09 06:53:59,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 53 transitions. [2025-03-09 06:53:59,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2025-03-09 06:53:59,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 34 states have internal predecessors, (45), 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-09 06:53:59,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2025-03-09 06:53:59,014 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35 states and 45 transitions. [2025-03-09 06:53:59,014 INFO L432 stractBuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2025-03-09 06:53:59,014 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-09 06:53:59,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 45 transitions. [2025-03-09 06:53:59,014 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:53:59,014 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:53:59,015 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:53:59,015 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-03-09 06:53:59,015 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:53:59,015 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-03-09 06:53:59,015 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem6#1 > 0;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" [2025-03-09 06:53:59,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:59,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1743128165, now seen corresponding path program 6 times [2025-03-09 06:53:59,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:59,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469144440] [2025-03-09 06:53:59,016 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:53:59,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:59,020 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 4 equivalence classes. [2025-03-09 06:53:59,026 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 06:53:59,026 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-03-09 06:53:59,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:59,135 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:53:59,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:53:59,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469144440] [2025-03-09 06:53:59,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469144440] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:53:59,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771739009] [2025-03-09 06:53:59,136 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:53:59,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:53:59,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:53:59,140 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:53:59,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2025-03-09 06:53:59,169 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 4 equivalence classes. [2025-03-09 06:53:59,180 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 06:53:59,180 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-03-09 06:53:59,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:53:59,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 06:53:59,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:53:59,273 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:53:59,274 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:53:59,325 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:53:59,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [771739009] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:53:59,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:53:59,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-09 06:53:59,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239104372] [2025-03-09 06:53:59,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:53:59,325 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:53:59,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:59,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 6 times [2025-03-09 06:53:59,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:59,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816483044] [2025-03-09 06:53:59,326 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:53:59,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:59,328 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:53:59,329 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:53:59,329 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-09 06:53:59,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:59,329 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:59,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:53:59,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:53:59,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:59,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:59,331 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:59,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:53:59,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 06:53:59,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2025-03-09 06:53:59,356 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. cyclomatic complexity: 16 Second operand has 16 states, 15 states have (on average 3.4) internal successors, (51), 16 states have internal predecessors, (51), 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-09 06:53:59,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:53:59,423 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2025-03-09 06:53:59,423 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 71 transitions. [2025-03-09 06:53:59,423 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:53:59,424 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 40 states and 52 transitions. [2025-03-09 06:53:59,424 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-09 06:53:59,424 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-09 06:53:59,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 52 transitions. [2025-03-09 06:53:59,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:53:59,424 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 52 transitions. [2025-03-09 06:53:59,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 52 transitions. [2025-03-09 06:53:59,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2025-03-09 06:53:59,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 37 states have internal predecessors, (49), 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-09 06:53:59,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2025-03-09 06:53:59,425 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 49 transitions. [2025-03-09 06:53:59,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 06:53:59,427 INFO L432 stractBuchiCegarLoop]: Abstraction has 38 states and 49 transitions. [2025-03-09 06:53:59,427 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-09 06:53:59,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 49 transitions. [2025-03-09 06:53:59,427 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:53:59,427 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:53:59,427 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:53:59,428 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-03-09 06:53:59,428 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:53:59,428 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-03-09 06:53:59,428 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem6#1 > 0;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" [2025-03-09 06:53:59,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:59,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1575789691, now seen corresponding path program 7 times [2025-03-09 06:53:59,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:59,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921968098] [2025-03-09 06:53:59,428 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 06:53:59,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:59,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 06:53:59,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 06:53:59,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:59,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:59,445 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:59,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 06:53:59,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-03-09 06:53:59,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 06:53:59,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:59,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:59,480 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:59,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:59,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 7 times [2025-03-09 06:53:59,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:59,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458341281] [2025-03-09 06:53:59,482 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 06:53:59,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:59,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:53:59,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:53:59,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:59,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:59,486 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:59,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:53:59,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:53:59,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:59,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:59,491 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:59,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:53:59,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1789562724, now seen corresponding path program 3 times [2025-03-09 06:53:59,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:53:59,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728708802] [2025-03-09 06:53:59,492 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:53:59,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:53:59,497 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 5 equivalence classes. [2025-03-09 06:53:59,514 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 06:53:59,514 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-09 06:53:59,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:59,514 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:53:59,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-09 06:53:59,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 06:53:59,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:53:59,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:53:59,529 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:53:59,947 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:53:59,947 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:53:59,947 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:53:59,947 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:53:59,947 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:53:59,947 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:53:59,947 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:53:59,947 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:53:59,947 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration11_Lasso [2025-03-09 06:53:59,947 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:53:59,947 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:53:59,948 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:59,950 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:59,951 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:59,954 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:59,956 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:59,957 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:59,958 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:59,959 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:59,961 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:53:59,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:00,060 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:00,062 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:00,063 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:00,064 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:00,069 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:00,070 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:00,197 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:54:00,197 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:54:00,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:00,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:00,201 INFO L229 MonitoredProcess]: Starting monitored process 55 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-09 06:54:00,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-03-09 06:54:00,204 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:54:00,214 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:00,214 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:00,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:00,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:00,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:00,215 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:00,215 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:00,216 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:00,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2025-03-09 06:54:00,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:00,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:00,223 INFO L229 MonitoredProcess]: Starting monitored process 56 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-09 06:54:00,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-03-09 06:54:00,224 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-09 06:54:00,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:00,234 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:00,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:00,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:00,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:00,235 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:00,235 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:00,236 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:00,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2025-03-09 06:54:00,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:00,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:00,243 INFO L229 MonitoredProcess]: Starting monitored process 57 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-09 06:54:00,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-03-09 06:54:00,245 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-09 06:54:00,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:00,254 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:00,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:00,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:00,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:00,255 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:00,255 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:00,256 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:00,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2025-03-09 06:54:00,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:00,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:00,263 INFO L229 MonitoredProcess]: Starting monitored process 58 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-09 06:54:00,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-03-09 06:54:00,264 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-09 06:54:00,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:00,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:00,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:00,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:00,275 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:00,275 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:00,277 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:00,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2025-03-09 06:54:00,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:00,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:00,284 INFO L229 MonitoredProcess]: Starting monitored process 59 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-09 06:54:00,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-03-09 06:54:00,285 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-09 06:54:00,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:00,295 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:00,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:00,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:00,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:00,295 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:00,295 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:00,296 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:00,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2025-03-09 06:54:00,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:00,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:00,303 INFO L229 MonitoredProcess]: Starting monitored process 60 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-09 06:54:00,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-03-09 06:54:00,305 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:54:00,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:00,314 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:00,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:00,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:00,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:00,315 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:00,315 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:00,316 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:00,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2025-03-09 06:54:00,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:00,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:00,322 INFO L229 MonitoredProcess]: Starting monitored process 61 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-09 06:54:00,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-03-09 06:54:00,324 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-09 06:54:00,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:00,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:00,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:00,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:00,334 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:00,334 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:00,337 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:00,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2025-03-09 06:54:00,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:00,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:00,344 INFO L229 MonitoredProcess]: Starting monitored process 62 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-09 06:54:00,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-03-09 06:54:00,345 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-09 06:54:00,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:00,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:00,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:00,355 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:00,356 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:00,356 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:00,358 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:00,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2025-03-09 06:54:00,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:00,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:00,365 INFO L229 MonitoredProcess]: Starting monitored process 63 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-09 06:54:00,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-03-09 06:54:00,366 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-09 06:54:00,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:00,376 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:00,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:00,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:00,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:00,376 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:00,376 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:00,377 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:00,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2025-03-09 06:54:00,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:00,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:00,384 INFO L229 MonitoredProcess]: Starting monitored process 64 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-09 06:54:00,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-03-09 06:54:00,386 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-09 06:54:00,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:00,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:00,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:00,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:00,397 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:00,397 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:00,400 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:00,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2025-03-09 06:54:00,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:00,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:00,407 INFO L229 MonitoredProcess]: Starting monitored process 65 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-09 06:54:00,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-03-09 06:54:00,408 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-09 06:54:00,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:00,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:00,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:00,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:00,420 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:00,423 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:00,428 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:54:00,441 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-03-09 06:54:00,441 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-03-09 06:54:00,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:00,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:00,443 INFO L229 MonitoredProcess]: Starting monitored process 66 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-09 06:54:00,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-03-09 06:54:00,446 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:54:00,456 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:54:00,457 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:54:00,457 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 12)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 12)_1 Supporting invariants [] [2025-03-09 06:54:00,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2025-03-09 06:54:00,471 INFO L156 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2025-03-09 06:54:00,473 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-09 06:54:00,473 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-09 06:54:00,473 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2025-03-09 06:54:00,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:00,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 06:54:00,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 06:54:00,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:00,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:00,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 06:54:00,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:00,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:00,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:00,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:00,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:00,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:54:00,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:00,629 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-09 06:54:00,629 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2025-03-09 06:54:00,629 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 49 transitions. cyclomatic complexity: 17 Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 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-09 06:54:00,657 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 49 transitions. cyclomatic complexity: 17. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 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 39 states and 51 transitions. Complement of second has 5 states. [2025-03-09 06:54:00,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-09 06:54:00,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 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-09 06:54:00,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2025-03-09 06:54:00,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 31 letters. Loop has 2 letters. [2025-03-09 06:54:00,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:00,658 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:54:00,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:00,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 06:54:00,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 06:54:00,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:00,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:00,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 06:54:00,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:00,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2025-03-09 06:54:00,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:00,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:00,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:00,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:00,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:54:00,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:00,845 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-09 06:54:00,845 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.6 stem predicates 2 loop predicates [2025-03-09 06:54:00,846 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 49 transitions. cyclomatic complexity: 17 Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 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-09 06:54:00,869 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 49 transitions. cyclomatic complexity: 17. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 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 39 states and 51 transitions. Complement of second has 5 states. [2025-03-09 06:54:00,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-09 06:54:00,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 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-09 06:54:00,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2025-03-09 06:54:00,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 31 letters. Loop has 2 letters. [2025-03-09 06:54:00,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:00,871 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:54:00,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:00,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 06:54:00,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 06:54:00,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:00,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:00,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 06:54:00,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:00,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:01,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:01,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:01,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:01,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:54:01,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:01,017 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-09 06:54:01,017 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2025-03-09 06:54:01,017 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 49 transitions. cyclomatic complexity: 17 Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 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-09 06:54:01,094 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 49 transitions. cyclomatic complexity: 17. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 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 55 states and 72 transitions. Complement of second has 15 states. [2025-03-09 06:54:01,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 6 stem states 2 non-accepting loop states 2 accepting loop states [2025-03-09 06:54:01,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 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-09 06:54:01,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 44 transitions. [2025-03-09 06:54:01,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 44 transitions. Stem has 31 letters. Loop has 2 letters. [2025-03-09 06:54:01,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:01,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 44 transitions. Stem has 33 letters. Loop has 2 letters. [2025-03-09 06:54:01,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:01,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 44 transitions. Stem has 31 letters. Loop has 4 letters. [2025-03-09 06:54:01,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:01,096 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 72 transitions. [2025-03-09 06:54:01,097 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:54:01,097 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 50 states and 65 transitions. [2025-03-09 06:54:01,097 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-09 06:54:01,097 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-09 06:54:01,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 65 transitions. [2025-03-09 06:54:01,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:54:01,097 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 65 transitions. [2025-03-09 06:54:01,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 65 transitions. [2025-03-09 06:54:01,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2025-03-09 06:54:01,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 42 states have internal predecessors, (55), 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-09 06:54:01,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2025-03-09 06:54:01,099 INFO L240 hiAutomatonCegarLoop]: Abstraction has 43 states and 55 transitions. [2025-03-09 06:54:01,099 INFO L432 stractBuchiCegarLoop]: Abstraction has 43 states and 55 transitions. [2025-03-09 06:54:01,099 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-03-09 06:54:01,099 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 55 transitions. [2025-03-09 06:54:01,099 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:54:01,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:54:01,100 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:54:01,100 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-03-09 06:54:01,100 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:54:01,100 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-03-09 06:54:01,100 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem6#1 > 0;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" [2025-03-09 06:54:01,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:01,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1782858538, now seen corresponding path program 8 times [2025-03-09 06:54:01,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:01,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109054162] [2025-03-09 06:54:01,101 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:54:01,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:01,104 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-09 06:54:01,108 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-03-09 06:54:01,109 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:54:01,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:01,227 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 15 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:54:01,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:54:01,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109054162] [2025-03-09 06:54:01,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109054162] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:54:01,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410601799] [2025-03-09 06:54:01,228 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:54:01,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:54:01,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:01,229 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:54:01,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2025-03-09 06:54:01,267 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-09 06:54:01,279 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-03-09 06:54:01,279 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:54:01,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:01,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 06:54:01,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:01,387 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 28 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:54:01,387 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:54:01,449 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 28 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:54:01,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410601799] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:54:01,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:54:01,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 18 [2025-03-09 06:54:01,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141715819] [2025-03-09 06:54:01,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:54:01,449 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:54:01,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:01,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 8 times [2025-03-09 06:54:01,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:01,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309395740] [2025-03-09 06:54:01,450 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:54:01,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:01,454 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:01,455 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:01,455 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:54:01,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:01,455 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:54:01,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:01,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:01,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:01,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:01,457 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:54:01,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:54:01,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 06:54:01,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2025-03-09 06:54:01,482 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. cyclomatic complexity: 19 Second operand has 19 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 19 states have internal predecessors, (62), 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-09 06:54:01,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:54:01,546 INFO L93 Difference]: Finished difference Result 69 states and 87 transitions. [2025-03-09 06:54:01,546 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 87 transitions. [2025-03-09 06:54:01,546 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:54:01,547 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 48 states and 62 transitions. [2025-03-09 06:54:01,547 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-09 06:54:01,547 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-09 06:54:01,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 62 transitions. [2025-03-09 06:54:01,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:54:01,547 INFO L218 hiAutomatonCegarLoop]: Abstraction has 48 states and 62 transitions. [2025-03-09 06:54:01,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 62 transitions. [2025-03-09 06:54:01,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2025-03-09 06:54:01,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 45 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:54:01,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 59 transitions. [2025-03-09 06:54:01,548 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 59 transitions. [2025-03-09 06:54:01,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 06:54:01,551 INFO L432 stractBuchiCegarLoop]: Abstraction has 46 states and 59 transitions. [2025-03-09 06:54:01,551 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-03-09 06:54:01,551 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 59 transitions. [2025-03-09 06:54:01,552 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:54:01,552 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:54:01,552 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:54:01,552 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-03-09 06:54:01,552 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:54:01,552 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-03-09 06:54:01,552 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem6#1 > 0;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" [2025-03-09 06:54:01,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:01,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1820136950, now seen corresponding path program 9 times [2025-03-09 06:54:01,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:01,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210799092] [2025-03-09 06:54:01,554 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:54:01,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:01,558 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 6 equivalence classes. [2025-03-09 06:54:01,573 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 06:54:01,574 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-09 06:54:01,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:01,574 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:54:01,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-09 06:54:01,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 06:54:01,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:01,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:01,584 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:54:01,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:01,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 9 times [2025-03-09 06:54:01,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:01,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240125479] [2025-03-09 06:54:01,585 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:54:01,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:01,589 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:01,590 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:01,590 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 06:54:01,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:01,590 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:54:01,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:01,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:01,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:01,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:01,592 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:54:01,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:01,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1099919191, now seen corresponding path program 4 times [2025-03-09 06:54:01,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:01,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429225326] [2025-03-09 06:54:01,592 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:54:01,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:01,598 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-03-09 06:54:01,612 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 06:54:01,615 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:54:01,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:01,616 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:54:01,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-09 06:54:01,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 06:54:01,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:01,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:01,627 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:54:02,319 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:54:02,319 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:54:02,319 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:54:02,319 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:54:02,319 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:54:02,319 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:02,319 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:54:02,319 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:54:02,319 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration13_Lasso [2025-03-09 06:54:02,319 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:54:02,319 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:54:02,320 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:02,322 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:02,324 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:02,325 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:02,327 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:02,328 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:02,329 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:02,331 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:02,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:02,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:02,446 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:02,447 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:02,448 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:02,449 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:02,451 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:02,452 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:02,602 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:54:02,602 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:54:02,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:02,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:02,604 INFO L229 MonitoredProcess]: Starting monitored process 68 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-09 06:54:02,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2025-03-09 06:54:02,606 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-09 06:54:02,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:02,615 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:02,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:02,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:02,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:02,615 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:02,616 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:02,616 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:02,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2025-03-09 06:54:02,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:02,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:02,624 INFO L229 MonitoredProcess]: Starting monitored process 69 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-09 06:54:02,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2025-03-09 06:54:02,625 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-09 06:54:02,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:02,635 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:02,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:02,635 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:02,635 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:02,638 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:02,639 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:02,639 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:02,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2025-03-09 06:54:02,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:02,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:02,647 INFO L229 MonitoredProcess]: Starting monitored process 70 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-09 06:54:02,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2025-03-09 06:54:02,650 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-09 06:54:02,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:02,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:02,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:02,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:02,662 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:02,662 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:02,664 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:02,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2025-03-09 06:54:02,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:02,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:02,671 INFO L229 MonitoredProcess]: Starting monitored process 71 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-09 06:54:02,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2025-03-09 06:54:02,672 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-09 06:54:02,682 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:02,682 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:02,682 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:02,682 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:02,683 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:02,683 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:02,684 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:02,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2025-03-09 06:54:02,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:02,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:02,692 INFO L229 MonitoredProcess]: Starting monitored process 72 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-09 06:54:02,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2025-03-09 06:54:02,694 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-09 06:54:02,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:02,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:02,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:02,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:02,704 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:02,704 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:02,706 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:02,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2025-03-09 06:54:02,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:02,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:02,714 INFO L229 MonitoredProcess]: Starting monitored process 73 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-09 06:54:02,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2025-03-09 06:54:02,715 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-09 06:54:02,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:02,724 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:02,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:02,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:02,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:02,725 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:02,725 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:02,726 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:02,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2025-03-09 06:54:02,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:02,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:02,733 INFO L229 MonitoredProcess]: Starting monitored process 74 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-09 06:54:02,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2025-03-09 06:54:02,734 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-09 06:54:02,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:02,744 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:02,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:02,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:02,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:02,744 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:02,744 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:02,745 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:02,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2025-03-09 06:54:02,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:02,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:02,753 INFO L229 MonitoredProcess]: Starting monitored process 75 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-09 06:54:02,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2025-03-09 06:54:02,755 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-09 06:54:02,765 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:02,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:02,765 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:02,765 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:02,767 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:02,767 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:02,770 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:02,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2025-03-09 06:54:02,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:02,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:02,777 INFO L229 MonitoredProcess]: Starting monitored process 76 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-09 06:54:02,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2025-03-09 06:54:02,779 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-09 06:54:02,788 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:02,788 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:02,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:02,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:02,789 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:02,789 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:02,791 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:02,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2025-03-09 06:54:02,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:02,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:02,798 INFO L229 MonitoredProcess]: Starting monitored process 77 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-09 06:54:02,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2025-03-09 06:54:02,800 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-09 06:54:02,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:02,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:02,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:02,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:02,812 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:02,812 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:02,816 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:54:02,821 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-03-09 06:54:02,821 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-03-09 06:54:02,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:02,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:02,823 INFO L229 MonitoredProcess]: Starting monitored process 78 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-09 06:54:02,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2025-03-09 06:54:02,824 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:54:02,835 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:54:02,835 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:54:02,835 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ 16 ULTIMATE.start_main_~arr~0#1.offset))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ 16 ULTIMATE.start_main_~arr~0#1.offset))_1 Supporting invariants [] [2025-03-09 06:54:02,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2025-03-09 06:54:02,854 INFO L156 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2025-03-09 06:54:02,856 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-09 06:54:02,856 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-09 06:54:02,856 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2025-03-09 06:54:02,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:02,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-09 06:54:02,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 06:54:02,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:02,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:02,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 06:54:02,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:02,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:02,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:02,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:02,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:02,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:54:02,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:02,973 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-09 06:54:02,974 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2025-03-09 06:54:02,974 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 59 transitions. cyclomatic complexity: 20 Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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-09 06:54:02,988 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 59 transitions. cyclomatic complexity: 20. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 47 states and 61 transitions. Complement of second has 4 states. [2025-03-09 06:54:02,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-09 06:54:02,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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-09 06:54:02,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2025-03-09 06:54:02,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 38 letters. Loop has 2 letters. [2025-03-09 06:54:02,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:02,989 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:54:03,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:03,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-09 06:54:03,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 06:54:03,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:03,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:03,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 06:54:03,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:03,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:03,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:03,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:03,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:03,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:54:03,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:03,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2025-03-09 06:54:03,105 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-09 06:54:03,106 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.6 stem predicates 2 loop predicates [2025-03-09 06:54:03,106 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 59 transitions. cyclomatic complexity: 20 Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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-09 06:54:03,119 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 59 transitions. cyclomatic complexity: 20. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 47 states and 61 transitions. Complement of second has 4 states. [2025-03-09 06:54:03,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-09 06:54:03,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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-09 06:54:03,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2025-03-09 06:54:03,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 38 letters. Loop has 2 letters. [2025-03-09 06:54:03,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:03,120 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:54:03,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:03,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-09 06:54:03,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 06:54:03,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:03,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:03,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 06:54:03,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:03,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:03,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:03,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:03,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:03,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:54:03,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:03,251 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-09 06:54:03,251 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2025-03-09 06:54:03,251 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 59 transitions. cyclomatic complexity: 20 Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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-09 06:54:03,329 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 59 transitions. cyclomatic complexity: 20. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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 64 states and 84 transitions. Complement of second has 16 states. [2025-03-09 06:54:03,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 6 stem states 2 non-accepting loop states 2 accepting loop states [2025-03-09 06:54:03,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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-09 06:54:03,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2025-03-09 06:54:03,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 50 transitions. Stem has 38 letters. Loop has 2 letters. [2025-03-09 06:54:03,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:03,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 50 transitions. Stem has 40 letters. Loop has 2 letters. [2025-03-09 06:54:03,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:03,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 50 transitions. Stem has 38 letters. Loop has 4 letters. [2025-03-09 06:54:03,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:03,330 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 84 transitions. [2025-03-09 06:54:03,331 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:54:03,331 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 59 states and 77 transitions. [2025-03-09 06:54:03,331 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-09 06:54:03,331 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-09 06:54:03,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 77 transitions. [2025-03-09 06:54:03,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:54:03,332 INFO L218 hiAutomatonCegarLoop]: Abstraction has 59 states and 77 transitions. [2025-03-09 06:54:03,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 77 transitions. [2025-03-09 06:54:03,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 51. [2025-03-09 06:54:03,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 50 states have internal predecessors, (65), 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-09 06:54:03,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2025-03-09 06:54:03,333 INFO L240 hiAutomatonCegarLoop]: Abstraction has 51 states and 65 transitions. [2025-03-09 06:54:03,333 INFO L432 stractBuchiCegarLoop]: Abstraction has 51 states and 65 transitions. [2025-03-09 06:54:03,334 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-03-09 06:54:03,334 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 65 transitions. [2025-03-09 06:54:03,334 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:54:03,334 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:54:03,334 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:54:03,335 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2025-03-09 06:54:03,335 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:54:03,335 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-03-09 06:54:03,335 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem6#1 > 0;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" [2025-03-09 06:54:03,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:03,335 INFO L85 PathProgramCache]: Analyzing trace with hash -460388561, now seen corresponding path program 10 times [2025-03-09 06:54:03,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:03,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442688984] [2025-03-09 06:54:03,335 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:54:03,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:03,340 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-03-09 06:54:03,343 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 41 of 42 statements. [2025-03-09 06:54:03,343 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 06:54:03,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:03,469 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 28 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:54:03,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:54:03,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442688984] [2025-03-09 06:54:03,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442688984] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:54:03,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485065129] [2025-03-09 06:54:03,470 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:54:03,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:54:03,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:03,471 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:54:03,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2025-03-09 06:54:03,510 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-03-09 06:54:03,520 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 41 of 42 statements. [2025-03-09 06:54:03,520 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 06:54:03,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:03,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 06:54:03,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:03,632 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 45 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:54:03,632 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:54:03,720 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 45 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:54:03,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485065129] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:54:03,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:54:03,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 21 [2025-03-09 06:54:03,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595144047] [2025-03-09 06:54:03,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:54:03,720 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:54:03,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:03,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 10 times [2025-03-09 06:54:03,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:03,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462175304] [2025-03-09 06:54:03,721 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:54:03,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:03,723 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-03-09 06:54:03,724 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:03,724 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:54:03,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:03,724 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:54:03,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:03,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:03,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:03,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:03,726 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:54:03,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:54:03,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-09 06:54:03,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2025-03-09 06:54:03,756 INFO L87 Difference]: Start difference. First operand 51 states and 65 transitions. cyclomatic complexity: 22 Second operand has 22 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 22 states have internal predecessors, (73), 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-09 06:54:03,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:54:03,831 INFO L93 Difference]: Finished difference Result 82 states and 103 transitions. [2025-03-09 06:54:03,831 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 103 transitions. [2025-03-09 06:54:03,832 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:54:03,832 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 56 states and 72 transitions. [2025-03-09 06:54:03,832 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-09 06:54:03,832 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-09 06:54:03,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 72 transitions. [2025-03-09 06:54:03,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:54:03,832 INFO L218 hiAutomatonCegarLoop]: Abstraction has 56 states and 72 transitions. [2025-03-09 06:54:03,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 72 transitions. [2025-03-09 06:54:03,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2025-03-09 06:54:03,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 1.2777777777777777) internal successors, (69), 53 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:54:03,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2025-03-09 06:54:03,834 INFO L240 hiAutomatonCegarLoop]: Abstraction has 54 states and 69 transitions. [2025-03-09 06:54:03,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 06:54:03,837 INFO L432 stractBuchiCegarLoop]: Abstraction has 54 states and 69 transitions. [2025-03-09 06:54:03,837 INFO L338 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2025-03-09 06:54:03,838 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 69 transitions. [2025-03-09 06:54:03,838 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:54:03,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:54:03,838 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:54:03,838 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2025-03-09 06:54:03,838 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:54:03,838 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-03-09 06:54:03,838 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem6#1 > 0;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" [2025-03-09 06:54:03,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:03,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1638982735, now seen corresponding path program 11 times [2025-03-09 06:54:03,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:03,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459861593] [2025-03-09 06:54:03,839 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:54:03,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:03,843 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 7 equivalence classes. [2025-03-09 06:54:03,855 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 06:54:03,855 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-03-09 06:54:03,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:03,855 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:54:03,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-09 06:54:03,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 06:54:03,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:03,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:03,869 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:54:03,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:03,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 11 times [2025-03-09 06:54:03,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:03,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555008896] [2025-03-09 06:54:03,870 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:54:03,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:03,874 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:03,874 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:03,874 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:54:03,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:03,875 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:54:03,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:03,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:03,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:03,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:03,876 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:54:03,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:03,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1190589010, now seen corresponding path program 5 times [2025-03-09 06:54:03,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:03,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666126546] [2025-03-09 06:54:03,879 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:54:03,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:03,884 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 47 statements into 7 equivalence classes. [2025-03-09 06:54:03,902 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 06:54:03,902 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-03-09 06:54:03,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:03,902 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:54:03,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-09 06:54:03,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 06:54:03,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:03,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:03,917 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:54:05,827 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:54:05,827 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:54:05,827 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:54:05,827 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:54:05,827 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:54:05,827 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:05,827 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:54:05,827 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:54:05,827 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration15_Lasso [2025-03-09 06:54:05,827 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:54:05,827 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:54:05,828 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:05,832 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:06,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:06,327 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:06,329 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:06,330 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:06,332 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:06,333 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:06,346 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:06,348 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:06,349 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:06,351 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:06,352 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:06,353 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:06,354 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:06,552 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:54:06,552 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:54:06,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:06,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:06,554 INFO L229 MonitoredProcess]: Starting monitored process 80 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-09 06:54:06,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2025-03-09 06:54:06,556 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-09 06:54:06,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:06,566 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:06,566 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:06,566 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:06,566 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:06,566 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:06,566 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:06,567 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:06,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Forceful destruction successful, exit code 0 [2025-03-09 06:54:06,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:06,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:06,574 INFO L229 MonitoredProcess]: Starting monitored process 81 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-09 06:54:06,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2025-03-09 06:54:06,576 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-09 06:54:06,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:06,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:06,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:06,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:06,588 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:06,588 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:06,593 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:54:06,600 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-03-09 06:54:06,600 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-03-09 06:54:06,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:06,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:06,602 INFO L229 MonitoredProcess]: Starting monitored process 82 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-09 06:54:06,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2025-03-09 06:54:06,603 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:54:06,613 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:54:06,613 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:54:06,613 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 20))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 20))_1 Supporting invariants [] [2025-03-09 06:54:06,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2025-03-09 06:54:06,651 INFO L156 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2025-03-09 06:54:06,652 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-09 06:54:06,652 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-09 06:54:06,652 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2025-03-09 06:54:06,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:06,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-09 06:54:06,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 06:54:06,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:06,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:06,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 06:54:06,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:06,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:06,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:06,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:06,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:06,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:54:06,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:06,790 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-09 06:54:06,790 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 2 loop predicates [2025-03-09 06:54:06,791 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states and 69 transitions. cyclomatic complexity: 23 Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 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-09 06:54:06,815 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 54 states and 69 transitions. cyclomatic complexity: 23. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 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 55 states and 71 transitions. Complement of second has 4 states. [2025-03-09 06:54:06,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-09 06:54:06,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 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-09 06:54:06,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2025-03-09 06:54:06,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 45 letters. Loop has 2 letters. [2025-03-09 06:54:06,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:06,816 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:54:06,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:06,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-09 06:54:06,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 06:54:06,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:06,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:06,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 06:54:06,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:06,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:06,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:06,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:06,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:06,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:54:06,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:06,972 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-09 06:54:06,973 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.7 stem predicates 2 loop predicates [2025-03-09 06:54:06,973 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states and 69 transitions. cyclomatic complexity: 23 Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 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-09 06:54:06,993 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 54 states and 69 transitions. cyclomatic complexity: 23. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 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 55 states and 71 transitions. Complement of second has 4 states. [2025-03-09 06:54:06,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-09 06:54:06,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 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-09 06:54:06,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2025-03-09 06:54:06,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 45 letters. Loop has 2 letters. [2025-03-09 06:54:06,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:06,994 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:54:07,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:07,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-09 06:54:07,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 06:54:07,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:07,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:07,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 06:54:07,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:07,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:07,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:07,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:07,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:07,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:54:07,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:07,142 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-09 06:54:07,143 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.7 stem predicates 2 loop predicates [2025-03-09 06:54:07,143 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states and 69 transitions. cyclomatic complexity: 23 Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 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-09 06:54:07,247 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 54 states and 69 transitions. cyclomatic complexity: 23. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 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 73 states and 96 transitions. Complement of second has 18 states. [2025-03-09 06:54:07,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 7 stem states 2 non-accepting loop states 2 accepting loop states [2025-03-09 06:54:07,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 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-09 06:54:07,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 56 transitions. [2025-03-09 06:54:07,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 56 transitions. Stem has 45 letters. Loop has 2 letters. [2025-03-09 06:54:07,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:07,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 56 transitions. Stem has 47 letters. Loop has 2 letters. [2025-03-09 06:54:07,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:07,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 56 transitions. Stem has 45 letters. Loop has 4 letters. [2025-03-09 06:54:07,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:07,248 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 96 transitions. [2025-03-09 06:54:07,248 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:54:07,249 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 68 states and 89 transitions. [2025-03-09 06:54:07,249 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-09 06:54:07,249 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-09 06:54:07,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 89 transitions. [2025-03-09 06:54:07,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:54:07,249 INFO L218 hiAutomatonCegarLoop]: Abstraction has 68 states and 89 transitions. [2025-03-09 06:54:07,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 89 transitions. [2025-03-09 06:54:07,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 59. [2025-03-09 06:54:07,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 1.271186440677966) internal successors, (75), 58 states have internal predecessors, (75), 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-09 06:54:07,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 75 transitions. [2025-03-09 06:54:07,251 INFO L240 hiAutomatonCegarLoop]: Abstraction has 59 states and 75 transitions. [2025-03-09 06:54:07,251 INFO L432 stractBuchiCegarLoop]: Abstraction has 59 states and 75 transitions. [2025-03-09 06:54:07,251 INFO L338 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2025-03-09 06:54:07,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 75 transitions. [2025-03-09 06:54:07,251 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:54:07,251 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:54:07,251 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:54:07,252 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2025-03-09 06:54:07,252 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:54:07,252 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-03-09 06:54:07,252 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem6#1 > 0;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" [2025-03-09 06:54:07,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:07,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1694738700, now seen corresponding path program 12 times [2025-03-09 06:54:07,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:07,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55961134] [2025-03-09 06:54:07,253 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:54:07,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:07,257 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 49 statements into 7 equivalence classes. [2025-03-09 06:54:07,266 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 06:54:07,266 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-09 06:54:07,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:07,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2025-03-09 06:54:07,440 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 45 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:54:07,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:54:07,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55961134] [2025-03-09 06:54:07,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55961134] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:54:07,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242540939] [2025-03-09 06:54:07,441 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:54:07,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:54:07,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:07,442 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:54:07,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Waiting until timeout for monitored process [2025-03-09 06:54:07,483 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 49 statements into 7 equivalence classes. [2025-03-09 06:54:07,507 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 06:54:07,507 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-09 06:54:07,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:07,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 06:54:07,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:07,645 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 66 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:54:07,645 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:54:07,732 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 66 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:54:07,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242540939] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:54:07,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:54:07,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 24 [2025-03-09 06:54:07,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326431932] [2025-03-09 06:54:07,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:54:07,732 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:54:07,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:07,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 12 times [2025-03-09 06:54:07,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:07,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707388215] [2025-03-09 06:54:07,732 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:54:07,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:07,734 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:07,735 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:07,735 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-09 06:54:07,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:07,735 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:54:07,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:07,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:07,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:07,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:07,736 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:54:07,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:54:07,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-09 06:54:07,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2025-03-09 06:54:07,760 INFO L87 Difference]: Start difference. First operand 59 states and 75 transitions. cyclomatic complexity: 25 Second operand has 25 states, 24 states have (on average 3.5) internal successors, (84), 25 states have internal predecessors, (84), 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-09 06:54:07,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:54:07,884 INFO L93 Difference]: Finished difference Result 95 states and 119 transitions. [2025-03-09 06:54:07,884 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 119 transitions. [2025-03-09 06:54:07,885 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:54:07,885 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 64 states and 82 transitions. [2025-03-09 06:54:07,885 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-09 06:54:07,885 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-09 06:54:07,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 82 transitions. [2025-03-09 06:54:07,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:54:07,885 INFO L218 hiAutomatonCegarLoop]: Abstraction has 64 states and 82 transitions. [2025-03-09 06:54:07,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 82 transitions. [2025-03-09 06:54:07,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2025-03-09 06:54:07,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 1.2741935483870968) internal successors, (79), 61 states have internal predecessors, (79), 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-09 06:54:07,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2025-03-09 06:54:07,887 INFO L240 hiAutomatonCegarLoop]: Abstraction has 62 states and 79 transitions. [2025-03-09 06:54:07,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 06:54:07,890 INFO L432 stractBuchiCegarLoop]: Abstraction has 62 states and 79 transitions. [2025-03-09 06:54:07,890 INFO L338 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2025-03-09 06:54:07,890 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 79 transitions. [2025-03-09 06:54:07,890 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:54:07,890 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:54:07,890 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:54:07,891 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2025-03-09 06:54:07,891 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:54:07,891 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-03-09 06:54:07,891 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem6#1 > 0;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" [2025-03-09 06:54:07,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:07,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1499630124, now seen corresponding path program 13 times [2025-03-09 06:54:07,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:07,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405501516] [2025-03-09 06:54:07,891 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 06:54:07,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:07,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-09 06:54:07,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 06:54:07,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:07,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:07,905 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:54:07,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-09 06:54:07,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 06:54:07,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:07,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:07,916 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:54:07,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:07,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 13 times [2025-03-09 06:54:07,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:07,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659434314] [2025-03-09 06:54:07,917 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 06:54:07,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:07,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:07,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:07,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:07,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:07,920 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:54:07,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:07,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:07,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:07,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:07,922 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:54:07,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:07,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1964462579, now seen corresponding path program 6 times [2025-03-09 06:54:07,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:07,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563895293] [2025-03-09 06:54:07,922 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:54:07,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:07,927 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 8 equivalence classes. [2025-03-09 06:54:07,943 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 54 of 54 statements. [2025-03-09 06:54:07,943 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-03-09 06:54:07,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:07,943 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:54:07,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-09 06:54:07,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-09 06:54:07,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:07,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:07,953 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:54:10,795 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:54:10,795 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:54:10,795 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:54:10,795 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:54:10,795 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:54:10,795 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:10,795 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:54:10,795 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:54:10,795 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration17_Lasso [2025-03-09 06:54:10,795 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:54:10,795 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:54:10,796 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:10,797 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:10,799 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:10,801 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:10,808 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:10,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:10,813 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:10,814 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:11,592 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:11,593 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:11,594 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:11,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:11,596 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:11,598 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:11,599 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:11,824 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:54:11,824 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:54:11,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:11,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:11,826 INFO L229 MonitoredProcess]: Starting monitored process 84 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-09 06:54:11,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2025-03-09 06:54:11,827 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-09 06:54:11,837 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:11,837 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:11,837 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:11,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:11,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:11,838 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:11,838 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:11,839 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:11,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2025-03-09 06:54:11,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:11,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:11,845 INFO L229 MonitoredProcess]: Starting monitored process 85 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-09 06:54:11,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2025-03-09 06:54:11,847 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-09 06:54:11,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:11,856 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:11,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:11,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:11,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:11,856 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:11,856 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:11,857 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:11,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2025-03-09 06:54:11,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:11,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:11,864 INFO L229 MonitoredProcess]: Starting monitored process 86 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-09 06:54:11,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2025-03-09 06:54:11,866 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-09 06:54:11,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:11,875 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:11,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:11,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:11,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:11,875 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:11,875 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:11,876 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:11,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2025-03-09 06:54:11,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:11,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:11,883 INFO L229 MonitoredProcess]: Starting monitored process 87 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-09 06:54:11,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2025-03-09 06:54:11,884 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-09 06:54:11,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:11,894 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:11,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:11,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:11,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:11,895 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:11,895 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:11,896 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:11,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2025-03-09 06:54:11,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:11,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:11,903 INFO L229 MonitoredProcess]: Starting monitored process 88 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-09 06:54:11,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2025-03-09 06:54:11,904 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:54:11,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:11,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:11,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:11,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:11,915 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:11,915 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:11,917 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:11,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2025-03-09 06:54:11,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:11,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:11,924 INFO L229 MonitoredProcess]: Starting monitored process 89 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-09 06:54:11,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2025-03-09 06:54:11,925 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-09 06:54:11,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:11,935 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:11,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:11,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:11,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:11,935 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:11,935 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:11,936 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:11,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2025-03-09 06:54:11,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:11,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:11,943 INFO L229 MonitoredProcess]: Starting monitored process 90 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-09 06:54:11,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2025-03-09 06:54:11,944 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-09 06:54:11,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:11,954 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:11,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:11,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:11,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:11,954 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:11,954 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:11,955 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:11,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2025-03-09 06:54:11,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:11,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:11,962 INFO L229 MonitoredProcess]: Starting monitored process 91 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-09 06:54:11,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2025-03-09 06:54:11,965 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-09 06:54:11,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:11,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:11,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:11,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:11,976 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:11,977 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:11,980 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:11,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Forceful destruction successful, exit code 0 [2025-03-09 06:54:11,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:11,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:11,987 INFO L229 MonitoredProcess]: Starting monitored process 92 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-09 06:54:11,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2025-03-09 06:54:11,993 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-09 06:54:12,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:12,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:12,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:12,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:12,004 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:12,004 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:12,008 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:12,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2025-03-09 06:54:12,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:12,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:12,014 INFO L229 MonitoredProcess]: Starting monitored process 93 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-09 06:54:12,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2025-03-09 06:54:12,016 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-09 06:54:12,025 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:12,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:12,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:12,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:12,027 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:12,027 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:12,031 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:12,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2025-03-09 06:54:12,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:12,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:12,038 INFO L229 MonitoredProcess]: Starting monitored process 94 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-09 06:54:12,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2025-03-09 06:54:12,040 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-09 06:54:12,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:12,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:12,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:12,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:12,051 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:12,051 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:12,054 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:12,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2025-03-09 06:54:12,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:12,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:12,062 INFO L229 MonitoredProcess]: Starting monitored process 95 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-09 06:54:12,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2025-03-09 06:54:12,063 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-09 06:54:12,073 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:12,073 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:12,073 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:12,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:12,074 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:12,074 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:12,078 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:12,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Ended with exit code 0 [2025-03-09 06:54:12,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:12,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:12,085 INFO L229 MonitoredProcess]: Starting monitored process 96 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-09 06:54:12,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2025-03-09 06:54:12,086 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-09 06:54:12,096 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:12,097 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:12,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:12,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:12,097 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:12,097 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:12,099 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:12,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2025-03-09 06:54:12,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:12,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:12,106 INFO L229 MonitoredProcess]: Starting monitored process 97 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-09 06:54:12,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2025-03-09 06:54:12,108 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-09 06:54:12,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:12,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:12,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:12,117 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:12,118 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:12,118 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:12,120 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:12,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2025-03-09 06:54:12,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:12,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:12,128 INFO L229 MonitoredProcess]: Starting monitored process 98 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-09 06:54:12,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2025-03-09 06:54:12,129 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-09 06:54:12,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:12,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:12,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:12,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:12,141 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:12,141 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:12,146 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:12,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2025-03-09 06:54:12,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:12,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:12,153 INFO L229 MonitoredProcess]: Starting monitored process 99 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-09 06:54:12,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2025-03-09 06:54:12,155 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-09 06:54:12,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:12,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:12,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:12,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:12,166 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:12,166 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:12,171 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:54:12,178 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-03-09 06:54:12,178 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-03-09 06:54:12,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:12,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:12,180 INFO L229 MonitoredProcess]: Starting monitored process 100 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-09 06:54:12,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2025-03-09 06:54:12,181 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:54:12,192 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:54:12,192 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:54:12,192 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 24))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 24))_1 Supporting invariants [] [2025-03-09 06:54:12,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2025-03-09 06:54:12,234 INFO L156 tatePredicateManager]: 16 out of 17 supporting invariants were superfluous and have been removed [2025-03-09 06:54:12,235 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-09 06:54:12,235 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-09 06:54:12,235 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2025-03-09 06:54:12,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:12,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-09 06:54:12,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 06:54:12,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:12,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:12,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 06:54:12,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:12,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:12,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:12,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:12,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:12,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:54:12,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:12,393 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-09 06:54:12,393 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2025-03-09 06:54:12,393 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 79 transitions. cyclomatic complexity: 26 Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 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-09 06:54:12,413 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 79 transitions. cyclomatic complexity: 26. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 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) Result 63 states and 81 transitions. Complement of second has 4 states. [2025-03-09 06:54:12,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-09 06:54:12,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 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-09 06:54:12,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2025-03-09 06:54:12,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 52 letters. Loop has 2 letters. [2025-03-09 06:54:12,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:12,414 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:54:12,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:12,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-09 06:54:12,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 06:54:12,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:12,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:12,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 06:54:12,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:12,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:12,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:12,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:12,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:12,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:54:12,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:12,563 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-09 06:54:12,563 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.8 stem predicates 2 loop predicates [2025-03-09 06:54:12,563 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 79 transitions. cyclomatic complexity: 26 Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 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-09 06:54:12,577 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 79 transitions. cyclomatic complexity: 26. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 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) Result 63 states and 81 transitions. Complement of second has 4 states. [2025-03-09 06:54:12,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-09 06:54:12,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 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-09 06:54:12,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2025-03-09 06:54:12,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 52 letters. Loop has 2 letters. [2025-03-09 06:54:12,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:12,578 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:54:12,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:12,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-09 06:54:12,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 06:54:12,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:12,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:12,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 06:54:12,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:12,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:12,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:12,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:12,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:12,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:54:12,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:12,747 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-09 06:54:12,747 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2025-03-09 06:54:12,747 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 79 transitions. cyclomatic complexity: 26 Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 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-09 06:54:12,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2025-03-09 06:54:12,893 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 79 transitions. cyclomatic complexity: 26. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 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) Result 82 states and 108 transitions. Complement of second has 20 states. [2025-03-09 06:54:12,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 8 stem states 2 non-accepting loop states 2 accepting loop states [2025-03-09 06:54:12,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 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-09 06:54:12,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 62 transitions. [2025-03-09 06:54:12,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 62 transitions. Stem has 52 letters. Loop has 2 letters. [2025-03-09 06:54:12,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:12,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 62 transitions. Stem has 54 letters. Loop has 2 letters. [2025-03-09 06:54:12,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:12,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 62 transitions. Stem has 52 letters. Loop has 4 letters. [2025-03-09 06:54:12,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:12,895 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 108 transitions. [2025-03-09 06:54:12,895 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:54:12,896 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 77 states and 101 transitions. [2025-03-09 06:54:12,896 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-09 06:54:12,896 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-09 06:54:12,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 101 transitions. [2025-03-09 06:54:12,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:54:12,896 INFO L218 hiAutomatonCegarLoop]: Abstraction has 77 states and 101 transitions. [2025-03-09 06:54:12,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 101 transitions. [2025-03-09 06:54:12,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 67. [2025-03-09 06:54:12,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 1.2686567164179106) internal successors, (85), 66 states have internal predecessors, (85), 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-09 06:54:12,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 85 transitions. [2025-03-09 06:54:12,897 INFO L240 hiAutomatonCegarLoop]: Abstraction has 67 states and 85 transitions. [2025-03-09 06:54:12,897 INFO L432 stractBuchiCegarLoop]: Abstraction has 67 states and 85 transitions. [2025-03-09 06:54:12,897 INFO L338 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2025-03-09 06:54:12,897 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 85 transitions. [2025-03-09 06:54:12,898 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:54:12,898 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:54:12,898 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:54:12,898 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2025-03-09 06:54:12,898 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:54:12,898 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-03-09 06:54:12,898 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem6#1 > 0;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" [2025-03-09 06:54:12,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:12,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1937072647, now seen corresponding path program 14 times [2025-03-09 06:54:12,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:12,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738961450] [2025-03-09 06:54:12,899 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:54:12,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:12,904 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-03-09 06:54:12,908 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-09 06:54:12,908 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:54:12,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:13,112 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 66 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:54:13,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:54:13,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738961450] [2025-03-09 06:54:13,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738961450] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:54:13,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294408240] [2025-03-09 06:54:13,112 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:54:13,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:54:13,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:13,114 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:54:13,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Waiting until timeout for monitored process [2025-03-09 06:54:13,162 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-03-09 06:54:13,178 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-09 06:54:13,178 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:54:13,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:13,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 06:54:13,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:13,330 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 91 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:54:13,330 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:54:13,445 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 91 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:54:13,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294408240] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:54:13,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:54:13,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 27 [2025-03-09 06:54:13,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077542212] [2025-03-09 06:54:13,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:54:13,445 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:54:13,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:13,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 14 times [2025-03-09 06:54:13,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:13,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149459589] [2025-03-09 06:54:13,446 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:54:13,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:13,448 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:13,448 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:13,448 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:54:13,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:13,449 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:54:13,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:13,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:13,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:13,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:13,451 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:54:13,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:54:13,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-09 06:54:13,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=573, Unknown=0, NotChecked=0, Total=756 [2025-03-09 06:54:13,479 INFO L87 Difference]: Start difference. First operand 67 states and 85 transitions. cyclomatic complexity: 28 Second operand has 28 states, 27 states have (on average 3.5185185185185186) internal successors, (95), 28 states have internal predecessors, (95), 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-09 06:54:13,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:54:13,614 INFO L93 Difference]: Finished difference Result 108 states and 135 transitions. [2025-03-09 06:54:13,614 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 135 transitions. [2025-03-09 06:54:13,615 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:54:13,615 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 72 states and 92 transitions. [2025-03-09 06:54:13,615 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-09 06:54:13,616 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-09 06:54:13,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 92 transitions. [2025-03-09 06:54:13,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:54:13,616 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72 states and 92 transitions. [2025-03-09 06:54:13,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 92 transitions. [2025-03-09 06:54:13,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2025-03-09 06:54:13,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 70 states have (on average 1.2714285714285714) internal successors, (89), 69 states have internal predecessors, (89), 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-09 06:54:13,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2025-03-09 06:54:13,620 INFO L240 hiAutomatonCegarLoop]: Abstraction has 70 states and 89 transitions. [2025-03-09 06:54:13,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-09 06:54:13,621 INFO L432 stractBuchiCegarLoop]: Abstraction has 70 states and 89 transitions. [2025-03-09 06:54:13,621 INFO L338 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2025-03-09 06:54:13,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 89 transitions. [2025-03-09 06:54:13,621 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:54:13,623 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:54:13,623 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:54:13,623 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2025-03-09 06:54:13,623 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:54:13,623 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-03-09 06:54:13,623 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem6#1 > 0;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" [2025-03-09 06:54:13,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:13,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1575812327, now seen corresponding path program 15 times [2025-03-09 06:54:13,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:13,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572113389] [2025-03-09 06:54:13,624 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:54:13,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:13,631 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 59 statements into 9 equivalence classes. [2025-03-09 06:54:13,657 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 59 of 59 statements. [2025-03-09 06:54:13,657 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-09 06:54:13,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:13,657 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:54:13,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-09 06:54:13,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-09 06:54:13,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:13,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:13,675 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:54:13,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:13,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 15 times [2025-03-09 06:54:13,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:13,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517493408] [2025-03-09 06:54:13,676 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:54:13,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:13,678 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:13,678 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:13,679 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 06:54:13,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:13,679 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:54:13,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:13,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:13,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:13,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:13,681 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:54:13,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:13,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1767809528, now seen corresponding path program 7 times [2025-03-09 06:54:13,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:13,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786835581] [2025-03-09 06:54:13,681 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 06:54:13,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:13,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-09 06:54:13,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-09 06:54:13,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:13,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:13,724 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:54:13,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-09 06:54:13,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-09 06:54:13,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:13,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:13,740 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:54:15,943 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:54:15,944 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:54:15,944 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:54:15,944 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:54:15,944 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:54:15,944 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:15,944 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:54:15,944 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:54:15,944 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration19_Lasso [2025-03-09 06:54:15,944 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:54:15,944 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:54:15,945 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:15,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:15,948 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:15,949 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:15,950 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:15,951 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:15,952 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:15,954 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:15,955 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:15,956 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:15,957 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:15,958 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:16,107 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:16,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:16,110 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:16,111 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:16,273 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:54:16,273 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:54:16,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:16,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:16,277 INFO L229 MonitoredProcess]: Starting monitored process 102 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-09 06:54:16,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2025-03-09 06:54:16,278 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-09 06:54:16,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:16,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:16,288 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:16,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:16,289 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:16,289 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:16,291 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:16,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0 [2025-03-09 06:54:16,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:16,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:16,297 INFO L229 MonitoredProcess]: Starting monitored process 103 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-09 06:54:16,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2025-03-09 06:54:16,299 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-09 06:54:16,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:16,309 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:16,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:16,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:16,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:16,309 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:16,309 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:16,310 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:16,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Ended with exit code 0 [2025-03-09 06:54:16,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:16,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:16,317 INFO L229 MonitoredProcess]: Starting monitored process 104 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-09 06:54:16,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2025-03-09 06:54:16,319 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-09 06:54:16,329 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:16,329 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:16,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:16,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:16,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:16,329 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:16,329 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:16,330 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:16,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Ended with exit code 0 [2025-03-09 06:54:16,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:16,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:16,338 INFO L229 MonitoredProcess]: Starting monitored process 105 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-09 06:54:16,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2025-03-09 06:54:16,340 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-09 06:54:16,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:16,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:16,350 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:16,350 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:16,351 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:16,351 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:16,354 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:16,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0 [2025-03-09 06:54:16,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:16,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:16,361 INFO L229 MonitoredProcess]: Starting monitored process 106 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-09 06:54:16,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2025-03-09 06:54:16,363 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-09 06:54:16,372 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:16,373 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:16,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:16,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:16,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:16,373 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:16,373 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:16,374 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:16,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2025-03-09 06:54:16,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:16,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:16,382 INFO L229 MonitoredProcess]: Starting monitored process 107 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-09 06:54:16,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2025-03-09 06:54:16,383 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-09 06:54:16,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:16,394 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:16,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:16,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:16,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:16,394 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:16,394 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:16,395 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:16,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Ended with exit code 0 [2025-03-09 06:54:16,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:16,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:16,403 INFO L229 MonitoredProcess]: Starting monitored process 108 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-09 06:54:16,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2025-03-09 06:54:16,404 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-09 06:54:16,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:16,415 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:16,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:16,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:16,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:16,415 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:16,415 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:16,416 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:16,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Ended with exit code 0 [2025-03-09 06:54:16,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:16,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:16,423 INFO L229 MonitoredProcess]: Starting monitored process 109 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-09 06:54:16,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2025-03-09 06:54:16,425 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-09 06:54:16,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:16,434 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:16,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:16,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:16,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:16,435 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:16,435 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:16,436 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:16,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Ended with exit code 0 [2025-03-09 06:54:16,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:16,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:16,443 INFO L229 MonitoredProcess]: Starting monitored process 110 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-09 06:54:16,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2025-03-09 06:54:16,445 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-09 06:54:16,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:16,454 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:16,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:16,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:16,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:16,455 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:16,455 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:16,456 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:16,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2025-03-09 06:54:16,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:16,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:16,462 INFO L229 MonitoredProcess]: Starting monitored process 111 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-09 06:54:16,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2025-03-09 06:54:16,464 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-09 06:54:16,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:16,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:16,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:16,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:16,475 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:16,475 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:16,477 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:16,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2025-03-09 06:54:16,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:16,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:16,484 INFO L229 MonitoredProcess]: Starting monitored process 112 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-09 06:54:16,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2025-03-09 06:54:16,485 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:54:16,494 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:16,494 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:16,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:16,495 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:16,495 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:16,495 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:16,495 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:16,496 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:16,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2025-03-09 06:54:16,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:16,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:16,503 INFO L229 MonitoredProcess]: Starting monitored process 113 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-09 06:54:16,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2025-03-09 06:54:16,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-09 06:54:16,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:16,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:16,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:16,514 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:16,515 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:16,515 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:16,517 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:16,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2025-03-09 06:54:16,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:16,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:16,524 INFO L229 MonitoredProcess]: Starting monitored process 114 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-09 06:54:16,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2025-03-09 06:54:16,526 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-09 06:54:16,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:16,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:16,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:16,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:16,536 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:16,536 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:16,538 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:16,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Forceful destruction successful, exit code 0 [2025-03-09 06:54:16,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:16,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:16,546 INFO L229 MonitoredProcess]: Starting monitored process 115 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-09 06:54:16,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2025-03-09 06:54:16,547 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-09 06:54:16,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:16,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:16,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:16,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:16,558 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:16,558 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:16,560 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:16,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Ended with exit code 0 [2025-03-09 06:54:16,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:16,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:16,569 INFO L229 MonitoredProcess]: Starting monitored process 116 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-09 06:54:16,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2025-03-09 06:54:16,570 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-09 06:54:16,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:16,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:16,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:16,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:16,582 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:16,582 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:16,587 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:16,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Ended with exit code 0 [2025-03-09 06:54:16,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:16,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:16,594 INFO L229 MonitoredProcess]: Starting monitored process 117 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-09 06:54:16,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2025-03-09 06:54:16,595 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-09 06:54:16,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:16,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:16,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:16,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:16,606 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:16,606 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:16,609 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:16,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0 [2025-03-09 06:54:16,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:16,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:16,616 INFO L229 MonitoredProcess]: Starting monitored process 118 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-09 06:54:16,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2025-03-09 06:54:16,618 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-09 06:54:16,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:16,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:16,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:16,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:16,628 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:16,628 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:16,630 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:16,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Forceful destruction successful, exit code 0 [2025-03-09 06:54:16,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:16,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:16,637 INFO L229 MonitoredProcess]: Starting monitored process 119 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-09 06:54:16,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2025-03-09 06:54:16,639 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-09 06:54:16,648 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:16,648 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:16,648 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:16,648 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:16,649 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:16,649 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:16,651 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:16,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0 [2025-03-09 06:54:16,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:16,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:16,659 INFO L229 MonitoredProcess]: Starting monitored process 120 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-09 06:54:16,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2025-03-09 06:54:16,661 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-09 06:54:16,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:16,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:16,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:16,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:16,672 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:16,672 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:16,675 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:16,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0 [2025-03-09 06:54:16,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:16,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:16,682 INFO L229 MonitoredProcess]: Starting monitored process 121 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-09 06:54:16,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2025-03-09 06:54:16,684 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-09 06:54:16,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:16,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:16,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:16,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:16,695 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:16,695 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:16,697 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:16,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Forceful destruction successful, exit code 0 [2025-03-09 06:54:16,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:16,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:16,705 INFO L229 MonitoredProcess]: Starting monitored process 122 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-09 06:54:16,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2025-03-09 06:54:16,706 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-09 06:54:16,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:16,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:16,716 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:16,716 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:16,716 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:16,716 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:16,718 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:16,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Ended with exit code 0 [2025-03-09 06:54:16,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:16,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:16,726 INFO L229 MonitoredProcess]: Starting monitored process 123 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-09 06:54:16,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2025-03-09 06:54:16,727 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-09 06:54:16,737 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:16,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:16,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:16,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:16,738 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:16,739 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:16,744 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:54:16,749 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-03-09 06:54:16,749 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-03-09 06:54:16,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:16,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:16,751 INFO L229 MonitoredProcess]: Starting monitored process 124 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-09 06:54:16,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2025-03-09 06:54:16,753 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:54:16,763 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:54:16,763 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:54:16,763 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 28)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 28)_1 Supporting invariants [] [2025-03-09 06:54:16,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Ended with exit code 0 [2025-03-09 06:54:16,782 INFO L156 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2025-03-09 06:54:16,783 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-09 06:54:16,783 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-09 06:54:16,783 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2025-03-09 06:54:16,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:16,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-09 06:54:16,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-09 06:54:16,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:16,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:16,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-09 06:54:16,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:17,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:17,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:17,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:17,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:17,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:54:17,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:17,059 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-09 06:54:17,060 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 2 loop predicates [2025-03-09 06:54:17,060 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 89 transitions. cyclomatic complexity: 29 Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 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-09 06:54:17,088 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 89 transitions. cyclomatic complexity: 29. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 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 91 transitions. Complement of second has 5 states. [2025-03-09 06:54:17,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-09 06:54:17,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 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-09 06:54:17,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2025-03-09 06:54:17,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 59 letters. Loop has 2 letters. [2025-03-09 06:54:17,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:17,089 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:54:17,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:17,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-09 06:54:17,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-09 06:54:17,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:17,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:17,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-09 06:54:17,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:17,170 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Ended with exit code 0 [2025-03-09 06:54:17,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:17,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:17,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:17,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:17,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:54:17,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:17,360 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-09 06:54:17,360 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.10 stem predicates 2 loop predicates [2025-03-09 06:54:17,360 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 89 transitions. cyclomatic complexity: 29 Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 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-09 06:54:17,384 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 89 transitions. cyclomatic complexity: 29. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 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 91 transitions. Complement of second has 5 states. [2025-03-09 06:54:17,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-09 06:54:17,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 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-09 06:54:17,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2025-03-09 06:54:17,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 59 letters. Loop has 2 letters. [2025-03-09 06:54:17,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:17,385 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:54:17,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:17,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-09 06:54:17,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-09 06:54:17,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:17,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:17,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-09 06:54:17,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:17,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:17,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:17,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:17,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:17,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:54:17,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:17,684 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-09 06:54:17,685 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.10 stem predicates 2 loop predicates [2025-03-09 06:54:17,685 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 89 transitions. cyclomatic complexity: 29 Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 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-09 06:54:17,828 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 89 transitions. cyclomatic complexity: 29. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 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 91 states and 120 transitions. Complement of second has 23 states. [2025-03-09 06:54:17,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 10 stem states 2 non-accepting loop states 2 accepting loop states [2025-03-09 06:54:17,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 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-09 06:54:17,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 68 transitions. [2025-03-09 06:54:17,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 68 transitions. Stem has 59 letters. Loop has 2 letters. [2025-03-09 06:54:17,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:17,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 68 transitions. Stem has 61 letters. Loop has 2 letters. [2025-03-09 06:54:17,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:17,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 68 transitions. Stem has 59 letters. Loop has 4 letters. [2025-03-09 06:54:17,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:17,830 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 120 transitions. [2025-03-09 06:54:17,830 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:54:17,830 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 86 states and 113 transitions. [2025-03-09 06:54:17,830 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-09 06:54:17,830 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-09 06:54:17,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 113 transitions. [2025-03-09 06:54:17,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:54:17,830 INFO L218 hiAutomatonCegarLoop]: Abstraction has 86 states and 113 transitions. [2025-03-09 06:54:17,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states and 113 transitions. [2025-03-09 06:54:17,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 75. [2025-03-09 06:54:17,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 74 states have internal predecessors, (95), 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-09 06:54:17,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 95 transitions. [2025-03-09 06:54:17,832 INFO L240 hiAutomatonCegarLoop]: Abstraction has 75 states and 95 transitions. [2025-03-09 06:54:17,832 INFO L432 stractBuchiCegarLoop]: Abstraction has 75 states and 95 transitions. [2025-03-09 06:54:17,832 INFO L338 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2025-03-09 06:54:17,832 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 95 transitions. [2025-03-09 06:54:17,832 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:54:17,832 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:54:17,832 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:54:17,833 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2025-03-09 06:54:17,833 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:54:17,833 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-03-09 06:54:17,833 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem6#1 > 0;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" [2025-03-09 06:54:17,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:17,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1942093634, now seen corresponding path program 16 times [2025-03-09 06:54:17,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:17,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249722686] [2025-03-09 06:54:17,834 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:54:17,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:17,838 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 63 statements into 2 equivalence classes. [2025-03-09 06:54:17,842 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 62 of 63 statements. [2025-03-09 06:54:17,842 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 06:54:17,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:18,065 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 91 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:54:18,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:54:18,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249722686] [2025-03-09 06:54:18,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249722686] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:54:18,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142648645] [2025-03-09 06:54:18,066 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:54:18,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:54:18,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:18,068 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:54:18,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Waiting until timeout for monitored process [2025-03-09 06:54:18,122 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 63 statements into 2 equivalence classes. [2025-03-09 06:54:18,137 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 62 of 63 statements. [2025-03-09 06:54:18,137 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 06:54:18,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:18,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 06:54:18,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:18,376 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 120 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:54:18,377 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:54:18,542 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 120 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:54:18,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142648645] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:54:18,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:54:18,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 30 [2025-03-09 06:54:18,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145587320] [2025-03-09 06:54:18,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:54:18,543 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:54:18,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:18,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 16 times [2025-03-09 06:54:18,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:18,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181262259] [2025-03-09 06:54:18,543 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:54:18,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:18,546 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-03-09 06:54:18,546 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:18,546 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:54:18,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:18,546 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:54:18,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:18,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:18,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:18,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:18,548 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:54:18,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:54:18,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-09 06:54:18,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=707, Unknown=0, NotChecked=0, Total=930 [2025-03-09 06:54:18,573 INFO L87 Difference]: Start difference. First operand 75 states and 95 transitions. cyclomatic complexity: 31 Second operand has 31 states, 30 states have (on average 3.533333333333333) internal successors, (106), 31 states have internal predecessors, (106), 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-09 06:54:18,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:54:18,703 INFO L93 Difference]: Finished difference Result 121 states and 151 transitions. [2025-03-09 06:54:18,703 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 151 transitions. [2025-03-09 06:54:18,704 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:54:18,704 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 80 states and 102 transitions. [2025-03-09 06:54:18,704 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-09 06:54:18,704 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-09 06:54:18,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 102 transitions. [2025-03-09 06:54:18,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:54:18,705 INFO L218 hiAutomatonCegarLoop]: Abstraction has 80 states and 102 transitions. [2025-03-09 06:54:18,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 102 transitions. [2025-03-09 06:54:18,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2025-03-09 06:54:18,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 78 states have (on average 1.2692307692307692) internal successors, (99), 77 states have internal predecessors, (99), 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-09 06:54:18,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 99 transitions. [2025-03-09 06:54:18,706 INFO L240 hiAutomatonCegarLoop]: Abstraction has 78 states and 99 transitions. [2025-03-09 06:54:18,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-09 06:54:18,707 INFO L432 stractBuchiCegarLoop]: Abstraction has 78 states and 99 transitions. [2025-03-09 06:54:18,707 INFO L338 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2025-03-09 06:54:18,707 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 99 transitions. [2025-03-09 06:54:18,707 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:54:18,707 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:54:18,707 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:54:18,707 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2025-03-09 06:54:18,707 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:54:18,707 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-03-09 06:54:18,707 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem6#1 > 0;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" [2025-03-09 06:54:18,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:18,708 INFO L85 PathProgramCache]: Analyzing trace with hash -2138073186, now seen corresponding path program 17 times [2025-03-09 06:54:18,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:18,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28661573] [2025-03-09 06:54:18,708 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:54:18,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:18,714 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 66 statements into 10 equivalence classes. [2025-03-09 06:54:18,733 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) and asserted 66 of 66 statements. [2025-03-09 06:54:18,733 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2025-03-09 06:54:18,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:18,733 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:54:18,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-09 06:54:18,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-09 06:54:18,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:18,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:18,749 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:54:18,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:18,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 17 times [2025-03-09 06:54:18,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:18,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708435351] [2025-03-09 06:54:18,749 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:54:18,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:18,753 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:18,754 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:18,754 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:54:18,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:18,754 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:54:18,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:18,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:18,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:18,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:18,756 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:54:18,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:18,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1693963971, now seen corresponding path program 8 times [2025-03-09 06:54:18,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:18,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274047959] [2025-03-09 06:54:18,756 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:54:18,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:18,762 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 2 equivalence classes. [2025-03-09 06:54:18,777 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 68 of 68 statements. [2025-03-09 06:54:18,778 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:54:18,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:18,778 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:54:18,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-09 06:54:18,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-09 06:54:18,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:18,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:18,795 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:54:24,251 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:54:24,252 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:54:24,252 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:54:24,252 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:54:24,252 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:54:24,252 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:24,252 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:54:24,252 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:54:24,252 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration21_Lasso [2025-03-09 06:54:24,252 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:54:24,252 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:54:24,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:24,254 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:25,937 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:25,939 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:25,940 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:25,941 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:25,942 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:25,949 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:25,951 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:25,952 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:25,954 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:25,955 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:25,956 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:25,957 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:25,958 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:26,251 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:54:26,251 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:54:26,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:26,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:26,253 INFO L229 MonitoredProcess]: Starting monitored process 126 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-09 06:54:26,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2025-03-09 06:54:26,255 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-09 06:54:26,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:26,264 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:26,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:26,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:26,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:26,265 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:26,265 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:26,266 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:26,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Ended with exit code 0 [2025-03-09 06:54:26,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:26,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:26,272 INFO L229 MonitoredProcess]: Starting monitored process 127 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-09 06:54:26,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2025-03-09 06:54:26,274 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-09 06:54:26,283 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:26,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:26,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:26,283 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:26,284 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:26,284 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:26,286 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:26,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Ended with exit code 0 [2025-03-09 06:54:26,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:26,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:26,293 INFO L229 MonitoredProcess]: Starting monitored process 128 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-09 06:54:26,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2025-03-09 06:54:26,295 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-09 06:54:26,305 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:26,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:26,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:26,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:26,306 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:26,306 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:26,308 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:26,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Ended with exit code 0 [2025-03-09 06:54:26,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:26,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:26,315 INFO L229 MonitoredProcess]: Starting monitored process 129 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-09 06:54:26,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2025-03-09 06:54:26,317 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-09 06:54:26,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:26,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:26,326 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:26,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:26,328 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:26,328 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:26,331 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:26,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Forceful destruction successful, exit code 0 [2025-03-09 06:54:26,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:26,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:26,338 INFO L229 MonitoredProcess]: Starting monitored process 130 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-09 06:54:26,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2025-03-09 06:54:26,340 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-09 06:54:26,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:26,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:26,350 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:26,350 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:26,352 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:26,352 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:26,357 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:54:26,365 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-03-09 06:54:26,366 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-03-09 06:54:26,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:26,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:26,369 INFO L229 MonitoredProcess]: Starting monitored process 131 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-09 06:54:26,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2025-03-09 06:54:26,370 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:54:26,380 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:54:26,381 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:54:26,381 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ 32 ULTIMATE.start_main_~arr~0#1.offset))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ 32 ULTIMATE.start_main_~arr~0#1.offset))_1 Supporting invariants [] [2025-03-09 06:54:26,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Forceful destruction successful, exit code 0 [2025-03-09 06:54:26,445 INFO L156 tatePredicateManager]: 20 out of 21 supporting invariants were superfluous and have been removed [2025-03-09 06:54:26,447 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-09 06:54:26,447 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-09 06:54:26,447 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2025-03-09 06:54:26,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:26,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-09 06:54:26,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-09 06:54:26,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:26,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:26,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 06:54:26,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:26,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:26,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:26,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:26,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:26,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:54:26,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:26,639 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-09 06:54:26,639 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 2 loop predicates [2025-03-09 06:54:26,639 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 78 states and 99 transitions. cyclomatic complexity: 32 Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 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-09 06:54:26,661 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 78 states and 99 transitions. cyclomatic complexity: 32. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 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) Result 79 states and 101 transitions. Complement of second has 4 states. [2025-03-09 06:54:26,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-09 06:54:26,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 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-09 06:54:26,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2025-03-09 06:54:26,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 66 letters. Loop has 2 letters. [2025-03-09 06:54:26,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:26,662 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:54:26,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:26,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-09 06:54:26,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-09 06:54:26,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:26,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:26,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 06:54:26,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:26,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:26,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:26,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:26,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:26,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:54:26,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:26,848 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-09 06:54:26,849 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.10 stem predicates 2 loop predicates [2025-03-09 06:54:26,849 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 78 states and 99 transitions. cyclomatic complexity: 32 Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 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-09 06:54:26,865 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 78 states and 99 transitions. cyclomatic complexity: 32. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 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) Result 79 states and 101 transitions. Complement of second has 4 states. [2025-03-09 06:54:26,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-09 06:54:26,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 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-09 06:54:26,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2025-03-09 06:54:26,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 66 letters. Loop has 2 letters. [2025-03-09 06:54:26,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:26,866 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:54:26,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:26,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Ended with exit code 0 [2025-03-09 06:54:26,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-09 06:54:26,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-09 06:54:26,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:26,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:26,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 06:54:26,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:27,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:27,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:27,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:27,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:27,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:54:27,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:27,081 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-09 06:54:27,082 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.10 stem predicates 2 loop predicates [2025-03-09 06:54:27,082 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 78 states and 99 transitions. cyclomatic complexity: 32 Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 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-09 06:54:27,231 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 78 states and 99 transitions. cyclomatic complexity: 32. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 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) Result 100 states and 132 transitions. Complement of second has 24 states. [2025-03-09 06:54:27,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 10 stem states 2 non-accepting loop states 2 accepting loop states [2025-03-09 06:54:27,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 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-09 06:54:27,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 74 transitions. [2025-03-09 06:54:27,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 74 transitions. Stem has 66 letters. Loop has 2 letters. [2025-03-09 06:54:27,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:27,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 74 transitions. Stem has 68 letters. Loop has 2 letters. [2025-03-09 06:54:27,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:27,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 74 transitions. Stem has 66 letters. Loop has 4 letters. [2025-03-09 06:54:27,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:27,232 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 132 transitions. [2025-03-09 06:54:27,233 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:54:27,233 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 95 states and 125 transitions. [2025-03-09 06:54:27,233 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-09 06:54:27,233 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-09 06:54:27,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 125 transitions. [2025-03-09 06:54:27,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:54:27,233 INFO L218 hiAutomatonCegarLoop]: Abstraction has 95 states and 125 transitions. [2025-03-09 06:54:27,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 125 transitions. [2025-03-09 06:54:27,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 83. [2025-03-09 06:54:27,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 83 states have (on average 1.2650602409638554) internal successors, (105), 82 states have internal predecessors, (105), 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-09 06:54:27,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 105 transitions. [2025-03-09 06:54:27,236 INFO L240 hiAutomatonCegarLoop]: Abstraction has 83 states and 105 transitions. [2025-03-09 06:54:27,236 INFO L432 stractBuchiCegarLoop]: Abstraction has 83 states and 105 transitions. [2025-03-09 06:54:27,236 INFO L338 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2025-03-09 06:54:27,236 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 105 transitions. [2025-03-09 06:54:27,237 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:54:27,237 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:54:27,237 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:54:27,237 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1] [2025-03-09 06:54:27,237 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:54:27,237 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-03-09 06:54:27,237 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem6#1 > 0;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" [2025-03-09 06:54:27,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:27,238 INFO L85 PathProgramCache]: Analyzing trace with hash -106771773, now seen corresponding path program 18 times [2025-03-09 06:54:27,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:27,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120418782] [2025-03-09 06:54:27,238 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:54:27,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:27,243 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 70 statements into 10 equivalence classes. [2025-03-09 06:54:27,260 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) and asserted 70 of 70 statements. [2025-03-09 06:54:27,260 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2025-03-09 06:54:27,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:27,528 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 120 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:54:27,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:54:27,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120418782] [2025-03-09 06:54:27,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120418782] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:54:27,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959290396] [2025-03-09 06:54:27,528 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:54:27,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:54:27,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:27,531 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:54:27,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (132)] Waiting until timeout for monitored process [2025-03-09 06:54:27,593 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 70 statements into 10 equivalence classes. [2025-03-09 06:54:27,680 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) and asserted 70 of 70 statements. [2025-03-09 06:54:27,680 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2025-03-09 06:54:27,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:27,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-09 06:54:27,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:27,913 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 153 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:54:27,913 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:54:28,081 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 153 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:54:28,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959290396] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:54:28,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:54:28,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 33 [2025-03-09 06:54:28,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342520754] [2025-03-09 06:54:28,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:54:28,082 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:54:28,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:28,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 18 times [2025-03-09 06:54:28,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:28,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227010307] [2025-03-09 06:54:28,082 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:54:28,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:28,084 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:28,085 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:28,085 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-09 06:54:28,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:28,085 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:54:28,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:28,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:28,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:28,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:28,086 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:54:28,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:54:28,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-09 06:54:28,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=855, Unknown=0, NotChecked=0, Total=1122 [2025-03-09 06:54:28,111 INFO L87 Difference]: Start difference. First operand 83 states and 105 transitions. cyclomatic complexity: 34 Second operand has 34 states, 33 states have (on average 3.5454545454545454) internal successors, (117), 34 states have internal predecessors, (117), 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-09 06:54:28,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:54:28,253 INFO L93 Difference]: Finished difference Result 134 states and 167 transitions. [2025-03-09 06:54:28,253 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 167 transitions. [2025-03-09 06:54:28,253 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:54:28,257 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 88 states and 112 transitions. [2025-03-09 06:54:28,257 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-09 06:54:28,257 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-09 06:54:28,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 112 transitions. [2025-03-09 06:54:28,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:54:28,257 INFO L218 hiAutomatonCegarLoop]: Abstraction has 88 states and 112 transitions. [2025-03-09 06:54:28,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states and 112 transitions. [2025-03-09 06:54:28,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2025-03-09 06:54:28,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 86 states have (on average 1.2674418604651163) internal successors, (109), 85 states have internal predecessors, (109), 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-09 06:54:28,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 109 transitions. [2025-03-09 06:54:28,259 INFO L240 hiAutomatonCegarLoop]: Abstraction has 86 states and 109 transitions. [2025-03-09 06:54:28,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-09 06:54:28,259 INFO L432 stractBuchiCegarLoop]: Abstraction has 86 states and 109 transitions. [2025-03-09 06:54:28,259 INFO L338 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2025-03-09 06:54:28,259 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 109 transitions. [2025-03-09 06:54:28,260 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:54:28,260 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:54:28,260 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:54:28,260 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1] [2025-03-09 06:54:28,260 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:54:28,260 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-03-09 06:54:28,260 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem6#1 > 0;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" [2025-03-09 06:54:28,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:28,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1920747549, now seen corresponding path program 19 times [2025-03-09 06:54:28,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:28,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776626893] [2025-03-09 06:54:28,261 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 06:54:28,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:28,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-09 06:54:28,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-09 06:54:28,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:28,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:28,281 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:54:28,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-09 06:54:28,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-09 06:54:28,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:28,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:28,299 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:54:28,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:28,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 19 times [2025-03-09 06:54:28,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:28,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586757644] [2025-03-09 06:54:28,301 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 06:54:28,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:28,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:28,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:28,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:28,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:28,304 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:54:28,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:28,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:28,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:28,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:28,306 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:54:28,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:28,306 INFO L85 PathProgramCache]: Analyzing trace with hash 997542978, now seen corresponding path program 9 times [2025-03-09 06:54:28,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:28,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085905865] [2025-03-09 06:54:28,307 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:54:28,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:28,314 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 75 statements into 11 equivalence classes. [2025-03-09 06:54:28,343 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 75 of 75 statements. [2025-03-09 06:54:28,343 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-09 06:54:28,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:28,343 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:54:28,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-09 06:54:28,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-09 06:54:28,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:28,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:28,361 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:54:36,128 WARN L286 SmtUtils]: Spent 7.74s on a formula simplification. DAG size of input: 326 DAG size of output: 242 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-03-09 06:54:37,084 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:54:37,084 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:54:37,084 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:54:37,084 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:54:37,084 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:54:37,084 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:37,085 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:54:37,085 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:54:37,085 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration23_Lasso [2025-03-09 06:54:37,085 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:54:37,085 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:54:37,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:37,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:37,089 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:37,090 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:37,091 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:37,093 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:37,097 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:39,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:39,428 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:39,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:39,431 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:39,433 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:39,434 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:39,436 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:39,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:39,717 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:54:39,717 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:54:39,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:39,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:39,719 INFO L229 MonitoredProcess]: Starting monitored process 133 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-09 06:54:39,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2025-03-09 06:54:39,723 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-09 06:54:39,733 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:39,734 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:39,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:39,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:39,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:39,734 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:39,734 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:39,735 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:39,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Ended with exit code 0 [2025-03-09 06:54:39,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:39,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:39,743 INFO L229 MonitoredProcess]: Starting monitored process 134 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-09 06:54:39,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2025-03-09 06:54:39,745 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-09 06:54:39,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:39,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:39,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:39,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:39,755 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:39,755 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:39,757 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:39,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Ended with exit code 0 [2025-03-09 06:54:39,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:39,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:39,764 INFO L229 MonitoredProcess]: Starting monitored process 135 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-09 06:54:39,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2025-03-09 06:54:39,766 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-09 06:54:39,776 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:39,776 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:39,776 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:39,776 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:39,776 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:39,776 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:39,776 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:39,777 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:39,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Ended with exit code 0 [2025-03-09 06:54:39,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:39,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:39,784 INFO L229 MonitoredProcess]: Starting monitored process 136 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-09 06:54:39,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2025-03-09 06:54:39,785 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-09 06:54:39,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:39,795 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:39,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:39,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:39,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:39,795 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:39,795 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:39,796 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:39,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Ended with exit code 0 [2025-03-09 06:54:39,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:39,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:39,803 INFO L229 MonitoredProcess]: Starting monitored process 137 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-09 06:54:39,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2025-03-09 06:54:39,805 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-09 06:54:39,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:39,814 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:39,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:39,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:39,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:39,815 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:39,815 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:39,816 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:39,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Ended with exit code 0 [2025-03-09 06:54:39,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:39,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:39,823 INFO L229 MonitoredProcess]: Starting monitored process 138 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-09 06:54:39,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2025-03-09 06:54:39,824 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-09 06:54:39,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:39,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:39,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:39,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:39,835 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:39,835 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:39,837 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:39,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Ended with exit code 0 [2025-03-09 06:54:39,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:39,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:39,846 INFO L229 MonitoredProcess]: Starting monitored process 139 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-09 06:54:39,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2025-03-09 06:54:39,848 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-09 06:54:39,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:39,858 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:39,858 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:39,858 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:39,859 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:39,859 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:39,863 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:39,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Ended with exit code 0 [2025-03-09 06:54:39,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:39,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:39,870 INFO L229 MonitoredProcess]: Starting monitored process 140 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-09 06:54:39,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2025-03-09 06:54:39,872 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-09 06:54:39,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:39,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:39,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:39,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:39,882 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:39,882 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:39,884 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:39,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Ended with exit code 0 [2025-03-09 06:54:39,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:39,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:39,891 INFO L229 MonitoredProcess]: Starting monitored process 141 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-09 06:54:39,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2025-03-09 06:54:39,893 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-09 06:54:39,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:39,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:39,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:39,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:39,904 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:39,904 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:39,907 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:39,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Ended with exit code 0 [2025-03-09 06:54:39,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:39,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:39,915 INFO L229 MonitoredProcess]: Starting monitored process 142 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-09 06:54:39,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2025-03-09 06:54:39,916 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-09 06:54:39,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:39,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:39,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:39,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:39,927 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:39,927 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:39,931 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:39,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Ended with exit code 0 [2025-03-09 06:54:39,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:39,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:39,938 INFO L229 MonitoredProcess]: Starting monitored process 143 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-09 06:54:39,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Waiting until timeout for monitored process [2025-03-09 06:54:39,940 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-09 06:54:39,950 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:39,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:39,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:39,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:39,951 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:39,951 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:39,956 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:39,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Ended with exit code 0 [2025-03-09 06:54:39,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:39,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:39,964 INFO L229 MonitoredProcess]: Starting monitored process 144 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-09 06:54:39,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2025-03-09 06:54:39,965 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-09 06:54:39,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:39,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:39,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:39,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:39,977 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:39,977 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:39,982 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:39,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Ended with exit code 0 [2025-03-09 06:54:39,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:39,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:39,989 INFO L229 MonitoredProcess]: Starting monitored process 145 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-09 06:54:39,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process [2025-03-09 06:54:39,991 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-09 06:54:40,001 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:40,001 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:40,001 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:40,001 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:40,003 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:40,003 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:40,006 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:40,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Ended with exit code 0 [2025-03-09 06:54:40,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:40,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:40,013 INFO L229 MonitoredProcess]: Starting monitored process 146 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-09 06:54:40,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Waiting until timeout for monitored process [2025-03-09 06:54:40,015 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-09 06:54:40,025 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:40,025 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:40,025 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:40,025 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:40,026 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:40,026 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:40,029 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:40,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Ended with exit code 0 [2025-03-09 06:54:40,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:40,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:40,037 INFO L229 MonitoredProcess]: Starting monitored process 147 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-09 06:54:40,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Waiting until timeout for monitored process [2025-03-09 06:54:40,039 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-09 06:54:40,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:40,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:40,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:40,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:40,053 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:40,053 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:40,057 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:54:40,067 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-03-09 06:54:40,067 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-03-09 06:54:40,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:40,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:40,070 INFO L229 MonitoredProcess]: Starting monitored process 148 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-09 06:54:40,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Waiting until timeout for monitored process [2025-03-09 06:54:40,072 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:54:40,082 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:54:40,082 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:54:40,082 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 36))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 36))_1 Supporting invariants [] [2025-03-09 06:54:40,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Ended with exit code 0 [2025-03-09 06:54:40,165 INFO L156 tatePredicateManager]: 22 out of 23 supporting invariants were superfluous and have been removed [2025-03-09 06:54:40,167 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-09 06:54:40,167 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-09 06:54:40,167 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2025-03-09 06:54:40,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:40,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-09 06:54:40,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-09 06:54:40,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:40,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:40,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-09 06:54:40,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:40,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:40,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:40,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:40,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:40,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:54:40,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:40,393 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-09 06:54:40,394 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.11 stem predicates 2 loop predicates [2025-03-09 06:54:40,394 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 86 states and 109 transitions. cyclomatic complexity: 35 Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 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-09 06:54:40,414 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 86 states and 109 transitions. cyclomatic complexity: 35. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 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 87 states and 111 transitions. Complement of second has 4 states. [2025-03-09 06:54:40,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-09 06:54:40,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 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-09 06:54:40,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2025-03-09 06:54:40,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 73 letters. Loop has 2 letters. [2025-03-09 06:54:40,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:40,415 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:54:40,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:40,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-09 06:54:40,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-09 06:54:40,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:40,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:40,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-09 06:54:40,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:40,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:40,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:40,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:40,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:40,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:54:40,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:40,626 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-09 06:54:40,626 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.11 stem predicates 2 loop predicates [2025-03-09 06:54:40,626 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 86 states and 109 transitions. cyclomatic complexity: 35 Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 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-09 06:54:40,643 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 86 states and 109 transitions. cyclomatic complexity: 35. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 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 87 states and 111 transitions. Complement of second has 4 states. [2025-03-09 06:54:40,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-09 06:54:40,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 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-09 06:54:40,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2025-03-09 06:54:40,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 73 letters. Loop has 2 letters. [2025-03-09 06:54:40,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:40,643 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:54:40,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:40,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-09 06:54:40,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-09 06:54:40,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:40,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:40,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-09 06:54:40,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:40,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:40,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:40,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:40,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:40,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:54:40,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:40,905 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-09 06:54:40,905 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.11 stem predicates 2 loop predicates [2025-03-09 06:54:40,905 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 86 states and 109 transitions. cyclomatic complexity: 35 Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 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-09 06:54:40,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Forceful destruction successful, exit code 0 [2025-03-09 06:54:41,102 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 86 states and 109 transitions. cyclomatic complexity: 35. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 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 109 states and 144 transitions. Complement of second has 26 states. [2025-03-09 06:54:41,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 11 stem states 2 non-accepting loop states 2 accepting loop states [2025-03-09 06:54:41,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 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-09 06:54:41,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 80 transitions. [2025-03-09 06:54:41,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 80 transitions. Stem has 73 letters. Loop has 2 letters. [2025-03-09 06:54:41,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:41,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 80 transitions. Stem has 75 letters. Loop has 2 letters. [2025-03-09 06:54:41,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:41,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 80 transitions. Stem has 73 letters. Loop has 4 letters. [2025-03-09 06:54:41,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:41,104 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 144 transitions. [2025-03-09 06:54:41,104 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:54:41,105 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 104 states and 137 transitions. [2025-03-09 06:54:41,105 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-09 06:54:41,105 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-09 06:54:41,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 137 transitions. [2025-03-09 06:54:41,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:54:41,105 INFO L218 hiAutomatonCegarLoop]: Abstraction has 104 states and 137 transitions. [2025-03-09 06:54:41,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 137 transitions. [2025-03-09 06:54:41,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 91. [2025-03-09 06:54:41,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 91 states have (on average 1.2637362637362637) internal successors, (115), 90 states have internal predecessors, (115), 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-09 06:54:41,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 115 transitions. [2025-03-09 06:54:41,106 INFO L240 hiAutomatonCegarLoop]: Abstraction has 91 states and 115 transitions. [2025-03-09 06:54:41,106 INFO L432 stractBuchiCegarLoop]: Abstraction has 91 states and 115 transitions. [2025-03-09 06:54:41,106 INFO L338 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2025-03-09 06:54:41,107 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 115 transitions. [2025-03-09 06:54:41,107 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:54:41,107 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:54:41,107 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:54:41,107 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-03-09 06:54:41,107 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:54:41,108 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-03-09 06:54:41,108 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem6#1 > 0;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" [2025-03-09 06:54:41,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:41,108 INFO L85 PathProgramCache]: Analyzing trace with hash 861094024, now seen corresponding path program 20 times [2025-03-09 06:54:41,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:41,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033899301] [2025-03-09 06:54:41,108 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:54:41,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:41,114 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-03-09 06:54:41,119 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-03-09 06:54:41,119 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:54:41,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:41,404 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 153 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:54:41,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:54:41,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033899301] [2025-03-09 06:54:41,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033899301] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:54:41,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561125381] [2025-03-09 06:54:41,404 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:54:41,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:54:41,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:41,406 INFO L229 MonitoredProcess]: Starting monitored process 149 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:54:41,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (149)] Waiting until timeout for monitored process [2025-03-09 06:54:41,474 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-03-09 06:54:41,494 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-03-09 06:54:41,494 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:54:41,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:41,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-09 06:54:41,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:41,760 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 190 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:54:41,761 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:54:41,967 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 190 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:54:41,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561125381] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:54:41,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:54:41,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 36 [2025-03-09 06:54:41,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20185506] [2025-03-09 06:54:41,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:54:41,967 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:54:41,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:41,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 20 times [2025-03-09 06:54:41,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:41,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621225351] [2025-03-09 06:54:41,967 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:54:41,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:41,969 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:41,970 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:41,970 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:54:41,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:41,970 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:54:41,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:41,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:41,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:41,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:41,972 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:54:41,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:54:41,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-09 06:54:41,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=1017, Unknown=0, NotChecked=0, Total=1332 [2025-03-09 06:54:42,000 INFO L87 Difference]: Start difference. First operand 91 states and 115 transitions. cyclomatic complexity: 37 Second operand has 37 states, 36 states have (on average 3.5555555555555554) internal successors, (128), 37 states have internal predecessors, (128), 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-09 06:54:42,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:54:42,208 INFO L93 Difference]: Finished difference Result 147 states and 183 transitions. [2025-03-09 06:54:42,208 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 147 states and 183 transitions. [2025-03-09 06:54:42,208 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:54:42,209 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 147 states to 96 states and 122 transitions. [2025-03-09 06:54:42,209 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-09 06:54:42,209 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-09 06:54:42,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 96 states and 122 transitions. [2025-03-09 06:54:42,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:54:42,209 INFO L218 hiAutomatonCegarLoop]: Abstraction has 96 states and 122 transitions. [2025-03-09 06:54:42,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states and 122 transitions. [2025-03-09 06:54:42,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2025-03-09 06:54:42,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 93 states have internal predecessors, (119), 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-09 06:54:42,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 119 transitions. [2025-03-09 06:54:42,210 INFO L240 hiAutomatonCegarLoop]: Abstraction has 94 states and 119 transitions. [2025-03-09 06:54:42,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-09 06:54:42,211 INFO L432 stractBuchiCegarLoop]: Abstraction has 94 states and 119 transitions. [2025-03-09 06:54:42,211 INFO L338 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2025-03-09 06:54:42,211 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 119 transitions. [2025-03-09 06:54:42,211 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:54:42,211 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:54:42,211 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:54:42,212 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-03-09 06:54:42,212 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:54:42,212 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-03-09 06:54:42,212 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem6#1 > 0;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" [2025-03-09 06:54:42,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:42,212 INFO L85 PathProgramCache]: Analyzing trace with hash -165458072, now seen corresponding path program 21 times [2025-03-09 06:54:42,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:42,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845583215] [2025-03-09 06:54:42,212 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:54:42,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:42,218 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 80 statements into 12 equivalence classes. [2025-03-09 06:54:42,246 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) and asserted 80 of 80 statements. [2025-03-09 06:54:42,246 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-03-09 06:54:42,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:42,246 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:54:42,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-09 06:54:42,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-09 06:54:42,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:42,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:42,267 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:54:42,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:42,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 21 times [2025-03-09 06:54:42,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:42,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264866149] [2025-03-09 06:54:42,267 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:54:42,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:42,269 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:42,270 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:42,270 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 06:54:42,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:42,270 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:54:42,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:42,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:42,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:42,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:42,272 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:54:42,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:42,272 INFO L85 PathProgramCache]: Analyzing trace with hash -91416953, now seen corresponding path program 10 times [2025-03-09 06:54:42,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:42,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941565669] [2025-03-09 06:54:42,272 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:54:42,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:42,279 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 82 statements into 2 equivalence classes. [2025-03-09 06:54:42,296 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 82 of 82 statements. [2025-03-09 06:54:42,296 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:54:42,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:42,296 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:54:42,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-09 06:54:42,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-09 06:54:42,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:42,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:42,313 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:54:53,297 WARN L286 SmtUtils]: Spent 10.96s on a formula simplification. DAG size of input: 355 DAG size of output: 260 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-03-09 06:54:53,476 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:54:53,476 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:54:53,476 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:54:53,476 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:54:53,476 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:54:53,476 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:53,476 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:54:53,476 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:54:53,476 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration25_Lasso [2025-03-09 06:54:53,476 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:54:53,476 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:54:53,477 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:53,480 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:53,481 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:53,483 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:53,485 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:53,486 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:53,487 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:53,489 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:53,490 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:53,491 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:53,493 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:53,495 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:53,496 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:53,497 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:53,499 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:53,500 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:53,912 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:54:53,912 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:54:53,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:53,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:53,914 INFO L229 MonitoredProcess]: Starting monitored process 150 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-09 06:54:53,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Waiting until timeout for monitored process [2025-03-09 06:54:53,915 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-09 06:54:53,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:53,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:53,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:53,925 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:53,926 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:53,926 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:53,928 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:53,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Ended with exit code 0 [2025-03-09 06:54:53,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:53,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:53,935 INFO L229 MonitoredProcess]: Starting monitored process 151 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-09 06:54:53,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Waiting until timeout for monitored process [2025-03-09 06:54:53,936 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-09 06:54:53,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:53,946 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:53,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:53,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:53,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:53,946 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:53,946 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:53,947 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:53,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Ended with exit code 0 [2025-03-09 06:54:53,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:53,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:53,955 INFO L229 MonitoredProcess]: Starting monitored process 152 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-09 06:54:53,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Waiting until timeout for monitored process [2025-03-09 06:54:53,956 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-09 06:54:53,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:53,966 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:53,966 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:53,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:53,966 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:53,966 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:53,969 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:53,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Ended with exit code 0 [2025-03-09 06:54:53,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:53,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:53,975 INFO L229 MonitoredProcess]: Starting monitored process 153 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-09 06:54:53,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Waiting until timeout for monitored process [2025-03-09 06:54:53,977 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-09 06:54:53,986 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:53,986 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:53,986 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:53,986 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:53,987 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:53,987 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:53,989 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:53,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Ended with exit code 0 [2025-03-09 06:54:53,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:53,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:53,996 INFO L229 MonitoredProcess]: Starting monitored process 154 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-09 06:54:53,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Waiting until timeout for monitored process [2025-03-09 06:54:53,997 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-09 06:54:54,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:54,007 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:54,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:54,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:54,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:54,007 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:54,007 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:54,008 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:54,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Ended with exit code 0 [2025-03-09 06:54:54,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:54,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:54,015 INFO L229 MonitoredProcess]: Starting monitored process 155 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-09 06:54:54,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Waiting until timeout for monitored process [2025-03-09 06:54:54,017 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-09 06:54:54,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:54,026 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:54,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:54,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:54,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:54,027 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:54,027 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:54,027 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:54,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Ended with exit code 0 [2025-03-09 06:54:54,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:54,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:54,035 INFO L229 MonitoredProcess]: Starting monitored process 156 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-09 06:54:54,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Waiting until timeout for monitored process [2025-03-09 06:54:54,037 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-09 06:54:54,046 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:54,046 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:54,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:54,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:54,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:54,046 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:54,046 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:54,047 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:54,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Forceful destruction successful, exit code 0 [2025-03-09 06:54:54,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:54,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:54,055 INFO L229 MonitoredProcess]: Starting monitored process 157 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-09 06:54:54,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Waiting until timeout for monitored process [2025-03-09 06:54:54,056 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-09 06:54:54,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:54,065 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:54,066 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:54,066 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:54,066 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:54,066 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:54,066 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:54,067 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:54,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Ended with exit code 0 [2025-03-09 06:54:54,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:54,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:54,074 INFO L229 MonitoredProcess]: Starting monitored process 158 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-09 06:54:54,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Waiting until timeout for monitored process [2025-03-09 06:54:54,075 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-09 06:54:54,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:54,085 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:54,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:54,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:54,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:54,085 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:54,085 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:54,086 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:54,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Forceful destruction successful, exit code 0 [2025-03-09 06:54:54,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:54,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:54,093 INFO L229 MonitoredProcess]: Starting monitored process 159 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-09 06:54:54,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Waiting until timeout for monitored process [2025-03-09 06:54:54,094 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-09 06:54:54,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:54,104 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:54,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:54,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:54,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:54,104 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:54,104 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:54,105 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:54,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Ended with exit code 0 [2025-03-09 06:54:54,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:54,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:54,112 INFO L229 MonitoredProcess]: Starting monitored process 160 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-09 06:54:54,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Waiting until timeout for monitored process [2025-03-09 06:54:54,115 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:54:54,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:54,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:54,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:54,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:54,125 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:54,125 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:54,127 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:54,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Forceful destruction successful, exit code 0 [2025-03-09 06:54:54,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:54,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:54,135 INFO L229 MonitoredProcess]: Starting monitored process 161 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-09 06:54:54,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Waiting until timeout for monitored process [2025-03-09 06:54:54,136 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-09 06:54:54,146 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:54,146 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:54,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:54,146 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:54,146 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:54,146 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:54,146 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:54,147 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:54,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Ended with exit code 0 [2025-03-09 06:54:54,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:54,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:54,155 INFO L229 MonitoredProcess]: Starting monitored process 162 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-09 06:54:54,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Waiting until timeout for monitored process [2025-03-09 06:54:54,157 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-09 06:54:54,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:54,166 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:54,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:54,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:54,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:54,166 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:54,166 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:54,167 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:54,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Ended with exit code 0 [2025-03-09 06:54:54,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:54,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:54,174 INFO L229 MonitoredProcess]: Starting monitored process 163 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-09 06:54:54,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Waiting until timeout for monitored process [2025-03-09 06:54:54,176 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-09 06:54:54,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:54,185 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:54,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:54,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:54,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:54,185 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:54,185 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:54,186 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:54,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Ended with exit code 0 [2025-03-09 06:54:54,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:54,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:54,193 INFO L229 MonitoredProcess]: Starting monitored process 164 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-09 06:54:54,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Waiting until timeout for monitored process [2025-03-09 06:54:54,194 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-09 06:54:54,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:54,204 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:54,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:54,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:54,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:54,204 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:54,204 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:54,205 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:54,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Ended with exit code 0 [2025-03-09 06:54:54,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:54,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:54,212 INFO L229 MonitoredProcess]: Starting monitored process 165 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-09 06:54:54,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Waiting until timeout for monitored process [2025-03-09 06:54:54,214 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-09 06:54:54,223 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:54,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:54,223 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:54,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:54,224 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:54,224 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:54,226 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:54,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Ended with exit code 0 [2025-03-09 06:54:54,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:54,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:54,233 INFO L229 MonitoredProcess]: Starting monitored process 166 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-09 06:54:54,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Waiting until timeout for monitored process [2025-03-09 06:54:54,235 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-09 06:54:54,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:54,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:54,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:54,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:54,245 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:54,245 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:54,247 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:54,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Ended with exit code 0 [2025-03-09 06:54:54,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:54,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:54,254 INFO L229 MonitoredProcess]: Starting monitored process 167 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-09 06:54:54,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Waiting until timeout for monitored process [2025-03-09 06:54:54,256 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-09 06:54:54,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:54,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:54,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:54,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:54,267 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:54,267 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:54,272 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:54,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Ended with exit code 0 [2025-03-09 06:54:54,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:54,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:54,280 INFO L229 MonitoredProcess]: Starting monitored process 168 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-09 06:54:54,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Waiting until timeout for monitored process [2025-03-09 06:54:54,281 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-09 06:54:54,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:54,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:54,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:54,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:54,292 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:54,292 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:54,294 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:54,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Ended with exit code 0 [2025-03-09 06:54:54,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:54,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:54,301 INFO L229 MonitoredProcess]: Starting monitored process 169 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-09 06:54:54,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Waiting until timeout for monitored process [2025-03-09 06:54:54,303 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-09 06:54:54,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:54,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:54,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:54,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:54,313 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:54,313 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:54,315 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:54,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Ended with exit code 0 [2025-03-09 06:54:54,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:54,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:54,323 INFO L229 MonitoredProcess]: Starting monitored process 170 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-09 06:54:54,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Waiting until timeout for monitored process [2025-03-09 06:54:54,325 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-09 06:54:54,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:54,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:54,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:54,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:54,335 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:54,335 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:54,337 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:54,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Ended with exit code 0 [2025-03-09 06:54:54,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:54,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:54,345 INFO L229 MonitoredProcess]: Starting monitored process 171 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-09 06:54:54,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Waiting until timeout for monitored process [2025-03-09 06:54:54,346 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-09 06:54:54,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:54,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:54,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:54,355 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:54,356 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:54,356 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:54,358 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:54,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Ended with exit code 0 [2025-03-09 06:54:54,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:54,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:54,365 INFO L229 MonitoredProcess]: Starting monitored process 172 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-09 06:54:54,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Waiting until timeout for monitored process [2025-03-09 06:54:54,367 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-09 06:54:54,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:54,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:54,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:54,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:54,377 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:54,377 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:54,379 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:54,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Ended with exit code 0 [2025-03-09 06:54:54,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:54,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:54,386 INFO L229 MonitoredProcess]: Starting monitored process 173 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-09 06:54:54,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Waiting until timeout for monitored process [2025-03-09 06:54:54,387 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-09 06:54:54,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:54,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:54,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:54,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:54,399 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:54,399 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:54,402 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:54,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Forceful destruction successful, exit code 0 [2025-03-09 06:54:54,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:54,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:54,410 INFO L229 MonitoredProcess]: Starting monitored process 174 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-09 06:54:54,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Waiting until timeout for monitored process [2025-03-09 06:54:54,411 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-09 06:54:54,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:54,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:54,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:54,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:54,421 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:54,421 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:54,424 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:54,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Ended with exit code 0 [2025-03-09 06:54:54,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:54,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:54,431 INFO L229 MonitoredProcess]: Starting monitored process 175 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-09 06:54:54,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Waiting until timeout for monitored process [2025-03-09 06:54:54,433 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-09 06:54:54,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:54,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:54,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:54,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:54,443 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:54,443 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:54,445 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:54,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Forceful destruction successful, exit code 0 [2025-03-09 06:54:54,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:54,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:54,453 INFO L229 MonitoredProcess]: Starting monitored process 176 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-09 06:54:54,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Waiting until timeout for monitored process [2025-03-09 06:54:54,454 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-09 06:54:54,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:54,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:54,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:54,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:54,465 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:54,465 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:54,467 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:54,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Ended with exit code 0 [2025-03-09 06:54:54,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:54,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:54,475 INFO L229 MonitoredProcess]: Starting monitored process 177 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-09 06:54:54,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Waiting until timeout for monitored process [2025-03-09 06:54:54,477 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-09 06:54:54,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:54,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:54,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:54,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:54,487 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:54,487 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:54,491 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:54,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Ended with exit code 0 [2025-03-09 06:54:54,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:54,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:54,498 INFO L229 MonitoredProcess]: Starting monitored process 178 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-09 06:54:54,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Waiting until timeout for monitored process [2025-03-09 06:54:54,500 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-09 06:54:54,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:54,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:54,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:54,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:54,511 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:54,511 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:54,515 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:54:54,522 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-03-09 06:54:54,522 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-03-09 06:54:54,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:54,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:54,524 INFO L229 MonitoredProcess]: Starting monitored process 179 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-09 06:54:54,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Waiting until timeout for monitored process [2025-03-09 06:54:54,525 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:54:54,535 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:54:54,535 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:54:54,535 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 40)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 40)_1 Supporting invariants [] [2025-03-09 06:54:54,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Ended with exit code 0 [2025-03-09 06:54:54,557 INFO L156 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2025-03-09 06:54:54,559 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-09 06:54:54,559 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-09 06:54:54,559 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2025-03-09 06:54:54,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:54,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-09 06:54:54,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-09 06:54:54,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:54,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:54,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-09 06:54:54,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:54,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:54,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:54,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:54,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:54,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:54:54,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:54,909 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-09 06:54:54,909 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.13 stem predicates 2 loop predicates [2025-03-09 06:54:54,910 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 119 transitions. cyclomatic complexity: 38 Second operand has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 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-09 06:54:54,945 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 119 transitions. cyclomatic complexity: 38. Second operand has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 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 95 states and 121 transitions. Complement of second has 5 states. [2025-03-09 06:54:54,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-09 06:54:54,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 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-09 06:54:54,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2025-03-09 06:54:54,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 80 letters. Loop has 2 letters. [2025-03-09 06:54:54,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:54,946 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:54:54,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:54,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-09 06:54:54,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-09 06:54:54,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:54,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:54,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-09 06:54:54,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:55,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Forceful destruction successful, exit code 0 [2025-03-09 06:54:55,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:55,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:55,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:55,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:55,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:54:55,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:55,314 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-09 06:54:55,314 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.13 stem predicates 2 loop predicates [2025-03-09 06:54:55,315 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 119 transitions. cyclomatic complexity: 38 Second operand has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 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-09 06:54:55,351 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 119 transitions. cyclomatic complexity: 38. Second operand has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 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 95 states and 121 transitions. Complement of second has 5 states. [2025-03-09 06:54:55,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-09 06:54:55,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 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-09 06:54:55,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2025-03-09 06:54:55,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 80 letters. Loop has 2 letters. [2025-03-09 06:54:55,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:55,351 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:54:55,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:55,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-09 06:54:55,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-09 06:54:55,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:55,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:55,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-09 06:54:55,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:55,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:55,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:55,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:55,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:55,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:54:55,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:55,701 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-09 06:54:55,702 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.13 stem predicates 2 loop predicates [2025-03-09 06:54:55,702 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 119 transitions. cyclomatic complexity: 38 Second operand has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 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-09 06:54:55,972 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 119 transitions. cyclomatic complexity: 38. Second operand has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 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 118 states and 156 transitions. Complement of second has 29 states. [2025-03-09 06:54:55,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 13 stem states 2 non-accepting loop states 2 accepting loop states [2025-03-09 06:54:55,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 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-09 06:54:55,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 86 transitions. [2025-03-09 06:54:55,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 86 transitions. Stem has 80 letters. Loop has 2 letters. [2025-03-09 06:54:55,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:55,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 86 transitions. Stem has 82 letters. Loop has 2 letters. [2025-03-09 06:54:55,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:55,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 86 transitions. Stem has 80 letters. Loop has 4 letters. [2025-03-09 06:54:55,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:55,973 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 156 transitions. [2025-03-09 06:54:55,974 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:54:55,974 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 113 states and 149 transitions. [2025-03-09 06:54:55,974 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-09 06:54:55,974 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-09 06:54:55,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 149 transitions. [2025-03-09 06:54:55,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:54:55,974 INFO L218 hiAutomatonCegarLoop]: Abstraction has 113 states and 149 transitions. [2025-03-09 06:54:55,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 149 transitions. [2025-03-09 06:54:55,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 99. [2025-03-09 06:54:55,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 99 states have (on average 1.2626262626262625) internal successors, (125), 98 states have internal predecessors, (125), 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-09 06:54:55,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 125 transitions. [2025-03-09 06:54:55,975 INFO L240 hiAutomatonCegarLoop]: Abstraction has 99 states and 125 transitions. [2025-03-09 06:54:55,975 INFO L432 stractBuchiCegarLoop]: Abstraction has 99 states and 125 transitions. [2025-03-09 06:54:55,976 INFO L338 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2025-03-09 06:54:55,976 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 125 transitions. [2025-03-09 06:54:55,976 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:54:55,976 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:54:55,976 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:54:55,976 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1] [2025-03-09 06:54:55,977 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:54:55,977 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-03-09 06:54:55,977 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem6#1 > 0;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" [2025-03-09 06:54:55,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:55,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1952346739, now seen corresponding path program 22 times [2025-03-09 06:54:55,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:55,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204568846] [2025-03-09 06:54:55,977 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:54:55,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:55,983 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 84 statements into 2 equivalence classes. [2025-03-09 06:54:55,987 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 83 of 84 statements. [2025-03-09 06:54:55,987 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 06:54:55,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:56,310 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 190 proven. 217 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:54:56,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:54:56,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204568846] [2025-03-09 06:54:56,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204568846] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:54:56,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946138229] [2025-03-09 06:54:56,313 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:54:56,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:54:56,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:56,314 INFO L229 MonitoredProcess]: Starting monitored process 180 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:54:56,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (180)] Waiting until timeout for monitored process [2025-03-09 06:54:56,383 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 84 statements into 2 equivalence classes. [2025-03-09 06:54:56,400 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 83 of 84 statements. [2025-03-09 06:54:56,400 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 06:54:56,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:56,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-09 06:54:56,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:56,678 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 231 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:54:56,679 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:54:56,911 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 231 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:54:56,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946138229] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:54:56,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:54:56,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 39 [2025-03-09 06:54:56,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874032196] [2025-03-09 06:54:56,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:54:56,912 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:54:56,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:56,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 22 times [2025-03-09 06:54:56,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:56,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963100614] [2025-03-09 06:54:56,912 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:54:56,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:56,915 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-03-09 06:54:56,916 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:56,916 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:54:56,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:56,916 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:54:56,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:56,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:56,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:56,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:56,919 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:54:56,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:54:56,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-09 06:54:56,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=1193, Unknown=0, NotChecked=0, Total=1560 [2025-03-09 06:54:56,945 INFO L87 Difference]: Start difference. First operand 99 states and 125 transitions. cyclomatic complexity: 40 Second operand has 40 states, 39 states have (on average 3.5641025641025643) internal successors, (139), 40 states have internal predecessors, (139), 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-09 06:54:57,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:54:57,128 INFO L93 Difference]: Finished difference Result 160 states and 199 transitions. [2025-03-09 06:54:57,128 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 160 states and 199 transitions. [2025-03-09 06:54:57,128 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:54:57,129 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 160 states to 104 states and 132 transitions. [2025-03-09 06:54:57,129 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-09 06:54:57,129 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-09 06:54:57,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 132 transitions. [2025-03-09 06:54:57,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:54:57,129 INFO L218 hiAutomatonCegarLoop]: Abstraction has 104 states and 132 transitions. [2025-03-09 06:54:57,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 132 transitions. [2025-03-09 06:54:57,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2025-03-09 06:54:57,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 102 states have (on average 1.2647058823529411) internal successors, (129), 101 states have internal predecessors, (129), 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-09 06:54:57,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 129 transitions. [2025-03-09 06:54:57,130 INFO L240 hiAutomatonCegarLoop]: Abstraction has 102 states and 129 transitions. [2025-03-09 06:54:57,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-09 06:54:57,131 INFO L432 stractBuchiCegarLoop]: Abstraction has 102 states and 129 transitions. [2025-03-09 06:54:57,131 INFO L338 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2025-03-09 06:54:57,131 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 129 transitions. [2025-03-09 06:54:57,132 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:54:57,132 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:54:57,132 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:54:57,132 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 12, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1] [2025-03-09 06:54:57,132 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:54:57,132 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-03-09 06:54:57,133 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem6#1 > 0;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" [2025-03-09 06:54:57,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:57,133 INFO L85 PathProgramCache]: Analyzing trace with hash 877462189, now seen corresponding path program 23 times [2025-03-09 06:54:57,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:57,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767081199] [2025-03-09 06:54:57,133 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:54:57,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:57,139 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 87 statements into 13 equivalence classes. [2025-03-09 06:54:57,174 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) and asserted 87 of 87 statements. [2025-03-09 06:54:57,174 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2025-03-09 06:54:57,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:57,174 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:54:57,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-09 06:54:57,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-09 06:54:57,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:57,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:57,192 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:54:57,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:57,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 23 times [2025-03-09 06:54:57,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:57,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573975354] [2025-03-09 06:54:57,193 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:54:57,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:57,199 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:57,200 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:57,200 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:54:57,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:57,200 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:54:57,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:54:57,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:54:57,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:57,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:57,202 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:54:57,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:57,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1427573900, now seen corresponding path program 11 times [2025-03-09 06:54:57,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:57,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823424976] [2025-03-09 06:54:57,203 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:54:57,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:57,210 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 89 statements into 13 equivalence classes. [2025-03-09 06:54:57,241 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) and asserted 89 of 89 statements. [2025-03-09 06:54:57,242 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2025-03-09 06:54:57,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:57,242 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:54:57,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-09 06:54:57,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-09 06:54:57,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:57,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:57,274 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:55:07,122 WARN L286 SmtUtils]: Spent 9.82s on a formula simplification. DAG size of input: 384 DAG size of output: 284 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-03-09 06:55:08,430 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:55:08,430 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:55:08,430 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:55:08,430 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:55:08,430 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:55:08,430 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:08,430 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:55:08,430 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:55:08,430 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration27_Lasso [2025-03-09 06:55:08,430 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:55:08,430 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:55:08,431 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:08,433 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:08,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:08,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:08,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:08,440 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:08,442 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:08,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:08,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:08,446 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:08,448 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:10,083 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:10,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:10,085 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:10,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:10,363 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:55:10,363 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:55:10,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:10,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:10,365 INFO L229 MonitoredProcess]: Starting monitored process 181 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-09 06:55:10,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Waiting until timeout for monitored process [2025-03-09 06:55:10,369 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:55:10,379 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:10,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:10,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:10,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:10,383 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:55:10,383 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:55:10,387 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:10,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Ended with exit code 0 [2025-03-09 06:55:10,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:10,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:10,402 INFO L229 MonitoredProcess]: Starting monitored process 182 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-09 06:55:10,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Waiting until timeout for monitored process [2025-03-09 06:55:10,405 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-09 06:55:10,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:10,415 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:55:10,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:10,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:10,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:10,415 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:55:10,415 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:55:10,416 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:10,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Forceful destruction successful, exit code 0 [2025-03-09 06:55:10,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:10,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:10,425 INFO L229 MonitoredProcess]: Starting monitored process 183 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-09 06:55:10,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Waiting until timeout for monitored process [2025-03-09 06:55:10,429 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-09 06:55:10,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:10,440 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:55:10,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:10,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:10,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:10,440 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:55:10,440 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:55:10,442 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:10,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Forceful destruction successful, exit code 0 [2025-03-09 06:55:10,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:10,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:10,450 INFO L229 MonitoredProcess]: Starting monitored process 184 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-09 06:55:10,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Waiting until timeout for monitored process [2025-03-09 06:55:10,451 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-09 06:55:10,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:10,461 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:55:10,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:10,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:10,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:10,462 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:55:10,462 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:55:10,463 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:10,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Ended with exit code 0 [2025-03-09 06:55:10,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:10,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:10,471 INFO L229 MonitoredProcess]: Starting monitored process 185 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-09 06:55:10,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Waiting until timeout for monitored process [2025-03-09 06:55:10,473 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-09 06:55:10,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:10,483 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:55:10,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:10,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:10,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:10,483 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:55:10,483 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:55:10,484 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:10,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Ended with exit code 0 [2025-03-09 06:55:10,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:10,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:10,492 INFO L229 MonitoredProcess]: Starting monitored process 186 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-09 06:55:10,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Waiting until timeout for monitored process [2025-03-09 06:55:10,494 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-09 06:55:10,505 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:10,505 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:55:10,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:10,505 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:10,505 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:10,506 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:55:10,506 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:55:10,507 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:10,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Forceful destruction successful, exit code 0 [2025-03-09 06:55:10,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:10,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:10,515 INFO L229 MonitoredProcess]: Starting monitored process 187 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-09 06:55:10,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Waiting until timeout for monitored process [2025-03-09 06:55:10,516 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-09 06:55:10,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:10,526 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:55:10,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:10,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:10,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:10,526 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:55:10,526 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:55:10,527 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:10,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Forceful destruction successful, exit code 0 [2025-03-09 06:55:10,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:10,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:10,535 INFO L229 MonitoredProcess]: Starting monitored process 188 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-09 06:55:10,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Waiting until timeout for monitored process [2025-03-09 06:55:10,536 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-09 06:55:10,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:10,546 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:55:10,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:10,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:10,547 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:10,547 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:55:10,547 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:55:10,548 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:10,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Ended with exit code 0 [2025-03-09 06:55:10,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:10,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:10,556 INFO L229 MonitoredProcess]: Starting monitored process 189 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-09 06:55:10,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Waiting until timeout for monitored process [2025-03-09 06:55:10,557 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-09 06:55:10,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:10,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:10,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:10,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:10,568 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:55:10,568 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:55:10,570 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:10,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Ended with exit code 0 [2025-03-09 06:55:10,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:10,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:10,578 INFO L229 MonitoredProcess]: Starting monitored process 190 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-09 06:55:10,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Waiting until timeout for monitored process [2025-03-09 06:55:10,581 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-09 06:55:10,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:10,591 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:55:10,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:10,591 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:10,591 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:10,592 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:55:10,592 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:55:10,593 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:10,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Ended with exit code 0 [2025-03-09 06:55:10,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:10,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:10,600 INFO L229 MonitoredProcess]: Starting monitored process 191 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-09 06:55:10,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Waiting until timeout for monitored process [2025-03-09 06:55:10,602 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-09 06:55:10,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:10,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:10,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:10,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:10,613 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:55:10,613 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:55:10,615 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:10,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Ended with exit code 0 [2025-03-09 06:55:10,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:10,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:10,622 INFO L229 MonitoredProcess]: Starting monitored process 192 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-09 06:55:10,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Waiting until timeout for monitored process [2025-03-09 06:55:10,624 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-09 06:55:10,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:10,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:10,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:10,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:10,635 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:55:10,635 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:55:10,637 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:10,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Ended with exit code 0 [2025-03-09 06:55:10,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:10,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:10,645 INFO L229 MonitoredProcess]: Starting monitored process 193 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-09 06:55:10,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Waiting until timeout for monitored process [2025-03-09 06:55:10,646 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-09 06:55:10,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:10,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:10,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:10,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:10,658 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:55:10,658 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:55:10,660 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:10,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Ended with exit code 0 [2025-03-09 06:55:10,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:10,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:10,667 INFO L229 MonitoredProcess]: Starting monitored process 194 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-09 06:55:10,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Waiting until timeout for monitored process [2025-03-09 06:55:10,669 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-09 06:55:10,679 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:10,679 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:10,679 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:10,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:10,680 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:55:10,680 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:55:10,683 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:10,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Ended with exit code 0 [2025-03-09 06:55:10,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:10,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:10,690 INFO L229 MonitoredProcess]: Starting monitored process 195 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-09 06:55:10,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Waiting until timeout for monitored process [2025-03-09 06:55:10,692 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-09 06:55:10,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:10,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:10,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:10,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:10,703 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:55:10,703 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:55:10,707 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:10,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Ended with exit code 0 [2025-03-09 06:55:10,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:10,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:10,714 INFO L229 MonitoredProcess]: Starting monitored process 196 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-09 06:55:10,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Waiting until timeout for monitored process [2025-03-09 06:55:10,715 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-09 06:55:10,725 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:10,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:10,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:10,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:10,726 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:55:10,726 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:55:10,729 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:10,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Ended with exit code 0 [2025-03-09 06:55:10,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:10,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:10,736 INFO L229 MonitoredProcess]: Starting monitored process 197 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-09 06:55:10,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Waiting until timeout for monitored process [2025-03-09 06:55:10,737 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-09 06:55:10,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:10,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:10,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:10,747 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:10,748 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:55:10,748 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:55:10,751 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:10,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Ended with exit code 0 [2025-03-09 06:55:10,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:10,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:10,759 INFO L229 MonitoredProcess]: Starting monitored process 198 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-09 06:55:10,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Waiting until timeout for monitored process [2025-03-09 06:55:10,760 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:55:10,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:10,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:10,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:10,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:10,771 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:55:10,771 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:55:10,774 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:10,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Forceful destruction successful, exit code 0 [2025-03-09 06:55:10,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:10,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:10,782 INFO L229 MonitoredProcess]: Starting monitored process 199 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-09 06:55:10,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Waiting until timeout for monitored process [2025-03-09 06:55:10,783 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-09 06:55:10,793 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:10,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:10,793 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:10,793 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:10,794 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:55:10,794 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:55:10,796 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:10,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Ended with exit code 0 [2025-03-09 06:55:10,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:10,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:10,804 INFO L229 MonitoredProcess]: Starting monitored process 200 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-09 06:55:10,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Waiting until timeout for monitored process [2025-03-09 06:55:10,806 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-09 06:55:10,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:10,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:10,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:10,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:10,818 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:55:10,818 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:55:10,824 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:10,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Ended with exit code 0 [2025-03-09 06:55:10,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:10,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:10,832 INFO L229 MonitoredProcess]: Starting monitored process 201 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-09 06:55:10,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Waiting until timeout for monitored process [2025-03-09 06:55:10,838 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-09 06:55:10,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:10,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:10,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:10,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:10,850 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:55:10,850 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:55:10,853 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:10,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Ended with exit code 0 [2025-03-09 06:55:10,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:10,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:10,860 INFO L229 MonitoredProcess]: Starting monitored process 202 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-09 06:55:10,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Waiting until timeout for monitored process [2025-03-09 06:55:10,862 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-09 06:55:10,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:10,872 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:10,872 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:10,872 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:10,873 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:55:10,873 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:55:10,877 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:10,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Forceful destruction successful, exit code 0 [2025-03-09 06:55:10,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:10,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:10,884 INFO L229 MonitoredProcess]: Starting monitored process 203 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-09 06:55:10,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (203)] Waiting until timeout for monitored process [2025-03-09 06:55:10,886 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-09 06:55:10,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:10,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:10,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:10,896 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:10,896 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:55:10,897 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:55:10,899 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:10,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (203)] Ended with exit code 0 [2025-03-09 06:55:10,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:10,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:10,907 INFO L229 MonitoredProcess]: Starting monitored process 204 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-09 06:55:10,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (204)] Waiting until timeout for monitored process [2025-03-09 06:55:10,908 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-09 06:55:10,918 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:10,918 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:10,918 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:10,918 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:10,919 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:55:10,919 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:55:10,922 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:10,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (204)] Ended with exit code 0 [2025-03-09 06:55:10,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:10,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:10,930 INFO L229 MonitoredProcess]: Starting monitored process 205 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-09 06:55:10,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (205)] Waiting until timeout for monitored process [2025-03-09 06:55:10,931 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-09 06:55:10,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:10,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:10,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:10,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:10,943 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:55:10,943 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:55:10,948 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:55:10,953 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-03-09 06:55:10,953 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-03-09 06:55:10,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:10,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:10,956 INFO L229 MonitoredProcess]: Starting monitored process 206 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-09 06:55:10,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (206)] Waiting until timeout for monitored process [2025-03-09 06:55:10,957 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:55:10,967 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:55:10,967 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:55:10,967 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ 44 ULTIMATE.start_main_~arr~0#1.offset))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ 44 ULTIMATE.start_main_~arr~0#1.offset))_1 Supporting invariants [] [2025-03-09 06:55:10,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (205)] Forceful destruction successful, exit code 0 [2025-03-09 06:55:10,994 INFO L156 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2025-03-09 06:55:10,995 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-09 06:55:10,995 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-09 06:55:10,995 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2025-03-09 06:55:11,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:11,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-09 06:55:11,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-09 06:55:11,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:11,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:55:11,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-09 06:55:11,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:55:11,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:55:11,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:55:11,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:11,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:55:11,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:55:11,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:55:11,243 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-09 06:55:11,243 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.13 stem predicates 2 loop predicates [2025-03-09 06:55:11,243 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 102 states and 129 transitions. cyclomatic complexity: 41 Second operand has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 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-09 06:55:11,263 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 102 states and 129 transitions. cyclomatic complexity: 41. Second operand has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 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) Result 103 states and 131 transitions. Complement of second has 4 states. [2025-03-09 06:55:11,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-09 06:55:11,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 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-09 06:55:11,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2025-03-09 06:55:11,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 87 letters. Loop has 2 letters. [2025-03-09 06:55:11,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:55:11,264 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:55:11,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:11,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-09 06:55:11,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-09 06:55:11,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:11,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:55:11,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-09 06:55:11,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:55:11,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:55:11,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:55:11,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:11,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:55:11,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:55:11,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:55:11,556 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-09 06:55:11,557 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.13 stem predicates 2 loop predicates [2025-03-09 06:55:11,557 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 102 states and 129 transitions. cyclomatic complexity: 41 Second operand has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 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-09 06:55:11,575 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 102 states and 129 transitions. cyclomatic complexity: 41. Second operand has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 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) Result 103 states and 131 transitions. Complement of second has 4 states. [2025-03-09 06:55:11,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-09 06:55:11,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 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-09 06:55:11,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2025-03-09 06:55:11,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 87 letters. Loop has 2 letters. [2025-03-09 06:55:11,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:55:11,576 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:55:11,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:11,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-09 06:55:11,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-09 06:55:11,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:11,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:55:11,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-09 06:55:11,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:55:11,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (206)] Forceful destruction successful, exit code 0 [2025-03-09 06:55:11,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:55:11,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:55:11,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:11,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:55:11,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:55:11,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:55:11,889 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-09 06:55:11,889 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.13 stem predicates 2 loop predicates [2025-03-09 06:55:11,889 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 102 states and 129 transitions. cyclomatic complexity: 41 Second operand has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 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-09 06:55:12,126 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 102 states and 129 transitions. cyclomatic complexity: 41. Second operand has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 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) Result 127 states and 168 transitions. Complement of second has 30 states. [2025-03-09 06:55:12,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 13 stem states 2 non-accepting loop states 2 accepting loop states [2025-03-09 06:55:12,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 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-09 06:55:12,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 92 transitions. [2025-03-09 06:55:12,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 92 transitions. Stem has 87 letters. Loop has 2 letters. [2025-03-09 06:55:12,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:55:12,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 92 transitions. Stem has 89 letters. Loop has 2 letters. [2025-03-09 06:55:12,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:55:12,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 92 transitions. Stem has 87 letters. Loop has 4 letters. [2025-03-09 06:55:12,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:55:12,127 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 168 transitions. [2025-03-09 06:55:12,127 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:55:12,128 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 122 states and 161 transitions. [2025-03-09 06:55:12,128 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-09 06:55:12,128 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-09 06:55:12,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 161 transitions. [2025-03-09 06:55:12,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:55:12,128 INFO L218 hiAutomatonCegarLoop]: Abstraction has 122 states and 161 transitions. [2025-03-09 06:55:12,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 161 transitions. [2025-03-09 06:55:12,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 107. [2025-03-09 06:55:12,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 107 states have (on average 1.2616822429906542) internal successors, (135), 106 states have internal predecessors, (135), 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-09 06:55:12,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 135 transitions. [2025-03-09 06:55:12,130 INFO L240 hiAutomatonCegarLoop]: Abstraction has 107 states and 135 transitions. [2025-03-09 06:55:12,130 INFO L432 stractBuchiCegarLoop]: Abstraction has 107 states and 135 transitions. [2025-03-09 06:55:12,130 INFO L338 stractBuchiCegarLoop]: ======== Iteration 28 ============ [2025-03-09 06:55:12,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 135 transitions. [2025-03-09 06:55:12,130 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:55:12,130 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:55:12,130 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:55:12,131 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1] [2025-03-09 06:55:12,131 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:55:12,131 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-03-09 06:55:12,131 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem6#1 > 0;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" [2025-03-09 06:55:12,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:12,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1803949650, now seen corresponding path program 24 times [2025-03-09 06:55:12,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:55:12,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113029722] [2025-03-09 06:55:12,131 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:55:12,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:55:12,138 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 91 statements into 13 equivalence classes. [2025-03-09 06:55:12,161 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) and asserted 91 of 91 statements. [2025-03-09 06:55:12,161 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2025-03-09 06:55:12,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:55:12,507 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 231 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:55:12,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:55:12,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113029722] [2025-03-09 06:55:12,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113029722] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:55:12,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926697731] [2025-03-09 06:55:12,508 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:55:12,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:55:12,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:12,509 INFO L229 MonitoredProcess]: Starting monitored process 207 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:55:12,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (207)] Waiting until timeout for monitored process [2025-03-09 06:55:12,596 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 91 statements into 13 equivalence classes. [2025-03-09 06:55:12,825 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) and asserted 91 of 91 statements. [2025-03-09 06:55:12,825 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2025-03-09 06:55:12,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:55:12,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-09 06:55:12,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:55:13,164 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 276 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:55:13,164 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:55:13,399 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 276 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:55:13,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926697731] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:55:13,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:55:13,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 42 [2025-03-09 06:55:13,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291311145] [2025-03-09 06:55:13,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:55:13,399 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:55:13,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:13,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 24 times [2025-03-09 06:55:13,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:55:13,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411990578] [2025-03-09 06:55:13,400 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:55:13,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:55:13,403 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:55:13,403 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:55:13,403 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-09 06:55:13,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:13,403 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:55:13,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:55:13,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:55:13,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:13,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:13,406 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:55:13,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:55:13,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-09 06:55:13,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=1383, Unknown=0, NotChecked=0, Total=1806 [2025-03-09 06:55:13,436 INFO L87 Difference]: Start difference. First operand 107 states and 135 transitions. cyclomatic complexity: 43 Second operand has 43 states, 42 states have (on average 3.5714285714285716) internal successors, (150), 43 states have internal predecessors, (150), 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-09 06:55:13,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:55:13,616 INFO L93 Difference]: Finished difference Result 173 states and 215 transitions. [2025-03-09 06:55:13,616 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 173 states and 215 transitions. [2025-03-09 06:55:13,617 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:55:13,617 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 173 states to 112 states and 142 transitions. [2025-03-09 06:55:13,617 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-09 06:55:13,617 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-09 06:55:13,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 112 states and 142 transitions. [2025-03-09 06:55:13,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:55:13,617 INFO L218 hiAutomatonCegarLoop]: Abstraction has 112 states and 142 transitions. [2025-03-09 06:55:13,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states and 142 transitions. [2025-03-09 06:55:13,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2025-03-09 06:55:13,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 110 states have (on average 1.2636363636363637) internal successors, (139), 109 states have internal predecessors, (139), 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-09 06:55:13,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 139 transitions. [2025-03-09 06:55:13,619 INFO L240 hiAutomatonCegarLoop]: Abstraction has 110 states and 139 transitions. [2025-03-09 06:55:13,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-09 06:55:13,619 INFO L432 stractBuchiCegarLoop]: Abstraction has 110 states and 139 transitions. [2025-03-09 06:55:13,619 INFO L338 stractBuchiCegarLoop]: ======== Iteration 29 ============ [2025-03-09 06:55:13,619 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 110 states and 139 transitions. [2025-03-09 06:55:13,620 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:55:13,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:55:13,620 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:55:13,620 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [13, 13, 13, 13, 12, 12, 12, 1, 1, 1, 1, 1, 1] [2025-03-09 06:55:13,620 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:55:13,620 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-03-09 06:55:13,621 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem6#1 > 0;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" [2025-03-09 06:55:13,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:13,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1574789838, now seen corresponding path program 25 times [2025-03-09 06:55:13,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:55:13,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081588210] [2025-03-09 06:55:13,621 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 06:55:13,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:55:13,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-09 06:55:13,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-09 06:55:13,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:13,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:13,640 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:55:13,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-09 06:55:13,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-09 06:55:13,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:13,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:13,664 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:55:13,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:13,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 25 times [2025-03-09 06:55:13,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:55:13,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502065867] [2025-03-09 06:55:13,664 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 06:55:13,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:55:13,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:55:13,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:55:13,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:13,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:13,669 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:55:13,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:55:13,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:55:13,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:13,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:13,670 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:55:13,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:13,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1544545839, now seen corresponding path program 12 times [2025-03-09 06:55:13,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:55:13,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799781683] [2025-03-09 06:55:13,671 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:55:13,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:55:13,679 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 96 statements into 14 equivalence classes. [2025-03-09 06:55:13,731 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) and asserted 96 of 96 statements. [2025-03-09 06:55:13,732 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2025-03-09 06:55:13,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:13,732 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:55:13,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-09 06:55:13,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-09 06:55:13,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:13,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:13,780 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace