./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/array02-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8fc3dc66 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/array-memsafety/array02-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6376f52a263bde0c709cb35a0d040626ae764c5527f8161f54a95df7802768d2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 20:01:18,302 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 20:01:18,358 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-17 20:01:18,364 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 20:01:18,364 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 20:01:18,364 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-17 20:01:18,385 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 20:01:18,386 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 20:01:18,386 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 20:01:18,387 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 20:01:18,387 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 20:01:18,387 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 20:01:18,388 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 20:01:18,388 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 20:01:18,388 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-17 20:01:18,388 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-17 20:01:18,388 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-17 20:01:18,388 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-17 20:01:18,388 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-17 20:01:18,388 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-17 20:01:18,388 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 20:01:18,389 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-17 20:01:18,389 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 20:01:18,389 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 20:01:18,389 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 20:01:18,389 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 20:01:18,389 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-17 20:01:18,389 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-17 20:01:18,389 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-17 20:01:18,389 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 20:01:18,389 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 20:01:18,389 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 20:01:18,389 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-17 20:01:18,389 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 20:01:18,390 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 20:01:18,390 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 20:01:18,390 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 20:01:18,390 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 20:01:18,390 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 20:01:18,390 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-17 20:01:18,390 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6376f52a263bde0c709cb35a0d040626ae764c5527f8161f54a95df7802768d2 [2025-03-17 20:01:18,604 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 20:01:18,609 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 20:01:18,611 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 20:01:18,612 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 20:01:18,612 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 20:01:18,613 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/array02-alloca-2.i [2025-03-17 20:01:19,727 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b45c90bc/1189aab4f8d14f9192d11c97d7fbcbaf/FLAGc0fe239f4 [2025-03-17 20:01:19,974 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 20:01:19,974 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/array02-alloca-2.i [2025-03-17 20:01:19,986 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b45c90bc/1189aab4f8d14f9192d11c97d7fbcbaf/FLAGc0fe239f4 [2025-03-17 20:01:20,004 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b45c90bc/1189aab4f8d14f9192d11c97d7fbcbaf [2025-03-17 20:01:20,006 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 20:01:20,007 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 20:01:20,009 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 20:01:20,009 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 20:01:20,012 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 20:01:20,012 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:01:20" (1/1) ... [2025-03-17 20:01:20,013 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e5fe1ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:01:20, skipping insertion in model container [2025-03-17 20:01:20,014 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:01:20" (1/1) ... [2025-03-17 20:01:20,039 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 20:01:20,249 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 20:01:20,257 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 20:01:20,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 20:01:20,312 INFO L204 MainTranslator]: Completed translation [2025-03-17 20:01:20,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:01:20 WrapperNode [2025-03-17 20:01:20,314 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 20:01:20,314 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 20:01:20,315 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 20:01:20,315 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 20:01:20,319 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:01:20" (1/1) ... [2025-03-17 20:01:20,329 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:01:20" (1/1) ... [2025-03-17 20:01:20,341 INFO L138 Inliner]: procedures = 116, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 61 [2025-03-17 20:01:20,342 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 20:01:20,343 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 20:01:20,343 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 20:01:20,343 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 20:01:20,348 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:01:20" (1/1) ... [2025-03-17 20:01:20,348 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:01:20" (1/1) ... [2025-03-17 20:01:20,351 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:01:20" (1/1) ... [2025-03-17 20:01:20,360 INFO L175 MemorySlicer]: Split 7 memory accesses to 1 slices as follows [7]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 3 writes are split as follows [3]. [2025-03-17 20:01:20,360 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:01:20" (1/1) ... [2025-03-17 20:01:20,360 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:01:20" (1/1) ... [2025-03-17 20:01:20,369 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:01:20" (1/1) ... [2025-03-17 20:01:20,370 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:01:20" (1/1) ... [2025-03-17 20:01:20,371 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:01:20" (1/1) ... [2025-03-17 20:01:20,371 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:01:20" (1/1) ... [2025-03-17 20:01:20,374 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 20:01:20,375 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 20:01:20,375 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 20:01:20,375 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 20:01:20,376 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:01:20" (1/1) ... [2025-03-17 20:01:20,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:20,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:20,400 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-17 20:01:20,402 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-17 20:01:20,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 20:01:20,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 20:01:20,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 20:01:20,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 20:01:20,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 20:01:20,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 20:01:20,482 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 20:01:20,483 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 20:01:20,603 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-03-17 20:01:20,603 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 20:01:20,609 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 20:01:20,610 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 20:01:20,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:01:20 BoogieIcfgContainer [2025-03-17 20:01:20,610 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 20:01:20,610 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-17 20:01:20,610 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-17 20:01:20,614 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-17 20:01:20,615 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:01:20,615 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.03 08:01:20" (1/3) ... [2025-03-17 20:01:20,616 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4f673ada and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 08:01:20, skipping insertion in model container [2025-03-17 20:01:20,616 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:01:20,616 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:01:20" (2/3) ... [2025-03-17 20:01:20,616 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4f673ada and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 08:01:20, skipping insertion in model container [2025-03-17 20:01:20,616 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:01:20,616 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:01:20" (3/3) ... [2025-03-17 20:01:20,617 INFO L363 chiAutomizerObserver]: Analyzing ICFG array02-alloca-2.i [2025-03-17 20:01:20,648 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-17 20:01:20,648 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-17 20:01:20,648 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-17 20:01:20,648 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-17 20:01:20,648 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-17 20:01:20,648 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-17 20:01:20,648 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-17 20:01:20,649 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-17 20:01:20,651 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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-17 20:01:20,661 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2025-03-17 20:01:20,661 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:01:20,661 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:01:20,664 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-17 20:01:20,664 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 20:01:20,664 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-17 20:01:20,664 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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-17 20:01:20,665 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2025-03-17 20:01:20,665 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:01:20,665 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:01:20,665 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-17 20:01:20,665 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 20:01:20,669 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" [2025-03-17 20:01:20,669 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" [2025-03-17 20:01:20,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:20,672 INFO L85 PathProgramCache]: Analyzing trace with hash 49617, now seen corresponding path program 1 times [2025-03-17 20:01:20,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:20,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506476707] [2025-03-17 20:01:20,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:01:20,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:20,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:01:20,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:01:20,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:20,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:20,741 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:20,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:01:20,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:01:20,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:20,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:20,758 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:20,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:20,760 INFO L85 PathProgramCache]: Analyzing trace with hash 47, now seen corresponding path program 1 times [2025-03-17 20:01:20,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:20,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931935962] [2025-03-17 20:01:20,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:01:20,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:20,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:01:20,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:01:20,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:20,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:20,767 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:20,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:01:20,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:01:20,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:20,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:20,771 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:20,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:20,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1538143, now seen corresponding path program 1 times [2025-03-17 20:01:20,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:20,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088003321] [2025-03-17 20:01:20,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:01:20,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:20,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:01:20,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:01:20,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:20,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:20,788 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:20,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:01:20,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:01:20,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:20,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:20,801 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:21,048 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:01:21,048 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:01:21,049 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:01:21,049 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:01:21,049 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:01:21,051 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:21,051 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:01:21,051 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:01:21,051 INFO L132 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration1_Lasso [2025-03-17 20:01:21,051 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:01:21,051 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:01:21,061 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:21,216 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:21,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:21,220 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:21,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:21,224 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:21,227 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:21,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:21,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:21,435 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:01:21,437 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:01:21,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:21,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:21,441 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-17 20:01:21,442 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-17 20:01:21,443 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-17 20:01:21,455 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:21,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:21,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:21,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:21,462 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:21,462 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:21,465 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:21,472 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-17 20:01:21,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:21,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:21,474 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-17 20:01:21,475 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-17 20:01:21,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-17 20:01:21,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:21,487 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:21,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:21,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:21,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:21,488 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:21,488 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:21,489 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:21,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:21,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:21,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:21,497 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-17 20:01:21,498 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-17 20:01:21,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-17 20:01:21,508 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:21,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:21,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:21,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:21,514 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:21,514 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:21,518 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:21,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-03-17 20:01:21,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:21,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:21,528 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-17 20:01:21,530 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-17 20:01:21,532 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:01:21,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:21,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:21,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:21,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:21,546 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:21,546 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:21,551 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:21,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:21,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:21,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:21,560 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-17 20:01:21,562 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-17 20:01:21,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-17 20:01:21,573 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:21,574 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:21,574 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:21,574 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:21,583 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:21,583 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:21,592 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:01:21,614 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-03-17 20:01:21,617 INFO L444 ModelExtractionUtils]: 1 out of 19 variables were initially zero. Simplification set additionally 15 variables to zero. [2025-03-17 20:01:21,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:21,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:21,620 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-17 20:01:21,622 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-17 20:01:21,623 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:01:21,634 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 20:01:21,635 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:01:21,635 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~array_size~0#1, ULTIMATE.start_main_~k~0#1) = 1*ULTIMATE.start_main_~array_size~0#1 - 1*ULTIMATE.start_main_~k~0#1 Supporting invariants [] [2025-03-17 20:01:21,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:21,650 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2025-03-17 20:01:21,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:21,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:01:21,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:01:21,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:21,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:21,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:01:21,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:21,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:01:21,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:01:21,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:21,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:21,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 20:01:21,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:21,713 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-17 20:01:21,732 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-03-17 20:01:21,733 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:01:21,757 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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). Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 14 states and 22 transitions. Complement of second has 3 states. [2025-03-17 20:01:21,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-17 20:01:21,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:01:21,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 5 transitions. [2025-03-17 20:01:21,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 5 transitions. Stem has 3 letters. Loop has 1 letters. [2025-03-17 20:01:21,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:21,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 5 transitions. Stem has 4 letters. Loop has 1 letters. [2025-03-17 20:01:21,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:21,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 5 transitions. Stem has 3 letters. Loop has 2 letters. [2025-03-17 20:01:21,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:21,773 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 22 transitions. [2025-03-17 20:01:21,773 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-17 20:01:21,775 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 12 states and 19 transitions. [2025-03-17 20:01:21,776 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-17 20:01:21,777 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-17 20:01:21,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 19 transitions. [2025-03-17 20:01:21,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:01:21,778 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 19 transitions. [2025-03-17 20:01:21,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 19 transitions. [2025-03-17 20:01:21,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2025-03-17 20:01:21,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 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-17 20:01:21,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 18 transitions. [2025-03-17 20:01:21,796 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 18 transitions. [2025-03-17 20:01:21,796 INFO L432 stractBuchiCegarLoop]: Abstraction has 11 states and 18 transitions. [2025-03-17 20:01:21,796 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-17 20:01:21,796 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 18 transitions. [2025-03-17 20:01:21,797 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-17 20:01:21,797 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:01:21,797 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:01:21,797 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-17 20:01:21,797 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 20:01:21,797 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" [2025-03-17 20:01:21,797 INFO L754 eck$LassoCheckResult]: Loop: "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume !true;" "assume !true;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" [2025-03-17 20:01:21,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:21,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1538142, now seen corresponding path program 1 times [2025-03-17 20:01:21,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:21,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961572298] [2025-03-17 20:01:21,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:01:21,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:21,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:01:21,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:01:21,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:21,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:21,882 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-17 20:01:21,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:01:21,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961572298] [2025-03-17 20:01:21,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961572298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:01:21,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:01:21,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 20:01:21,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676308792] [2025-03-17 20:01:21,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:01:21,885 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:01:21,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:21,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1353306, now seen corresponding path program 1 times [2025-03-17 20:01:21,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:21,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992131389] [2025-03-17 20:01:21,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:01:21,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:21,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:01:21,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:01:21,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:21,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:21,891 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-17 20:01:21,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:01:21,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992131389] [2025-03-17 20:01:21,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992131389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:01:21,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:01:21,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 20:01:21,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502251115] [2025-03-17 20:01:21,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:01:21,895 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 20:01:21,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:01:21,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 20:01:21,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 20:01:21,897 INFO L87 Difference]: Start difference. First operand 11 states and 18 transitions. cyclomatic complexity: 9 Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:01:21,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:01:21,899 INFO L93 Difference]: Finished difference Result 11 states and 16 transitions. [2025-03-17 20:01:21,899 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 16 transitions. [2025-03-17 20:01:21,900 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-17 20:01:21,900 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 16 transitions. [2025-03-17 20:01:21,900 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-17 20:01:21,900 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-17 20:01:21,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2025-03-17 20:01:21,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:01:21,900 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 16 transitions. [2025-03-17 20:01:21,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2025-03-17 20:01:21,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-03-17 20:01:21,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 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-17 20:01:21,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2025-03-17 20:01:21,901 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 16 transitions. [2025-03-17 20:01:21,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 20:01:21,902 INFO L432 stractBuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2025-03-17 20:01:21,902 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-17 20:01:21,902 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. [2025-03-17 20:01:21,902 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-17 20:01:21,902 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:01:21,902 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:01:21,902 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-17 20:01:21,903 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-17 20:01:21,903 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" [2025-03-17 20:01:21,903 INFO L754 eck$LassoCheckResult]: Loop: "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" [2025-03-17 20:01:21,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:21,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1538142, now seen corresponding path program 2 times [2025-03-17 20:01:21,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:21,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494253704] [2025-03-17 20:01:21,903 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:01:21,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:21,909 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:01:21,912 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:01:21,915 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:01:21,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:21,949 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-17 20:01:21,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:01:21,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494253704] [2025-03-17 20:01:21,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494253704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:01:21,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:01:21,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 20:01:21,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007745858] [2025-03-17 20:01:21,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:01:21,951 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:01:21,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:21,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1299697848, now seen corresponding path program 1 times [2025-03-17 20:01:21,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:21,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255331923] [2025-03-17 20:01:21,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:01:21,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:21,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 20:01:21,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 20:01:21,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:21,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:21,957 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:21,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 20:01:21,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 20:01:21,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:21,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:21,965 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:22,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:01:22,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 20:01:22,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 20:01:22,007 INFO L87 Difference]: Start difference. First operand 11 states and 16 transitions. cyclomatic complexity: 7 Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:01:22,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:01:22,019 INFO L93 Difference]: Finished difference Result 11 states and 15 transitions. [2025-03-17 20:01:22,019 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 15 transitions. [2025-03-17 20:01:22,019 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-17 20:01:22,020 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 15 transitions. [2025-03-17 20:01:22,020 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-17 20:01:22,020 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-17 20:01:22,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 15 transitions. [2025-03-17 20:01:22,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:01:22,020 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 15 transitions. [2025-03-17 20:01:22,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 15 transitions. [2025-03-17 20:01:22,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-03-17 20:01:22,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:01:22,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2025-03-17 20:01:22,021 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 15 transitions. [2025-03-17 20:01:22,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 20:01:22,022 INFO L432 stractBuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2025-03-17 20:01:22,022 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-17 20:01:22,022 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2025-03-17 20:01:22,022 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-17 20:01:22,022 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:01:22,022 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:01:22,023 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-17 20:01:22,023 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-17 20:01:22,023 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" [2025-03-17 20:01:22,023 INFO L754 eck$LassoCheckResult]: Loop: "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" [2025-03-17 20:01:22,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:22,023 INFO L85 PathProgramCache]: Analyzing trace with hash 47682448, now seen corresponding path program 1 times [2025-03-17 20:01:22,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:22,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10316666] [2025-03-17 20:01:22,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:01:22,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:22,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:01:22,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:01:22,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:22,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:22,033 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:22,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:01:22,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:01:22,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:22,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:22,040 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:22,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:22,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1299697848, now seen corresponding path program 2 times [2025-03-17 20:01:22,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:22,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594938622] [2025-03-17 20:01:22,041 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:01:22,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:22,043 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 1 equivalence classes. [2025-03-17 20:01:22,045 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 20:01:22,045 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:01:22,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:22,045 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:22,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 20:01:22,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 20:01:22,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:22,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:22,048 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:22,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:22,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1404058887, now seen corresponding path program 1 times [2025-03-17 20:01:22,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:22,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145859727] [2025-03-17 20:01:22,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:01:22,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:22,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 20:01:22,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 20:01:22,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:22,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:22,059 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:22,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 20:01:22,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 20:01:22,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:22,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:22,078 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:22,132 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-17 20:01:22,311 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:01:22,311 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:01:22,311 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:01:22,311 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:01:22,311 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:01:22,311 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:22,311 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:01:22,311 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:01:22,311 INFO L132 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration4_Lasso [2025-03-17 20:01:22,311 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:01:22,311 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:01:22,312 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:22,316 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:22,318 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:22,321 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:22,323 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:22,324 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:22,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:22,328 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:22,330 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:22,331 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:22,336 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:22,338 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:22,422 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:22,425 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:22,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:22,428 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:22,429 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:22,431 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:22,433 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:22,434 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:22,436 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:22,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:22,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:22,442 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:22,610 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:01:22,610 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:01:22,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:22,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:22,613 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-17 20:01:22,614 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-17 20:01:22,615 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-17 20:01:22,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:22,625 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:22,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:22,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:22,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:22,626 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:22,626 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:22,627 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:22,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:22,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:22,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:22,635 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-17 20:01:22,636 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-17 20:01:22,638 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-17 20:01:22,648 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:22,648 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:22,648 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:22,648 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:22,648 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:22,650 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:22,650 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:22,651 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:22,657 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-17 20:01:22,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:22,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:22,658 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-17 20:01:22,659 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-17 20:01:22,660 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-17 20:01:22,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:22,670 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:22,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:22,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:22,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:22,670 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:22,670 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:22,671 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:22,676 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-17 20:01:22,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:22,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:22,678 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-17 20:01:22,679 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-17 20:01:22,680 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-17 20:01:22,689 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:22,689 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:22,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:22,689 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:22,689 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:22,690 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:22,690 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:22,691 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:22,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:22,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:22,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:22,698 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-17 20:01:22,699 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-17 20:01:22,700 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-17 20:01:22,710 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:22,710 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:22,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:22,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:22,710 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:22,710 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:22,710 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:22,711 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:22,717 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-17 20:01:22,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:22,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:22,719 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-17 20:01:22,720 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-17 20:01:22,720 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-17 20:01:22,730 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:22,730 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:22,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:22,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:22,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:22,730 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:22,730 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:22,732 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:22,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-03-17 20:01:22,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:22,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:22,739 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-17 20:01:22,740 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-17 20:01:22,740 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-17 20:01:22,750 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:22,750 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:22,750 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:22,750 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:22,752 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:22,752 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:22,757 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:22,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-03-17 20:01:22,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:22,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:22,765 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-17 20:01:22,766 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-17 20:01:22,767 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-17 20:01:22,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:22,777 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:22,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:22,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:22,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:22,778 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:22,778 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:22,779 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:22,785 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-17 20:01:22,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:22,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:22,787 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-17 20:01:22,788 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-17 20:01:22,790 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-17 20:01:22,800 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:22,800 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:22,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:22,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:22,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:22,801 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:22,801 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:22,802 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:22,807 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-17 20:01:22,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:22,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:22,809 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-17 20:01:22,810 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-17 20:01:22,811 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-17 20:01:22,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:22,821 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:22,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:22,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:22,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:22,821 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:22,821 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:22,822 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:22,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-03-17 20:01:22,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:22,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:22,829 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-17 20:01:22,830 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-17 20:01:22,831 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-17 20:01:22,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:22,841 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:22,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:22,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:22,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:22,841 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:22,841 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:22,843 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:22,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-03-17 20:01:22,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:22,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:22,851 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-17 20:01:22,852 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-17 20:01:22,854 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-17 20:01:22,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:22,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:22,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:22,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:22,869 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:22,869 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:22,876 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:01:22,892 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-03-17 20:01:22,892 INFO L444 ModelExtractionUtils]: 6 out of 19 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-03-17 20:01:22,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:22,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:22,895 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-17 20:01:22,897 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-17 20:01:22,898 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:01:22,909 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 20:01:22,909 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:01:22,909 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_~i~0#1, ULTIMATE.start_test_fun_~N#1) = -1*ULTIMATE.start_test_fun_~i~0#1 + 1*ULTIMATE.start_test_fun_~N#1 Supporting invariants [] [2025-03-17 20:01:22,939 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-17 20:01:22,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:22,948 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2025-03-17 20:01:22,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:22,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:01:22,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:01:22,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:22,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:22,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:01:22,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:22,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 20:01:22,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 20:01:22,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:22,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:22,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 20:01:22,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:23,019 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-17 20:01:23,019 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-17 20:01:23,019 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:01:23,039 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 18 states and 25 transitions. Complement of second has 4 states. [2025-03-17 20:01:23,040 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-17 20:01:23,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:01:23,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2025-03-17 20:01:23,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 5 letters. Loop has 6 letters. [2025-03-17 20:01:23,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:23,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 11 letters. Loop has 6 letters. [2025-03-17 20:01:23,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:23,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 5 letters. Loop has 12 letters. [2025-03-17 20:01:23,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:23,042 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 25 transitions. [2025-03-17 20:01:23,042 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-17 20:01:23,043 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 17 states and 24 transitions. [2025-03-17 20:01:23,043 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-17 20:01:23,043 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-17 20:01:23,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 24 transitions. [2025-03-17 20:01:23,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:01:23,043 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 24 transitions. [2025-03-17 20:01:23,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 24 transitions. [2025-03-17 20:01:23,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2025-03-17 20:01:23,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.4375) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:01:23,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2025-03-17 20:01:23,044 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 23 transitions. [2025-03-17 20:01:23,044 INFO L432 stractBuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2025-03-17 20:01:23,044 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-17 20:01:23,045 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 23 transitions. [2025-03-17 20:01:23,045 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-17 20:01:23,045 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:01:23,045 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:01:23,046 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-17 20:01:23,046 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:01:23,046 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-17 20:01:23,046 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-17 20:01:23,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:23,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1478155902, now seen corresponding path program 1 times [2025-03-17 20:01:23,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:23,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725526524] [2025-03-17 20:01:23,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:01:23,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:23,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 20:01:23,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 20:01:23,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:23,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:23,059 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:23,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 20:01:23,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 20:01:23,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:23,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:23,072 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:23,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:23,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1344, now seen corresponding path program 1 times [2025-03-17 20:01:23,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:23,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488187295] [2025-03-17 20:01:23,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:01:23,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:23,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:23,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:23,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:23,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:23,085 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:23,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:23,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:23,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:23,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:23,088 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:23,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:23,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1126352771, now seen corresponding path program 1 times [2025-03-17 20:01:23,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:23,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47499738] [2025-03-17 20:01:23,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:01:23,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:23,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 20:01:23,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 20:01:23,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:23,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:23,101 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:23,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 20:01:23,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 20:01:23,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:23,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:23,110 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:23,280 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:01:23,280 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:01:23,280 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:01:23,280 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:01:23,280 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:01:23,280 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:23,280 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:01:23,280 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:01:23,280 INFO L132 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration5_Lasso [2025-03-17 20:01:23,281 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:01:23,281 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:01:23,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:23,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:23,292 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:23,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:23,294 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:23,296 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:23,297 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:23,298 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:23,300 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:23,301 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:23,303 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:23,304 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:23,307 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:23,308 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:23,389 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:23,394 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:23,396 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:23,397 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:23,399 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:23,400 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:23,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:23,402 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:23,404 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:23,406 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:23,407 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:23,577 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:01:23,578 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:01:23,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:23,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:23,580 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-17 20:01:23,580 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-17 20:01:23,582 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-17 20:01:23,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:23,592 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:23,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:23,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:23,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:23,592 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:23,592 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:23,593 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:23,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-03-17 20:01:23,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:23,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:23,601 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-17 20:01:23,601 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-17 20:01:23,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-17 20:01:23,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:23,612 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:23,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:23,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:23,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:23,612 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:23,612 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:23,613 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:23,618 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-17 20:01:23,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:23,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:23,619 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-17 20:01:23,620 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-17 20:01:23,621 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-17 20:01:23,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:23,630 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:23,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:23,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:23,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:23,631 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:23,631 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:23,632 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:23,637 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-17 20:01:23,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:23,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:23,639 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-17 20:01:23,639 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-17 20:01:23,640 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-17 20:01:23,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:23,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:23,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:23,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:23,651 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:23,651 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:23,653 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:23,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-03-17 20:01:23,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:23,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:23,660 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-17 20:01:23,660 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-17 20:01:23,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-17 20:01:23,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:23,671 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:23,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:23,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:23,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:23,671 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:23,671 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:23,672 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:23,677 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-17 20:01:23,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:23,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:23,679 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-17 20:01:23,679 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-17 20:01:23,680 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-17 20:01:23,689 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:23,690 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:23,690 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:23,690 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:23,690 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:23,690 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:23,690 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:23,691 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:23,696 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-17 20:01:23,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:23,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:23,698 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-17 20:01:23,699 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-17 20:01:23,699 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-17 20:01:23,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:23,709 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:23,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:23,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:23,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:23,709 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:23,709 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:23,710 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:23,715 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-17 20:01:23,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:23,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:23,717 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-17 20:01:23,718 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-17 20:01:23,720 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-17 20:01:23,730 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:23,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:23,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:23,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:23,731 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:23,731 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:23,733 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:23,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-03-17 20:01:23,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:23,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:23,741 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-17 20:01:23,741 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-17 20:01:23,744 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-17 20:01:23,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:23,753 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:23,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:23,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:23,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:23,754 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:23,754 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:23,755 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:23,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:23,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:23,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:23,763 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-17 20:01:23,764 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-17 20:01:23,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-17 20:01:23,776 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:23,776 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:23,776 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:23,776 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:23,776 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:23,777 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:23,777 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:23,778 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:23,783 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-17 20:01:23,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:23,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:23,785 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:01:23,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-03-17 20:01:23,789 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-17 20:01:23,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:23,799 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:23,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:23,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:23,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:23,799 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:23,799 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:23,800 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:23,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:23,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:23,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:23,809 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-17 20:01:23,809 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-17 20:01:23,810 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-17 20:01:23,819 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:23,820 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:23,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:23,820 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:23,821 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:23,821 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:23,824 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:23,829 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-17 20:01:23,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:23,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:23,832 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-17 20:01:23,833 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-17 20:01:23,834 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-17 20:01:23,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:23,844 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:23,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:23,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:23,844 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:23,844 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:23,844 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:23,845 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:23,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:23,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:23,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:23,853 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-17 20:01:23,854 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-17 20:01:23,855 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-17 20:01:23,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:23,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:23,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:23,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:23,868 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:23,868 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:23,871 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:23,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-03-17 20:01:23,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:23,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:23,878 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-17 20:01:23,879 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-17 20:01:23,880 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-17 20:01:23,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:23,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:23,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:23,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:23,892 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:23,892 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:23,896 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:01:23,903 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-03-17 20:01:23,903 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-03-17 20:01:23,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:23,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:23,905 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:01:23,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-03-17 20:01:23,907 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:01:23,917 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 20:01:23,917 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:01:23,917 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) 0)_2) = -1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) 0)_2 Supporting invariants [] [2025-03-17 20:01:23,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-03-17 20:01:23,928 INFO L156 tatePredicateManager]: 2 out of 4 supporting invariants were superfluous and have been removed [2025-03-17 20:01:23,931 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-17 20:01:23,932 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-17 20:01:23,932 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc12!base,]]] [2025-03-17 20:01:23,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:23,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 20:01:23,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 20:01:23,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:23,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:23,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 20:01:23,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:24,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:24,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:24,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:24,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:24,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 20:01:24,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:24,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:01:24,022 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-17 20:01:24,022 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 23 transitions. cyclomatic complexity: 11 Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 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-17 20:01:24,069 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 23 transitions. cyclomatic complexity: 11. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 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 33 states and 44 transitions. Complement of second has 9 states. [2025-03-17 20:01:24,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-17 20:01:24,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 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-17 20:01:24,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2025-03-17 20:01:24,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 6 letters. Loop has 2 letters. [2025-03-17 20:01:24,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:24,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 8 letters. Loop has 2 letters. [2025-03-17 20:01:24,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:24,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 6 letters. Loop has 4 letters. [2025-03-17 20:01:24,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:24,070 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 44 transitions. [2025-03-17 20:01:24,071 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-17 20:01:24,071 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 28 states and 39 transitions. [2025-03-17 20:01:24,071 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2025-03-17 20:01:24,071 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-03-17 20:01:24,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 39 transitions. [2025-03-17 20:01:24,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:01:24,071 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 39 transitions. [2025-03-17 20:01:24,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 39 transitions. [2025-03-17 20:01:24,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2025-03-17 20:01:24,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.434782608695652) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:01:24,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 33 transitions. [2025-03-17 20:01:24,073 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 33 transitions. [2025-03-17 20:01:24,073 INFO L432 stractBuchiCegarLoop]: Abstraction has 23 states and 33 transitions. [2025-03-17 20:01:24,073 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-17 20:01:24,073 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 33 transitions. [2025-03-17 20:01:24,073 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-17 20:01:24,073 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:01:24,073 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:01:24,073 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:01:24,073 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:01:24,074 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" [2025-03-17 20:01:24,074 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem6#1 > 0;havoc test_fun_#t~mem6#1;call test_fun_#t~mem7#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post8#1 := test_fun_#t~mem7#1;call write~int#0(test_fun_#t~post8#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem7#1;havoc test_fun_#t~post8#1;test_fun_#t~post9#1 := test_fun_~pos~0#1;test_fun_~pos~0#1 := 1 + test_fun_#t~post9#1;havoc test_fun_#t~post9#1;" [2025-03-17 20:01:24,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:24,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1126352772, now seen corresponding path program 1 times [2025-03-17 20:01:24,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:24,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749611149] [2025-03-17 20:01:24,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:01:24,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:24,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 20:01:24,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 20:01:24,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:24,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:24,086 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:24,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 20:01:24,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 20:01:24,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:24,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:24,098 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:24,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:24,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1152, now seen corresponding path program 1 times [2025-03-17 20:01:24,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:24,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528828943] [2025-03-17 20:01:24,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:01:24,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:24,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:24,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:24,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:24,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:24,103 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:24,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:24,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:24,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:24,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:24,106 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:24,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:24,108 INFO L85 PathProgramCache]: Analyzing trace with hash -93255109, now seen corresponding path program 1 times [2025-03-17 20:01:24,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:24,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262525345] [2025-03-17 20:01:24,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:01:24,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:24,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 20:01:24,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 20:01:24,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:24,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:24,126 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:24,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 20:01:24,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 20:01:24,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:24,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:24,138 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:24,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-03-17 20:01:24,384 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:01:24,385 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:01:24,385 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:01:24,385 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:01:24,385 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:01:24,385 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:24,385 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:01:24,385 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:01:24,385 INFO L132 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration6_Lasso [2025-03-17 20:01:24,385 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:01:24,385 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:01:24,386 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:24,389 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:24,391 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:24,392 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:24,393 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:24,394 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:24,397 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:24,404 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:24,406 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:24,407 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:24,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:24,410 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:24,412 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:24,414 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:24,416 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:24,417 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:24,496 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:24,498 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:24,499 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:24,502 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:24,503 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:24,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:24,507 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:24,508 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:24,510 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:24,665 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:01:24,666 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:01:24,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:24,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:24,667 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-17 20:01:24,670 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-17 20:01:24,670 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-17 20:01:24,679 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:24,679 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:24,679 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:24,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:24,681 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:24,681 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:24,683 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:24,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:24,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:24,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:24,691 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-17 20:01:24,692 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-17 20:01:24,693 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-17 20:01:24,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:24,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:24,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:24,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:24,703 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:24,703 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:24,705 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:24,711 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-17 20:01:24,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:24,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:24,713 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-17 20:01:24,715 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-17 20:01:24,716 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-17 20:01:24,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:24,726 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:24,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:24,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:24,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:24,726 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:24,726 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:24,729 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:24,735 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-17 20:01:24,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:24,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:24,738 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-17 20:01:24,739 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-17 20:01:24,740 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-17 20:01:24,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:24,749 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:24,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:24,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:24,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:24,750 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:24,750 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:24,751 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:24,757 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-17 20:01:24,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:24,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:24,759 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-17 20:01:24,760 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-17 20:01:24,761 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-17 20:01:24,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:24,771 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:24,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:24,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:24,771 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:24,772 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:24,772 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:24,773 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:24,778 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-17 20:01:24,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:24,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:24,781 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-17 20:01:24,782 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-17 20:01:24,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-17 20:01:24,793 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:24,793 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:24,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:24,793 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:24,793 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:24,794 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:24,794 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:24,795 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:24,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:24,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:24,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:24,803 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-17 20:01:24,803 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-17 20:01:24,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-17 20:01:24,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:24,815 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:24,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:24,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:24,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:24,816 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:24,816 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:24,817 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:24,822 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-17 20:01:24,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:24,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:24,825 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-17 20:01:24,826 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-17 20:01:24,826 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-17 20:01:24,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:24,835 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:24,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:24,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:24,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:24,836 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:24,836 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:24,836 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:24,841 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-17 20:01:24,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:24,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:24,844 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-17 20:01:24,845 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-17 20:01:24,845 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-17 20:01:24,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:24,855 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:24,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:24,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:24,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:24,855 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:24,855 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:24,856 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:24,861 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-17 20:01:24,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:24,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:24,863 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-17 20:01:24,863 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-17 20:01:24,864 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-17 20:01:24,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:24,874 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:24,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:24,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:24,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:24,874 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:24,874 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:24,875 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:24,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2025-03-17 20:01:24,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:24,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:24,882 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-17 20:01:24,882 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-17 20:01:24,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-17 20:01:24,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:24,893 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:24,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:24,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:24,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:24,893 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:24,893 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:24,894 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:24,899 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-17 20:01:24,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:24,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:24,901 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-17 20:01:24,902 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-17 20:01:24,903 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-17 20:01:24,912 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:24,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:24,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:24,912 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:24,913 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:24,913 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:24,915 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:24,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:24,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:24,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:24,923 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-17 20:01:24,923 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-17 20:01:24,924 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-17 20:01:24,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:24,933 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:24,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:24,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:24,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:24,934 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:24,934 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:24,935 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:24,940 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-17 20:01:24,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:24,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:24,942 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-17 20:01:24,942 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-17 20:01:24,943 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-17 20:01:24,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:24,954 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:24,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:24,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:24,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:24,954 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:24,954 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:24,955 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:24,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2025-03-17 20:01:24,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:24,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:24,963 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-17 20:01:24,965 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-17 20:01:24,966 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-17 20:01:24,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:24,976 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:24,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:24,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:24,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:24,976 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:24,976 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:24,977 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:24,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:24,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:24,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:24,985 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-17 20:01:24,986 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-17 20:01:24,987 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-17 20:01:24,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:24,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:24,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:24,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:25,000 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:25,000 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:25,003 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:25,010 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-17 20:01:25,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:25,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:25,012 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-17 20:01:25,013 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-17 20:01:25,014 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-17 20:01:25,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:25,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:25,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:25,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:25,026 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:25,026 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:25,031 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:01:25,038 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-03-17 20:01:25,039 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-03-17 20:01:25,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:25,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:25,041 INFO L229 MonitoredProcess]: Starting monitored process 54 with /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-17 20:01:25,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-03-17 20:01:25,043 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:01:25,053 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 20:01:25,053 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:01:25,053 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~a#1.base) ULTIMATE.start_test_fun_~a#1.offset)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~a#1.base) ULTIMATE.start_test_fun_~a#1.offset)_1 Supporting invariants [] [2025-03-17 20:01:25,060 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-17 20:01:25,070 INFO L156 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2025-03-17 20:01:25,071 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-17 20:01:25,071 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-17 20:01:25,072 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~a!base,]]] [2025-03-17 20:01:25,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:25,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 20:01:25,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 20:01:25,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:25,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:25,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 20:01:25,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:25,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:25,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:25,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:25,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:25,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 20:01:25,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:25,126 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-17 20:01:25,127 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-17 20:01:25,127 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 33 transitions. cyclomatic complexity: 16 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:01:25,170 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 33 transitions. cyclomatic complexity: 16. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 32 states and 44 transitions. Complement of second has 8 states. [2025-03-17 20:01:25,172 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-17 20:01:25,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:01:25,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2025-03-17 20:01:25,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 8 letters. Loop has 2 letters. [2025-03-17 20:01:25,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:25,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 10 letters. Loop has 2 letters. [2025-03-17 20:01:25,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:25,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 8 letters. Loop has 4 letters. [2025-03-17 20:01:25,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:25,175 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 44 transitions. [2025-03-17 20:01:25,175 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-17 20:01:25,175 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 23 states and 31 transitions. [2025-03-17 20:01:25,175 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-17 20:01:25,175 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-17 20:01:25,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 31 transitions. [2025-03-17 20:01:25,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:01:25,175 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 31 transitions. [2025-03-17 20:01:25,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 31 transitions. [2025-03-17 20:01:25,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2025-03-17 20:01:25,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:01:25,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2025-03-17 20:01:25,176 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 30 transitions. [2025-03-17 20:01:25,176 INFO L432 stractBuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2025-03-17 20:01:25,177 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-17 20:01:25,177 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 30 transitions. [2025-03-17 20:01:25,177 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-17 20:01:25,177 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:01:25,177 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:01:25,177 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:01:25,177 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:01:25,177 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-17 20:01:25,177 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-17 20:01:25,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:25,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:25,179 INFO L85 PathProgramCache]: Analyzing trace with hash 576152551, now seen corresponding path program 2 times [2025-03-17 20:01:25,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:25,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048400599] [2025-03-17 20:01:25,179 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:01:25,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:25,183 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-17 20:01:25,190 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 20:01:25,190 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:01:25,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:25,259 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-17 20:01:25,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:01:25,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048400599] [2025-03-17 20:01:25,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048400599] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:01:25,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885525725] [2025-03-17 20:01:25,260 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:01:25,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:01:25,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:25,261 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:01:25,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2025-03-17 20:01:25,294 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-17 20:01:25,300 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 20:01:25,300 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:01:25,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:25,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 20:01:25,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:25,347 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-17 20:01:25,347 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:01:25,380 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-17 20:01:25,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885525725] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:01:25,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:01:25,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-17 20:01:25,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446083756] [2025-03-17 20:01:25,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:01:25,382 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:01:25,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:25,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1344, now seen corresponding path program 2 times [2025-03-17 20:01:25,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:25,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008672812] [2025-03-17 20:01:25,384 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:01:25,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:25,386 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:25,388 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:25,388 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:01:25,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:25,388 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:25,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:25,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:25,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:25,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:25,390 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:25,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:01:25,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 20:01:25,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-17 20:01:25,430 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. cyclomatic complexity: 14 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-17 20:01:25,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:01:25,464 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2025-03-17 20:01:25,464 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 42 transitions. [2025-03-17 20:01:25,465 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-17 20:01:25,465 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 23 states and 31 transitions. [2025-03-17 20:01:25,465 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-17 20:01:25,465 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-17 20:01:25,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 31 transitions. [2025-03-17 20:01:25,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:01:25,465 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 31 transitions. [2025-03-17 20:01:25,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 31 transitions. [2025-03-17 20:01:25,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-17 20:01:25,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:01:25,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2025-03-17 20:01:25,467 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 31 transitions. [2025-03-17 20:01:25,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 20:01:25,468 INFO L432 stractBuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2025-03-17 20:01:25,468 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-17 20:01:25,468 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 31 transitions. [2025-03-17 20:01:25,469 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-17 20:01:25,469 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:01:25,469 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:01:25,469 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:01:25,469 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:01:25,469 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-17 20:01:25,469 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-17 20:01:25,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:25,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1842729703, now seen corresponding path program 3 times [2025-03-17 20:01:25,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:25,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401884550] [2025-03-17 20:01:25,469 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:01:25,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:25,474 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 2 equivalence classes. [2025-03-17 20:01:25,482 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 20:01:25,482 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 20:01:25,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:25,482 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:25,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 20:01:25,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 20:01:25,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:25,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:25,495 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:25,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:25,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1344, now seen corresponding path program 3 times [2025-03-17 20:01:25,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:25,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057346287] [2025-03-17 20:01:25,497 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:01:25,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:25,500 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:25,502 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:25,505 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 20:01:25,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:25,506 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:25,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:25,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:25,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:25,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:25,510 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:25,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:25,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1336718248, now seen corresponding path program 1 times [2025-03-17 20:01:25,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:25,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767221233] [2025-03-17 20:01:25,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:01:25,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:25,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 20:01:25,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 20:01:25,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:25,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:25,527 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:25,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 20:01:25,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 20:01:25,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:25,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:25,547 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:25,760 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:01:25,761 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:01:25,761 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:01:25,761 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:01:25,761 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:01:25,761 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:25,761 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:01:25,761 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:01:25,761 INFO L132 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration8_Lasso [2025-03-17 20:01:25,761 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:01:25,761 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:01:25,763 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:25,764 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:25,766 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:25,769 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:25,771 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:25,773 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:25,775 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:25,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:25,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:25,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:25,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:25,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:25,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:25,887 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:25,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:25,890 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:25,891 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:25,892 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:25,893 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:25,894 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:25,896 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:25,899 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:25,900 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:25,902 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:25,903 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:26,063 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:01:26,063 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:01:26,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:26,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:26,065 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-17 20:01:26,066 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-17 20:01:26,067 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-17 20:01:26,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:26,076 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:26,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:26,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:26,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:26,076 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:26,076 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:26,077 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:26,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:26,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:26,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:26,084 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-17 20:01:26,085 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-17 20:01:26,085 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-17 20:01:26,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:26,095 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:26,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:26,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:26,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:26,095 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:26,095 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:26,097 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:26,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2025-03-17 20:01:26,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:26,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:26,104 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-17 20:01:26,105 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-17 20:01:26,105 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-17 20:01:26,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:26,115 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:26,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:26,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:26,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:26,115 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:26,115 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:26,116 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:26,122 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-17 20:01:26,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:26,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:26,124 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-17 20:01:26,126 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-17 20:01:26,127 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-17 20:01:26,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:26,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:26,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:26,137 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:26,138 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:26,138 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:26,140 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:26,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:26,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:26,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:26,148 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-17 20:01:26,150 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-17 20:01:26,151 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-17 20:01:26,160 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:26,160 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:26,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:26,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:26,161 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:26,161 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:26,161 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:26,162 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:26,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2025-03-17 20:01:26,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:26,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:26,170 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-17 20:01:26,171 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-17 20:01:26,172 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-17 20:01:26,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:26,182 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:26,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:26,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:26,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:26,182 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:26,182 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:26,183 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:26,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:26,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:26,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:26,190 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-17 20:01:26,191 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-17 20:01:26,192 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-17 20:01:26,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:26,201 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:26,201 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:26,201 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:26,203 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:26,203 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:26,207 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:01:26,212 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-03-17 20:01:26,212 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-03-17 20:01:26,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:26,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:26,214 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-17 20:01:26,216 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-17 20:01:26,216 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:01:26,226 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 20:01:26,226 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:01:26,226 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) 4)_1) = -1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) 4)_1 Supporting invariants [] [2025-03-17 20:01:26,231 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-17 20:01:26,243 INFO L156 tatePredicateManager]: 4 out of 6 supporting invariants were superfluous and have been removed [2025-03-17 20:01:26,246 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-17 20:01:26,246 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-17 20:01:26,246 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc12!base,]]] [2025-03-17 20:01:26,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:26,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 20:01:26,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 20:01:26,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:26,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:26,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 20:01:26,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:26,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:26,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:26,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:26,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:26,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 20:01:26,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:26,374 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-17 20:01:26,375 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-17 20:01:26,375 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 31 transitions. cyclomatic complexity: 14 Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:01:26,396 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 31 transitions. cyclomatic complexity: 14. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 24 states and 33 transitions. Complement of second has 5 states. [2025-03-17 20:01:26,397 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-17 20:01:26,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:01:26,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-17 20:01:26,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 13 letters. Loop has 2 letters. [2025-03-17 20:01:26,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:26,397 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 20:01:26,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:26,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 20:01:26,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 20:01:26,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:26,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:26,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 20:01:26,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:26,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:26,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:26,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:26,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:26,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 20:01:26,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:26,536 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-17 20:01:26,536 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-17 20:01:26,537 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 31 transitions. cyclomatic complexity: 14 Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:01:26,559 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 31 transitions. cyclomatic complexity: 14. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 24 states and 33 transitions. Complement of second has 5 states. [2025-03-17 20:01:26,559 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-17 20:01:26,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:01:26,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-17 20:01:26,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 13 letters. Loop has 2 letters. [2025-03-17 20:01:26,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:26,560 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 20:01:26,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:26,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 20:01:26,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 20:01:26,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:26,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:26,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 20:01:26,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:26,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2025-03-17 20:01:26,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:26,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:26,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:26,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:26,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 20:01:26,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:26,724 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-17 20:01:26,724 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-17 20:01:26,724 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 31 transitions. cyclomatic complexity: 14 Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:01:26,792 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 31 transitions. cyclomatic complexity: 14. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 51 states and 67 transitions. Complement of second has 11 states. [2025-03-17 20:01:26,792 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-17 20:01:26,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:01:26,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 38 transitions. [2025-03-17 20:01:26,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 38 transitions. Stem has 13 letters. Loop has 2 letters. [2025-03-17 20:01:26,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:26,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 38 transitions. Stem has 15 letters. Loop has 2 letters. [2025-03-17 20:01:26,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:26,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 38 transitions. Stem has 13 letters. Loop has 4 letters. [2025-03-17 20:01:26,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:26,794 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 67 transitions. [2025-03-17 20:01:26,796 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-03-17 20:01:26,796 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 46 states and 62 transitions. [2025-03-17 20:01:26,796 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2025-03-17 20:01:26,796 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2025-03-17 20:01:26,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 62 transitions. [2025-03-17 20:01:26,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:01:26,796 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 62 transitions. [2025-03-17 20:01:26,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 62 transitions. [2025-03-17 20:01:26,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 32. [2025-03-17 20:01:26,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.375) internal successors, (44), 31 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-17 20:01:26,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2025-03-17 20:01:26,799 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 44 transitions. [2025-03-17 20:01:26,800 INFO L432 stractBuchiCegarLoop]: Abstraction has 32 states and 44 transitions. [2025-03-17 20:01:26,800 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-17 20:01:26,800 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 44 transitions. [2025-03-17 20:01:26,800 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-17 20:01:26,800 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:01:26,800 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:01:26,800 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:01:26,800 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:01:26,801 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" [2025-03-17 20:01:26,801 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem6#1 > 0;havoc test_fun_#t~mem6#1;call test_fun_#t~mem7#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post8#1 := test_fun_#t~mem7#1;call write~int#0(test_fun_#t~post8#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem7#1;havoc test_fun_#t~post8#1;test_fun_#t~post9#1 := test_fun_~pos~0#1;test_fun_~pos~0#1 := 1 + test_fun_#t~post9#1;havoc test_fun_#t~post9#1;" [2025-03-17 20:01:26,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:26,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1336718249, now seen corresponding path program 4 times [2025-03-17 20:01:26,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:26,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747169853] [2025-03-17 20:01:26,801 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 20:01:26,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:26,805 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-03-17 20:01:26,821 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 20:01:26,821 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 20:01:26,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:26,821 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:26,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 20:01:26,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 20:01:26,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:26,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:26,831 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:26,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:26,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1152, now seen corresponding path program 2 times [2025-03-17 20:01:26,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:26,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258818811] [2025-03-17 20:01:26,832 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:01:26,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:26,836 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:26,837 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:26,837 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:01:26,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:26,837 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:26,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:26,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:26,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:26,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:26,839 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:26,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:26,839 INFO L85 PathProgramCache]: Analyzing trace with hash -391015594, now seen corresponding path program 1 times [2025-03-17 20:01:26,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:26,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263200816] [2025-03-17 20:01:26,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:01:26,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:26,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 20:01:26,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 20:01:26,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:26,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:26,851 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:26,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 20:01:26,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 20:01:26,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:26,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:26,866 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:27,152 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:01:27,152 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:01:27,152 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:01:27,152 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:01:27,152 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:01:27,152 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:27,152 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:01:27,152 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:01:27,152 INFO L132 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration9_Lasso [2025-03-17 20:01:27,152 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:01:27,152 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:01:27,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:27,154 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:27,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:27,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:27,159 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:27,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:27,161 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:27,162 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:27,163 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:27,164 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:27,165 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:27,170 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:27,171 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:27,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:27,174 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:27,175 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:27,176 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:27,177 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:27,179 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:27,181 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:27,188 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:27,324 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:27,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:27,327 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:27,502 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:01:27,502 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:01:27,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:27,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:27,505 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-17 20:01:27,505 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-17 20:01:27,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-17 20:01:27,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:27,516 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:27,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:27,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:27,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:27,517 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:27,517 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:27,517 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:27,522 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-17 20:01:27,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:27,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:27,524 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-17 20:01:27,525 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-17 20:01:27,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-17 20:01:27,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:27,536 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:27,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:27,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:27,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:27,536 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:27,536 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:27,537 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:27,542 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-17 20:01:27,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:27,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:27,544 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-17 20:01:27,544 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-17 20:01:27,545 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-17 20:01:27,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:27,555 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:27,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:27,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:27,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:27,555 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:27,555 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:27,556 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:27,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2025-03-17 20:01:27,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:27,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:27,563 INFO L229 MonitoredProcess]: Starting monitored process 67 with /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-17 20:01:27,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2025-03-17 20:01:27,564 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-17 20:01:27,573 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:27,574 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:27,574 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:27,574 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:27,574 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:27,574 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:27,574 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:27,575 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:27,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2025-03-17 20:01:27,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:27,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:27,582 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-17 20:01:27,583 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-17 20:01:27,583 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-17 20:01:27,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:27,592 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:27,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:27,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:27,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:27,593 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:27,593 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:27,594 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:27,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:27,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:27,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:27,602 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-17 20:01:27,602 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-17 20:01:27,604 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-17 20:01:27,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:27,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:27,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:27,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:27,614 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:27,614 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:27,616 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:27,621 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-17 20:01:27,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:27,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:27,623 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-17 20:01:27,623 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-17 20:01:27,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-17 20:01:27,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:27,634 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:27,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:27,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:27,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:27,634 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:27,634 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:27,635 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:27,640 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-17 20:01:27,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:27,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:27,642 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-17 20:01:27,642 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-17 20:01:27,643 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-17 20:01:27,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:27,652 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:27,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:27,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:27,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:27,653 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:27,653 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:27,653 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:27,659 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-17 20:01:27,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:27,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:27,660 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-17 20:01:27,661 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-17 20:01:27,662 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-17 20:01:27,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:27,671 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:27,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:27,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:27,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:27,671 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:27,672 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:27,672 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:27,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:27,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:27,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:27,679 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-17 20:01:27,680 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-17 20:01:27,681 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:01:27,690 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:27,690 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:27,690 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:27,690 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:27,690 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:27,690 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:27,690 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:27,691 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:27,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:27,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:27,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:27,698 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-17 20:01:27,698 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-17 20:01:27,699 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-17 20:01:27,708 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:27,708 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:27,708 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:27,708 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:27,708 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:27,708 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:27,708 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:27,709 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:27,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:27,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:27,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:27,716 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-17 20:01:27,717 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-17 20:01:27,718 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:01:27,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:27,727 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:27,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:27,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:27,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:27,728 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:27,728 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:27,729 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:27,733 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-17 20:01:27,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:27,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:27,735 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-17 20:01:27,736 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-17 20:01:27,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-17 20:01:27,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:27,746 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:27,746 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:27,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:27,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:27,746 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:27,746 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:27,747 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:27,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:27,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:27,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:27,754 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-17 20:01:27,754 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-17 20:01:27,756 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-17 20:01:27,765 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:27,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:27,765 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:27,765 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:27,766 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:27,766 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:27,768 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:27,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:27,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:27,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:27,776 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-17 20:01:27,776 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-17 20:01:27,777 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-17 20:01:27,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:27,787 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:27,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:27,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:27,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:27,787 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:27,787 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:27,788 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:27,793 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-17 20:01:27,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:27,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:27,795 INFO L229 MonitoredProcess]: Starting monitored process 79 with /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-17 20:01:27,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2025-03-17 20:01:27,796 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-17 20:01:27,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:27,805 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:27,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:27,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:27,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:27,806 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:27,806 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:27,807 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:27,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2025-03-17 20:01:27,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:27,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:27,814 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-17 20:01:27,815 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-17 20:01:27,817 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-17 20:01:27,826 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:27,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:27,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:27,827 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:27,827 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:27,827 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:27,829 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:27,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2025-03-17 20:01:27,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:27,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:27,836 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-17 20:01:27,837 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-17 20:01:27,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-17 20:01:27,847 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:27,847 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:27,847 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:27,847 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:27,847 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:27,848 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:27,848 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:27,848 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:27,854 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-17 20:01:27,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:27,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:27,855 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-17 20:01:27,856 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-17 20:01:27,857 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-17 20:01:27,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:27,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:27,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:27,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:27,867 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:27,867 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:27,870 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:27,875 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-17 20:01:27,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:27,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:27,877 INFO L229 MonitoredProcess]: Starting monitored process 83 with /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-17 20:01:27,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2025-03-17 20:01:27,878 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-17 20:01:27,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:27,887 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:27,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:27,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:27,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:27,888 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:27,888 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:27,889 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:27,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2025-03-17 20:01:27,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:27,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:27,895 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-17 20:01:27,896 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-17 20:01:27,897 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-17 20:01:27,906 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:27,906 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:27,906 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:27,906 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:27,909 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:27,909 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:27,914 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:27,919 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-17 20:01:27,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:27,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:27,921 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-17 20:01:27,922 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-17 20:01:27,923 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-17 20:01:27,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:27,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:27,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:27,932 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:27,934 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:27,934 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:27,937 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:27,942 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-17 20:01:27,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:27,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:27,944 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-17 20:01:27,944 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-17 20:01:27,946 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-17 20:01:27,955 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:27,955 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:27,955 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:27,955 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:27,958 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:27,958 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:27,963 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:01:27,970 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-03-17 20:01:27,970 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-03-17 20:01:27,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:27,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:27,972 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-17 20:01:27,973 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-17 20:01:27,973 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:01:27,983 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 20:01:27,983 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:01:27,983 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 4))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 4))_1 Supporting invariants [] [2025-03-17 20:01:27,989 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-17 20:01:27,996 INFO L156 tatePredicateManager]: 4 out of 6 supporting invariants were superfluous and have been removed [2025-03-17 20:01:27,998 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-17 20:01:27,998 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-17 20:01:27,998 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc12!base,]]] [2025-03-17 20:01:28,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:28,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 20:01:28,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 20:01:28,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:28,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:28,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 20:01:28,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:28,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:28,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:28,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:28,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:28,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 20:01:28,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:28,102 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-17 20:01:28,103 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-17 20:01:28,103 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 44 transitions. cyclomatic complexity: 20 Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-17 20:01:28,128 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 44 transitions. cyclomatic complexity: 20. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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 33 states and 46 transitions. Complement of second has 5 states. [2025-03-17 20:01:28,128 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-17 20:01:28,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-17 20:01:28,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2025-03-17 20:01:28,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 15 letters. Loop has 2 letters. [2025-03-17 20:01:28,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:28,129 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 20:01:28,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:28,153 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-17 20:01:28,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 20:01:28,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 20:01:28,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:28,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:28,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 20:01:28,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:28,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:28,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:28,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:28,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:28,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 20:01:28,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:28,244 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-17 20:01:28,244 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-17 20:01:28,244 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 44 transitions. cyclomatic complexity: 20 Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-17 20:01:28,262 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 44 transitions. cyclomatic complexity: 20. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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 33 states and 46 transitions. Complement of second has 5 states. [2025-03-17 20:01:28,263 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-17 20:01:28,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-17 20:01:28,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2025-03-17 20:01:28,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 15 letters. Loop has 2 letters. [2025-03-17 20:01:28,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:28,264 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 20:01:28,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:28,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 20:01:28,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 20:01:28,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:28,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:28,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 20:01:28,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:28,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:28,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:28,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:28,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:28,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 20:01:28,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:28,363 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-17 20:01:28,363 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-17 20:01:28,364 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 44 transitions. cyclomatic complexity: 20 Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-17 20:01:28,417 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 44 transitions. cyclomatic complexity: 20. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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 45 states and 60 transitions. Complement of second has 11 states. [2025-03-17 20:01:28,418 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-17 20:01:28,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-17 20:01:28,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 36 transitions. [2025-03-17 20:01:28,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 36 transitions. Stem has 15 letters. Loop has 2 letters. [2025-03-17 20:01:28,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:28,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 36 transitions. Stem has 17 letters. Loop has 2 letters. [2025-03-17 20:01:28,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:28,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 36 transitions. Stem has 15 letters. Loop has 4 letters. [2025-03-17 20:01:28,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:28,419 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 60 transitions. [2025-03-17 20:01:28,420 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-17 20:01:28,420 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 36 states and 47 transitions. [2025-03-17 20:01:28,420 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-17 20:01:28,420 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-17 20:01:28,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 47 transitions. [2025-03-17 20:01:28,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:01:28,420 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 47 transitions. [2025-03-17 20:01:28,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 47 transitions. [2025-03-17 20:01:28,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2025-03-17 20:01:28,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 30 states have internal predecessors, (41), 0 states have call successors, (0), 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-17 20:01:28,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2025-03-17 20:01:28,421 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 41 transitions. [2025-03-17 20:01:28,421 INFO L432 stractBuchiCegarLoop]: Abstraction has 31 states and 41 transitions. [2025-03-17 20:01:28,421 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-17 20:01:28,421 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 41 transitions. [2025-03-17 20:01:28,423 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-17 20:01:28,423 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:01:28,423 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:01:28,424 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-03-17 20:01:28,424 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:01:28,424 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-17 20:01:28,424 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-17 20:01:28,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:28,424 INFO L85 PathProgramCache]: Analyzing trace with hash -2103831998, now seen corresponding path program 5 times [2025-03-17 20:01:28,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:28,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354774301] [2025-03-17 20:01:28,424 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 20:01:28,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:28,430 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 3 equivalence classes. [2025-03-17 20:01:28,434 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 20:01:28,434 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-17 20:01:28,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:28,505 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:01:28,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:01:28,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354774301] [2025-03-17 20:01:28,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354774301] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:01:28,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574324093] [2025-03-17 20:01:28,506 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 20:01:28,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:01:28,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:28,507 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:01:28,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Waiting until timeout for monitored process [2025-03-17 20:01:28,541 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 3 equivalence classes. [2025-03-17 20:01:28,549 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 20:01:28,549 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-17 20:01:28,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:28,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 20:01:28,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:28,597 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:01:28,597 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:01:28,625 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:01:28,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574324093] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:01:28,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:01:28,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2025-03-17 20:01:28,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329324221] [2025-03-17 20:01:28,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:01:28,626 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:01:28,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:28,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1344, now seen corresponding path program 4 times [2025-03-17 20:01:28,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:28,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571558963] [2025-03-17 20:01:28,626 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 20:01:28,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:28,631 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-03-17 20:01:28,632 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:28,632 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 20:01:28,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:28,632 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:28,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:28,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:28,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:28,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:28,635 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:28,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:01:28,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 20:01:28,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-17 20:01:28,664 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. cyclomatic complexity: 18 Second operand has 11 states, 10 states have (on average 3.3) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:01:28,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:01:28,698 INFO L93 Difference]: Finished difference Result 49 states and 63 transitions. [2025-03-17 20:01:28,698 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 63 transitions. [2025-03-17 20:01:28,699 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-17 20:01:28,699 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 32 states and 42 transitions. [2025-03-17 20:01:28,699 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-17 20:01:28,699 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-17 20:01:28,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 42 transitions. [2025-03-17 20:01:28,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:01:28,699 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 42 transitions. [2025-03-17 20:01:28,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 42 transitions. [2025-03-17 20:01:28,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-17 20:01:28,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.3125) internal successors, (42), 31 states have internal predecessors, (42), 0 states have call successors, (0), 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-17 20:01:28,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2025-03-17 20:01:28,700 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 42 transitions. [2025-03-17 20:01:28,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 20:01:28,703 INFO L432 stractBuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2025-03-17 20:01:28,703 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-17 20:01:28,703 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 42 transitions. [2025-03-17 20:01:28,704 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-17 20:01:28,705 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:01:28,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:01:28,705 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-03-17 20:01:28,705 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:01:28,705 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-17 20:01:28,705 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-17 20:01:28,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:28,705 INFO L85 PathProgramCache]: Analyzing trace with hash 415100112, now seen corresponding path program 6 times [2025-03-17 20:01:28,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:28,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675583030] [2025-03-17 20:01:28,705 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 20:01:28,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:28,711 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 3 equivalence classes. [2025-03-17 20:01:28,724 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 20:01:28,724 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-17 20:01:28,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:28,724 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:28,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 20:01:28,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 20:01:28,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:28,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:28,734 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:28,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:28,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1344, now seen corresponding path program 5 times [2025-03-17 20:01:28,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:28,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610448094] [2025-03-17 20:01:28,735 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 20:01:28,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:28,738 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:28,739 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:28,740 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:01:28,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:28,740 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:28,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:28,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:28,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:28,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:28,744 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:28,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:28,744 INFO L85 PathProgramCache]: Analyzing trace with hash -520750513, now seen corresponding path program 2 times [2025-03-17 20:01:28,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:28,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711564526] [2025-03-17 20:01:28,746 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:01:28,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:28,750 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-17 20:01:28,758 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 20:01:28,758 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:01:28,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:28,758 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:28,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 20:01:28,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 20:01:28,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:28,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:28,769 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:29,086 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:01:29,086 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:01:29,086 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:01:29,086 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:01:29,086 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:01:29,086 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:29,086 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:01:29,086 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:01:29,086 INFO L132 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration11_Lasso [2025-03-17 20:01:29,086 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:01:29,086 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:01:29,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:29,093 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:29,094 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:29,095 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:29,096 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:29,098 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:29,204 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:29,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:29,207 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:29,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:29,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:29,216 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:29,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:29,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:29,220 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:29,221 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:29,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:29,223 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:29,224 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:29,225 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:29,226 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:29,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:29,230 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:29,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:29,232 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:29,408 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:01:29,408 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:01:29,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:29,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:29,413 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-17 20:01:29,414 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-17 20:01:29,415 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-17 20:01:29,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:29,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:29,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:29,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:29,425 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:29,425 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:29,427 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:29,432 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-17 20:01:29,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:29,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:29,435 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-17 20:01:29,435 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-17 20:01:29,436 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-17 20:01:29,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:29,446 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:29,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:29,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:29,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:29,446 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:29,446 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:29,447 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:29,453 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-17 20:01:29,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:29,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:29,454 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-17 20:01:29,455 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-17 20:01:29,456 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-17 20:01:29,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:29,466 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:29,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:29,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:29,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:29,466 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:29,466 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:29,467 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:29,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2025-03-17 20:01:29,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:29,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:29,474 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-17 20:01:29,475 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-17 20:01:29,476 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-17 20:01:29,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:29,486 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:29,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:29,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:29,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:29,486 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:29,486 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:29,487 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:29,492 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-17 20:01:29,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:29,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:29,494 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-17 20:01:29,495 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-17 20:01:29,497 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-17 20:01:29,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:29,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:29,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:29,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:29,507 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:29,507 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:29,510 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:29,515 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-17 20:01:29,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:29,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:29,517 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-17 20:01:29,518 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-17 20:01:29,518 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-17 20:01:29,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:29,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:29,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:29,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:29,530 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:29,530 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:29,533 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:29,538 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-17 20:01:29,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:29,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:29,540 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-17 20:01:29,541 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-17 20:01:29,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-17 20:01:29,551 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:29,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:29,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:29,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:29,553 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:29,553 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:29,558 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:01:29,564 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-03-17 20:01:29,564 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-03-17 20:01:29,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:29,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:29,566 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-17 20:01:29,567 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-17 20:01:29,567 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:01:29,577 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 20:01:29,577 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:01:29,577 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) 8)_1) = -1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) 8)_1 Supporting invariants [] [2025-03-17 20:01:29,582 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-17 20:01:29,591 INFO L156 tatePredicateManager]: 5 out of 7 supporting invariants were superfluous and have been removed [2025-03-17 20:01:29,594 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-17 20:01:29,594 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-17 20:01:29,594 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc12!base,]]] [2025-03-17 20:01:29,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:29,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 20:01:29,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 20:01:29,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:29,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:29,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-17 20:01:29,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:29,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:29,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:29,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:29,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:29,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 20:01:29,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:29,767 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-17 20:01:29,767 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2025-03-17 20:01:29,767 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 42 transitions. cyclomatic complexity: 18 Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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-17 20:01:29,786 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 42 transitions. cyclomatic complexity: 18. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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 33 states and 44 transitions. Complement of second has 5 states. [2025-03-17 20:01:29,787 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-17 20:01:29,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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-17 20:01:29,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-17 20:01:29,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 20 letters. Loop has 2 letters. [2025-03-17 20:01:29,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:29,787 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 20:01:29,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:29,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 20:01:29,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 20:01:29,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:29,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:29,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-17 20:01:29,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:29,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:29,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:29,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:29,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:29,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 20:01:29,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:29,945 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-17 20:01:29,946 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.5 stem predicates 2 loop predicates [2025-03-17 20:01:29,946 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 42 transitions. cyclomatic complexity: 18 Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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-17 20:01:29,967 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 42 transitions. cyclomatic complexity: 18. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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 33 states and 44 transitions. Complement of second has 5 states. [2025-03-17 20:01:29,969 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-17 20:01:29,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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-17 20:01:29,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-17 20:01:29,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 20 letters. Loop has 2 letters. [2025-03-17 20:01:29,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:29,971 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 20:01:29,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:29,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 20:01:30,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 20:01:30,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:30,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:30,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-17 20:01:30,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:30,046 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-17 20:01:30,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:30,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:30,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:30,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:30,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 20:01:30,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:30,134 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-17 20:01:30,134 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2025-03-17 20:01:30,135 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 42 transitions. cyclomatic complexity: 18 Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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-17 20:01:30,218 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 42 transitions. cyclomatic complexity: 18. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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 61 states and 80 transitions. Complement of second has 13 states. [2025-03-17 20:01:30,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 5 stem states 2 non-accepting loop states 2 accepting loop states [2025-03-17 20:01:30,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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-17 20:01:30,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 47 transitions. [2025-03-17 20:01:30,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 47 transitions. Stem has 20 letters. Loop has 2 letters. [2025-03-17 20:01:30,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:30,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 47 transitions. Stem has 22 letters. Loop has 2 letters. [2025-03-17 20:01:30,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:30,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 47 transitions. Stem has 20 letters. Loop has 4 letters. [2025-03-17 20:01:30,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:30,220 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 80 transitions. [2025-03-17 20:01:30,220 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-03-17 20:01:30,221 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 56 states and 75 transitions. [2025-03-17 20:01:30,221 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2025-03-17 20:01:30,221 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2025-03-17 20:01:30,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 75 transitions. [2025-03-17 20:01:30,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:01:30,221 INFO L218 hiAutomatonCegarLoop]: Abstraction has 56 states and 75 transitions. [2025-03-17 20:01:30,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 75 transitions. [2025-03-17 20:01:30,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 41. [2025-03-17 20:01:30,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 40 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-17 20:01:30,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2025-03-17 20:01:30,222 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 55 transitions. [2025-03-17 20:01:30,222 INFO L432 stractBuchiCegarLoop]: Abstraction has 41 states and 55 transitions. [2025-03-17 20:01:30,222 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-03-17 20:01:30,222 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 55 transitions. [2025-03-17 20:01:30,223 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-17 20:01:30,223 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:01:30,223 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:01:30,223 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1] [2025-03-17 20:01:30,223 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:01:30,223 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" [2025-03-17 20:01:30,223 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem6#1 > 0;havoc test_fun_#t~mem6#1;call test_fun_#t~mem7#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post8#1 := test_fun_#t~mem7#1;call write~int#0(test_fun_#t~post8#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem7#1;havoc test_fun_#t~post8#1;test_fun_#t~post9#1 := test_fun_~pos~0#1;test_fun_~pos~0#1 := 1 + test_fun_#t~post9#1;havoc test_fun_#t~post9#1;" [2025-03-17 20:01:30,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:30,224 INFO L85 PathProgramCache]: Analyzing trace with hash -520750514, now seen corresponding path program 7 times [2025-03-17 20:01:30,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:30,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841169957] [2025-03-17 20:01:30,224 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 20:01:30,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:30,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 20:01:30,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 20:01:30,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:30,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:30,237 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:30,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 20:01:30,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 20:01:30,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:30,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:30,245 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:30,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:30,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1152, now seen corresponding path program 3 times [2025-03-17 20:01:30,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:30,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284318659] [2025-03-17 20:01:30,246 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:01:30,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:30,248 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:30,249 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:30,249 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 20:01:30,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:30,249 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:30,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:30,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:30,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:30,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:30,251 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:30,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:30,251 INFO L85 PathProgramCache]: Analyzing trace with hash 2069929869, now seen corresponding path program 2 times [2025-03-17 20:01:30,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:30,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497293412] [2025-03-17 20:01:30,252 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:01:30,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:30,256 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-17 20:01:30,261 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 20:01:30,261 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:01:30,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:30,261 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:30,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 20:01:30,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 20:01:30,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:30,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:30,269 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:30,660 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:01:30,660 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:01:30,660 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:01:30,660 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:01:30,660 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:01:30,660 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:30,660 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:01:30,660 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:01:30,660 INFO L132 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration12_Lasso [2025-03-17 20:01:30,660 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:01:30,660 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:01:30,661 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:30,662 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:30,663 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:30,665 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:30,666 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:30,667 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:30,668 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:30,669 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:30,670 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:30,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:30,672 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:30,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:30,674 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:30,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:30,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:30,678 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:30,679 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:30,681 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:30,682 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:30,683 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:30,684 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:30,685 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:30,830 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:30,832 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:31,019 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:01:31,019 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:01:31,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:31,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:31,021 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-17 20:01:31,021 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-17 20:01:31,022 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-17 20:01:31,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:31,032 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:31,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:31,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:31,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:31,032 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:31,033 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:31,033 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:31,038 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-17 20:01:31,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:31,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:31,040 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-17 20:01:31,041 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-17 20:01:31,042 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-17 20:01:31,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:31,051 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:31,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:31,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:31,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:31,052 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:31,052 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:31,053 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:31,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:31,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:31,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:31,060 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-17 20:01:31,060 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-17 20:01:31,061 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-17 20:01:31,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:31,070 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:31,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:31,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:31,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:31,071 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:31,071 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:31,072 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:31,076 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-17 20:01:31,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:31,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:31,078 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-17 20:01:31,079 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-17 20:01:31,080 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-17 20:01:31,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:31,090 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:31,090 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:31,090 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:31,090 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:31,090 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:31,090 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:31,091 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:31,096 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-17 20:01:31,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:31,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:31,098 INFO L229 MonitoredProcess]: Starting monitored process 101 with /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-17 20:01:31,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2025-03-17 20:01:31,099 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-17 20:01:31,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:31,109 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:31,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:31,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:31,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:31,109 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:31,109 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:31,110 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:31,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0 [2025-03-17 20:01:31,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:31,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:31,117 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-17 20:01:31,118 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-17 20:01:31,119 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-17 20:01:31,128 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:31,128 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:31,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:31,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:31,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:31,129 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:31,129 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:31,129 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:31,134 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-17 20:01:31,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:31,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:31,136 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-17 20:01:31,137 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-17 20:01:31,138 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-17 20:01:31,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:31,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:31,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:31,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:31,148 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:31,148 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:31,150 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:31,156 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-17 20:01:31,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:31,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:31,157 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-17 20:01:31,158 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-17 20:01:31,159 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-17 20:01:31,168 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:31,169 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:31,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:31,169 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:31,169 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:31,169 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:31,169 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:31,170 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:31,175 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-17 20:01:31,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:31,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:31,176 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-17 20:01:31,177 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-17 20:01:31,178 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-17 20:01:31,188 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:31,188 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:31,188 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:31,188 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:31,188 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:31,188 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:31,188 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:31,189 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:31,194 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-17 20:01:31,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:31,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:31,196 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-17 20:01:31,196 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-17 20:01:31,197 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-17 20:01:31,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:31,207 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:31,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:31,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:31,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:31,207 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:31,207 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:31,208 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:31,213 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-17 20:01:31,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:31,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:31,215 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-17 20:01:31,215 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-17 20:01:31,216 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-17 20:01:31,226 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:31,226 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:31,226 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:31,226 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:31,226 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:31,226 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:31,226 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:31,227 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:31,232 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-17 20:01:31,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:31,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:31,234 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-17 20:01:31,234 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-17 20:01:31,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-17 20:01:31,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:31,245 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:31,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:31,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:31,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:31,245 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:31,245 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:31,246 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:31,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:31,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:31,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:31,254 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-17 20:01:31,254 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-17 20:01:31,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-17 20:01:31,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:31,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:31,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:31,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:31,266 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:31,266 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:31,268 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:31,274 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-17 20:01:31,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:31,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:31,275 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-17 20:01:31,276 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-17 20:01:31,277 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-17 20:01:31,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:31,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:31,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:31,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:31,288 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:31,288 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:31,290 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:31,295 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-17 20:01:31,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:31,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:31,297 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-17 20:01:31,297 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-17 20:01:31,298 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-17 20:01:31,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:31,308 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:31,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:31,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:31,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:31,308 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:31,308 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:31,309 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:31,314 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-17 20:01:31,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:31,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:31,316 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-17 20:01:31,317 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-17 20:01:31,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-17 20:01:31,327 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:31,327 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:31,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:31,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:31,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:31,327 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:31,327 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:31,328 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:31,333 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-17 20:01:31,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:31,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:31,335 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-17 20:01:31,336 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-17 20:01:31,336 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-17 20:01:31,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:31,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:31,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:31,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:31,347 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:31,347 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:31,349 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:31,354 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-17 20:01:31,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:31,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:31,356 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-17 20:01:31,356 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-17 20:01:31,357 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-17 20:01:31,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:31,367 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:31,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:31,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:31,367 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:31,367 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:31,367 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:31,368 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:31,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Ended with exit code 0 [2025-03-17 20:01:31,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:31,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:31,374 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-17 20:01:31,375 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-17 20:01:31,376 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-17 20:01:31,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:31,385 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:31,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:31,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:31,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:31,385 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:31,386 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:31,386 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:31,391 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-17 20:01:31,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:31,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:31,393 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-17 20:01:31,394 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-17 20:01:31,395 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-17 20:01:31,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:31,404 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:31,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:31,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:31,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:31,404 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:31,404 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:31,405 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:31,410 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-17 20:01:31,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:31,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:31,412 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-17 20:01:31,412 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-17 20:01:31,414 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-17 20:01:31,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:31,423 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:31,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:31,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:31,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:31,423 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:31,423 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:31,424 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:31,430 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-17 20:01:31,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:31,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:31,432 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-17 20:01:31,432 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-17 20:01:31,434 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-17 20:01:31,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:31,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:31,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:31,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:31,445 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:31,445 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:31,449 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:31,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Ended with exit code 0 [2025-03-17 20:01:31,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:31,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:31,455 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-17 20:01:31,456 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-17 20:01:31,457 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-17 20:01:31,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:31,467 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:31,467 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:31,467 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:31,470 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:31,470 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:31,475 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:01:31,488 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2025-03-17 20:01:31,488 INFO L444 ModelExtractionUtils]: 2 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-03-17 20:01:31,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:31,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:31,490 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-17 20:01:31,491 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-17 20:01:31,492 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:01:31,501 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 20:01:31,502 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:01:31,502 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) 8)_2) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) 8)_2 Supporting invariants [] [2025-03-17 20:01:31,507 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-17 20:01:31,517 INFO L156 tatePredicateManager]: 5 out of 7 supporting invariants were superfluous and have been removed [2025-03-17 20:01:31,519 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-17 20:01:31,519 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-17 20:01:31,519 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc12!base,]]] [2025-03-17 20:01:31,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:31,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 20:01:31,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 20:01:31,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:31,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:31,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-17 20:01:31,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:31,688 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-17 20:01:31,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:31,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:31,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:31,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:31,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 20:01:31,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:31,708 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-17 20:01:31,708 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2025-03-17 20:01:31,708 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 55 transitions. cyclomatic complexity: 24 Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 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-17 20:01:31,729 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 55 transitions. cyclomatic complexity: 24. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 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) Result 42 states and 57 transitions. Complement of second has 5 states. [2025-03-17 20:01:31,730 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-17 20:01:31,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 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-17 20:01:31,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2025-03-17 20:01:31,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 22 letters. Loop has 2 letters. [2025-03-17 20:01:31,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:31,730 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 20:01:31,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:31,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 20:01:31,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 20:01:31,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:31,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:31,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-17 20:01:31,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:31,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:31,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:31,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:31,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:31,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 20:01:31,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:31,901 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-17 20:01:31,902 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.5 stem predicates 2 loop predicates [2025-03-17 20:01:31,902 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 55 transitions. cyclomatic complexity: 24 Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 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-17 20:01:31,923 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 55 transitions. cyclomatic complexity: 24. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 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) Result 42 states and 57 transitions. Complement of second has 5 states. [2025-03-17 20:01:31,923 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-17 20:01:31,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 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-17 20:01:31,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2025-03-17 20:01:31,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 22 letters. Loop has 2 letters. [2025-03-17 20:01:31,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:31,924 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 20:01:31,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:31,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 20:01:31,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 20:01:31,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:31,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:31,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-17 20:01:31,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:32,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:32,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:32,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:32,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:32,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 20:01:32,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:32,085 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-17 20:01:32,085 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2025-03-17 20:01:32,086 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 55 transitions. cyclomatic complexity: 24 Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 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-17 20:01:32,164 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 55 transitions. cyclomatic complexity: 24. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 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) Result 55 states and 73 transitions. Complement of second has 13 states. [2025-03-17 20:01:32,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 5 stem states 2 non-accepting loop states 2 accepting loop states [2025-03-17 20:01:32,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 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-17 20:01:32,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 45 transitions. [2025-03-17 20:01:32,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 45 transitions. Stem has 22 letters. Loop has 2 letters. [2025-03-17 20:01:32,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:32,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 45 transitions. Stem has 24 letters. Loop has 2 letters. [2025-03-17 20:01:32,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:32,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 45 transitions. Stem has 22 letters. Loop has 4 letters. [2025-03-17 20:01:32,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:32,165 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 73 transitions. [2025-03-17 20:01:32,165 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-17 20:01:32,166 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 46 states and 60 transitions. [2025-03-17 20:01:32,166 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-17 20:01:32,166 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-17 20:01:32,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 60 transitions. [2025-03-17 20:01:32,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:01:32,166 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 60 transitions. [2025-03-17 20:01:32,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 60 transitions. [2025-03-17 20:01:32,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2025-03-17 20:01:32,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.3) internal successors, (52), 39 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-17 20:01:32,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2025-03-17 20:01:32,167 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 52 transitions. [2025-03-17 20:01:32,167 INFO L432 stractBuchiCegarLoop]: Abstraction has 40 states and 52 transitions. [2025-03-17 20:01:32,167 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-03-17 20:01:32,167 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 52 transitions. [2025-03-17 20:01:32,168 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-17 20:01:32,168 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:01:32,168 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:01:32,168 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2025-03-17 20:01:32,168 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:01:32,168 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-17 20:01:32,168 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-17 20:01:32,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:32,168 INFO L85 PathProgramCache]: Analyzing trace with hash 632745145, now seen corresponding path program 8 times [2025-03-17 20:01:32,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:32,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923041975] [2025-03-17 20:01:32,169 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:01:32,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:32,176 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-17 20:01:32,180 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 20:01:32,180 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:01:32,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:32,287 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:01:32,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:01:32,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923041975] [2025-03-17 20:01:32,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923041975] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:01:32,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915881102] [2025-03-17 20:01:32,287 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:01:32,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:01:32,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:32,289 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:01:32,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Waiting until timeout for monitored process [2025-03-17 20:01:32,331 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-17 20:01:32,340 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 20:01:32,340 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:01:32,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:32,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 20:01:32,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:32,419 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:01:32,419 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:01:32,472 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:01:32,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915881102] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:01:32,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:01:32,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-17 20:01:32,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306633906] [2025-03-17 20:01:32,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:01:32,472 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:01:32,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:32,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1344, now seen corresponding path program 6 times [2025-03-17 20:01:32,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:32,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216103758] [2025-03-17 20:01:32,473 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 20:01:32,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:32,476 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:32,477 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:32,477 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-17 20:01:32,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:32,477 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:32,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:32,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:32,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:32,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:32,479 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:32,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:01:32,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 20:01:32,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2025-03-17 20:01:32,505 INFO L87 Difference]: Start difference. First operand 40 states and 52 transitions. cyclomatic complexity: 22 Second operand has 16 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 16 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-17 20:01:32,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:01:32,564 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2025-03-17 20:01:32,564 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 84 transitions. [2025-03-17 20:01:32,565 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-17 20:01:32,565 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 41 states and 53 transitions. [2025-03-17 20:01:32,565 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-17 20:01:32,565 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-17 20:01:32,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 53 transitions. [2025-03-17 20:01:32,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:01:32,565 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 53 transitions. [2025-03-17 20:01:32,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 53 transitions. [2025-03-17 20:01:32,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-03-17 20:01:32,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 40 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:01:32,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2025-03-17 20:01:32,567 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 53 transitions. [2025-03-17 20:01:32,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 20:01:32,570 INFO L432 stractBuchiCegarLoop]: Abstraction has 41 states and 53 transitions. [2025-03-17 20:01:32,570 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-03-17 20:01:32,570 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 53 transitions. [2025-03-17 20:01:32,571 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-17 20:01:32,571 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:01:32,571 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:01:32,571 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2025-03-17 20:01:32,571 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:01:32,571 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-17 20:01:32,571 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-17 20:01:32,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:32,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1364244075, now seen corresponding path program 9 times [2025-03-17 20:01:32,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:32,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587618109] [2025-03-17 20:01:32,572 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:01:32,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:32,577 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 4 equivalence classes. [2025-03-17 20:01:32,596 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 20:01:32,596 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-17 20:01:32,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:32,596 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:32,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 20:01:32,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 20:01:32,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:32,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:32,609 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:32,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:32,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1344, now seen corresponding path program 7 times [2025-03-17 20:01:32,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:32,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240391376] [2025-03-17 20:01:32,609 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 20:01:32,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:32,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:32,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:32,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:32,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:32,612 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:32,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:32,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:32,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:32,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:32,614 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:32,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:32,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1073531178, now seen corresponding path program 3 times [2025-03-17 20:01:32,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:32,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861293165] [2025-03-17 20:01:32,617 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:01:32,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:32,622 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-03-17 20:01:32,639 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 20:01:32,639 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-17 20:01:32,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:32,640 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:32,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 20:01:32,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 20:01:32,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:32,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:32,651 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:33,168 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:01:33,168 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:01:33,168 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:01:33,168 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:01:33,168 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:01:33,168 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:33,168 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:01:33,169 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:01:33,169 INFO L132 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration14_Lasso [2025-03-17 20:01:33,169 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:01:33,169 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:01:33,170 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:33,173 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:33,174 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:33,175 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:33,177 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:33,179 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:33,180 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:33,181 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:33,182 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:33,184 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:33,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:33,190 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:33,191 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:33,193 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:33,194 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:33,195 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:33,196 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:33,313 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:33,314 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:33,315 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:33,316 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:33,317 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:33,318 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:33,319 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:33,494 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:01:33,494 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:01:33,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:33,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:33,495 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-17 20:01:33,496 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-17 20:01:33,497 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-17 20:01:33,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:33,507 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:33,507 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:33,507 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:33,507 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:33,507 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:33,507 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:33,508 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:33,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:33,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:33,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:33,515 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-17 20:01:33,516 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-17 20:01:33,517 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-17 20:01:33,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:33,526 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:33,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:33,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:33,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:33,526 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:33,526 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:33,527 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:33,533 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-17 20:01:33,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:33,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:33,535 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-17 20:01:33,535 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-17 20:01:33,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-17 20:01:33,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:33,546 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:33,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:33,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:33,546 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:33,546 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:33,546 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:33,547 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:33,552 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-17 20:01:33,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:33,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:33,554 INFO L229 MonitoredProcess]: Starting monitored process 125 with /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-17 20:01:33,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2025-03-17 20:01:33,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-17 20:01:33,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:33,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:33,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:33,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:33,566 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:33,566 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:33,568 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:33,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:33,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:33,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:33,575 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-17 20:01:33,576 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-17 20:01:33,577 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-17 20:01:33,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:33,586 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:33,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:33,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:33,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:33,586 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:33,586 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:33,587 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:33,592 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-17 20:01:33,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:33,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:33,594 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-17 20:01:33,595 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-17 20:01:33,596 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-17 20:01:33,605 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:33,605 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:33,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:33,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:33,606 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:33,606 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:33,606 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:33,607 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:33,612 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-17 20:01:33,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:33,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:33,614 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-17 20:01:33,615 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-17 20:01:33,616 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-17 20:01:33,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:33,626 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:33,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:33,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:33,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:33,626 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:33,626 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:33,627 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:33,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:33,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:33,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:33,635 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-17 20:01:33,636 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-17 20:01:33,636 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-17 20:01:33,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:33,646 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:33,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:33,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:33,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:33,646 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:33,646 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:33,647 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:33,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Ended with exit code 0 [2025-03-17 20:01:33,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:33,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:33,654 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-17 20:01:33,654 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-17 20:01:33,655 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-17 20:01:33,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:33,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:33,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:33,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:33,666 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:33,666 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:33,668 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:33,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Ended with exit code 0 [2025-03-17 20:01:33,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:33,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:33,678 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-17 20:01:33,679 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-17 20:01:33,680 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-17 20:01:33,689 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:33,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:33,689 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:33,689 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:33,690 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:33,690 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:33,692 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:33,697 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-17 20:01:33,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:33,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:33,699 INFO L229 MonitoredProcess]: Starting monitored process 132 with /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-17 20:01:33,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2025-03-17 20:01:33,701 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-17 20:01:33,710 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:33,710 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:33,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:33,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:33,710 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:33,711 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:33,711 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:33,711 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:33,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Ended with exit code 0 [2025-03-17 20:01:33,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:33,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:33,718 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-17 20:01:33,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-17 20:01:33,720 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-17 20:01:33,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:33,729 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:33,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:33,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:33,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:33,730 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:33,730 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:33,730 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:33,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:33,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:33,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:33,738 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-17 20:01:33,739 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-17 20:01:33,740 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-17 20:01:33,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:33,749 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:33,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:33,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:33,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:33,749 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:33,749 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:33,750 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:33,755 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-17 20:01:33,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:33,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:33,757 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-17 20:01:33,758 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-17 20:01:33,759 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-17 20:01:33,768 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:33,768 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:33,768 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:33,768 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:33,768 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:33,769 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:33,769 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:33,769 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:33,775 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-17 20:01:33,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:33,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:33,777 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-17 20:01:33,778 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-17 20:01:33,778 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-17 20:01:33,788 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:33,788 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:33,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:33,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:33,789 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:33,789 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:33,791 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:33,796 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-17 20:01:33,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:33,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:33,798 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-17 20:01:33,799 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-17 20:01:33,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-17 20:01:33,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:33,810 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:33,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:33,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:33,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:33,810 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:33,810 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:33,811 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:33,816 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-17 20:01:33,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:33,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:33,818 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-17 20:01:33,819 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-17 20:01:33,820 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:01:33,829 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:33,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:33,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:33,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:33,830 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:33,831 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:33,833 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:33,839 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-17 20:01:33,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:33,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:33,841 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-17 20:01:33,841 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-17 20:01:33,842 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-17 20:01:33,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:33,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:33,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:33,852 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:33,853 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:33,853 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:33,857 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:01:33,861 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-03-17 20:01:33,861 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-03-17 20:01:33,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:33,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:33,863 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-17 20:01:33,863 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-17 20:01:33,864 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:01:33,874 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 20:01:33,874 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:01:33,874 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~a#1.base) 12)_1) = -1*v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~a#1.base) 12)_1 Supporting invariants [] [2025-03-17 20:01:33,880 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-17 20:01:33,888 INFO L156 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2025-03-17 20:01:33,890 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-17 20:01:33,890 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-17 20:01:33,890 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~a!base,]]] [2025-03-17 20:01:33,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:33,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 20:01:33,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 20:01:33,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:33,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:33,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 20:01:33,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:34,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:34,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:34,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:34,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:34,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 20:01:34,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:34,033 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-17 20:01:34,033 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-17 20:01:34,033 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 53 transitions. cyclomatic complexity: 22 Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 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-17 20:01:34,055 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 53 transitions. cyclomatic complexity: 22. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 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 42 states and 55 transitions. Complement of second has 5 states. [2025-03-17 20:01:34,055 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-17 20:01:34,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 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-17 20:01:34,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-17 20:01:34,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 27 letters. Loop has 2 letters. [2025-03-17 20:01:34,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:34,055 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 20:01:34,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:34,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 20:01:34,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 20:01:34,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:34,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:34,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 20:01:34,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:34,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:34,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:34,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:34,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:34,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:34,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 20:01:34,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:34,225 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-17 20:01:34,225 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-17 20:01:34,225 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 53 transitions. cyclomatic complexity: 22 Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 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-17 20:01:34,240 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 53 transitions. cyclomatic complexity: 22. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 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 42 states and 55 transitions. Complement of second has 5 states. [2025-03-17 20:01:34,240 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-17 20:01:34,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 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-17 20:01:34,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-17 20:01:34,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 27 letters. Loop has 2 letters. [2025-03-17 20:01:34,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:34,241 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 20:01:34,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:34,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 20:01:34,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 20:01:34,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:34,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:34,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 20:01:34,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:34,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:34,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:34,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:34,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:34,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 20:01:34,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:34,398 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-17 20:01:34,398 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-17 20:01:34,399 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 53 transitions. cyclomatic complexity: 22 Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 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-17 20:01:34,488 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 53 transitions. cyclomatic complexity: 22. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 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 93 transitions. Complement of second has 15 states. [2025-03-17 20:01:34,488 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-17 20:01:34,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 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-17 20:01:34,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 56 transitions. [2025-03-17 20:01:34,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 56 transitions. Stem has 27 letters. Loop has 2 letters. [2025-03-17 20:01:34,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:34,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 56 transitions. Stem has 29 letters. Loop has 2 letters. [2025-03-17 20:01:34,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:34,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 56 transitions. Stem has 27 letters. Loop has 4 letters. [2025-03-17 20:01:34,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:34,489 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 93 transitions. [2025-03-17 20:01:34,489 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-03-17 20:01:34,490 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 66 states and 88 transitions. [2025-03-17 20:01:34,490 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2025-03-17 20:01:34,490 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2025-03-17 20:01:34,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 88 transitions. [2025-03-17 20:01:34,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:01:34,490 INFO L218 hiAutomatonCegarLoop]: Abstraction has 66 states and 88 transitions. [2025-03-17 20:01:34,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 88 transitions. [2025-03-17 20:01:34,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 50. [2025-03-17 20:01:34,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.32) internal successors, (66), 49 states have internal predecessors, (66), 0 states have call successors, (0), 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-17 20:01:34,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2025-03-17 20:01:34,492 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 66 transitions. [2025-03-17 20:01:34,492 INFO L432 stractBuchiCegarLoop]: Abstraction has 50 states and 66 transitions. [2025-03-17 20:01:34,492 INFO L338 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2025-03-17 20:01:34,492 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 66 transitions. [2025-03-17 20:01:34,492 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-17 20:01:34,492 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:01:34,492 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:01:34,492 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1] [2025-03-17 20:01:34,492 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:01:34,493 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" [2025-03-17 20:01:34,493 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem6#1 > 0;havoc test_fun_#t~mem6#1;call test_fun_#t~mem7#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post8#1 := test_fun_#t~mem7#1;call write~int#0(test_fun_#t~post8#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem7#1;havoc test_fun_#t~post8#1;test_fun_#t~post9#1 := test_fun_~pos~0#1;test_fun_~pos~0#1 := 1 + test_fun_#t~post9#1;havoc test_fun_#t~post9#1;" [2025-03-17 20:01:34,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:34,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1073531177, now seen corresponding path program 10 times [2025-03-17 20:01:34,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:34,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92462552] [2025-03-17 20:01:34,493 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 20:01:34,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:34,497 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-03-17 20:01:34,504 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 20:01:34,504 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 20:01:34,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:34,504 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:34,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 20:01:34,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 20:01:34,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:34,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:34,512 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:34,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:34,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1152, now seen corresponding path program 4 times [2025-03-17 20:01:34,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:34,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168704690] [2025-03-17 20:01:34,512 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 20:01:34,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:34,516 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-03-17 20:01:34,517 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:34,517 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 20:01:34,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:34,517 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:34,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:34,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:34,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:34,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:34,519 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:34,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:34,520 INFO L85 PathProgramCache]: Analyzing trace with hash 871310248, now seen corresponding path program 3 times [2025-03-17 20:01:34,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:34,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151336354] [2025-03-17 20:01:34,520 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:01:34,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:34,526 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 4 equivalence classes. [2025-03-17 20:01:34,545 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 20:01:34,549 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-17 20:01:34,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:34,550 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:34,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 20:01:34,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 20:01:34,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:34,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:34,560 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:35,548 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:01:35,549 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:01:35,549 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:01:35,549 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:01:35,549 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:01:35,549 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:35,549 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:01:35,549 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:01:35,549 INFO L132 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration15_Lasso [2025-03-17 20:01:35,549 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:01:35,549 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:01:35,550 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:35,552 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:35,553 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:35,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:35,555 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:35,556 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:35,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:35,558 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:35,561 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:35,562 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:35,563 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:35,564 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:35,565 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:35,566 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:35,567 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:35,569 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:35,570 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:35,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:35,572 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:35,573 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:35,574 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:35,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:35,814 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:35,816 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:36,024 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:01:36,024 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:01:36,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:36,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:36,026 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-17 20:01:36,026 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-17 20:01:36,028 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-17 20:01:36,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:36,037 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:36,037 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:36,037 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:36,038 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:36,038 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:36,040 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:36,046 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-17 20:01:36,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:36,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:36,048 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-17 20:01:36,048 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-17 20:01:36,049 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-17 20:01:36,058 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:36,059 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:36,059 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:36,059 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:36,059 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:36,059 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:36,059 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:36,060 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:36,065 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-17 20:01:36,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:36,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:36,067 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-17 20:01:36,068 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-17 20:01:36,069 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-17 20:01:36,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:36,078 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:36,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:36,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:36,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:36,079 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:36,079 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:36,079 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:36,085 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-17 20:01:36,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:36,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:36,087 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-17 20:01:36,087 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-17 20:01:36,088 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-17 20:01:36,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:36,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:36,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:36,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:36,098 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:36,099 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:36,101 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:36,106 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-17 20:01:36,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:36,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:36,108 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-17 20:01:36,108 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-17 20:01:36,109 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-17 20:01:36,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:36,119 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:36,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:36,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:36,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:36,119 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:36,119 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:36,120 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:36,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:36,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:36,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:36,127 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-17 20:01:36,127 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-17 20:01:36,128 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-17 20:01:36,138 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:36,138 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:36,138 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:36,138 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:36,138 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:36,138 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:36,138 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:36,139 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:36,144 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-17 20:01:36,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:36,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:36,146 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-17 20:01:36,146 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-17 20:01:36,147 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-17 20:01:36,156 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:36,157 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:36,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:36,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:36,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:36,157 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:36,157 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:36,158 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:36,163 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-17 20:01:36,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:36,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:36,164 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-17 20:01:36,165 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-17 20:01:36,166 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-17 20:01:36,175 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:36,175 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:36,175 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:36,175 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:36,176 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:36,176 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:36,178 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:36,183 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-17 20:01:36,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:36,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:36,185 INFO L229 MonitoredProcess]: Starting monitored process 149 with /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-17 20:01:36,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Waiting until timeout for monitored process [2025-03-17 20:01:36,186 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-17 20:01:36,195 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:36,195 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:36,196 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:36,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:36,196 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:36,196 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:36,196 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:36,197 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:36,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Ended with exit code 0 [2025-03-17 20:01:36,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:36,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:36,203 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-17 20:01:36,204 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-17 20:01:36,205 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-17 20:01:36,214 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:36,214 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:36,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:36,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:36,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:36,214 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:36,214 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:36,215 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:36,220 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-17 20:01:36,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:36,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:36,222 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-17 20:01:36,222 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-17 20:01:36,223 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-17 20:01:36,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:36,232 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:36,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:36,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:36,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:36,233 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:36,233 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:36,234 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:36,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:36,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:36,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:36,240 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-17 20:01:36,241 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-17 20:01:36,242 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-17 20:01:36,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:36,251 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:36,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:36,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:36,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:36,252 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:36,252 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:36,253 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:36,257 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-17 20:01:36,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:36,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:36,259 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-17 20:01:36,260 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-17 20:01:36,261 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-17 20:01:36,270 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:36,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:36,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:36,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:36,271 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:36,271 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:36,273 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:36,278 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-17 20:01:36,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:36,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:36,279 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-17 20:01:36,280 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-17 20:01:36,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-17 20:01:36,290 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:36,290 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:36,290 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:36,290 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:36,290 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:36,290 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:36,290 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:36,291 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:36,296 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-17 20:01:36,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:36,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:36,297 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-17 20:01:36,298 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-17 20:01:36,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-17 20:01:36,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:36,308 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:36,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:36,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:36,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:36,309 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:36,309 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:36,310 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:36,315 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-17 20:01:36,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:36,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:36,316 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-17 20:01:36,317 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-17 20:01:36,318 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-17 20:01:36,327 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:36,327 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:36,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:36,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:36,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:36,328 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:36,328 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:36,329 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:36,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Ended with exit code 0 [2025-03-17 20:01:36,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:36,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:36,335 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-17 20:01:36,335 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-17 20:01:36,336 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-17 20:01:36,345 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:36,346 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:36,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:36,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:36,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:36,346 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:36,346 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:36,347 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:36,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:36,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:36,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:36,354 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-17 20:01:36,354 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-17 20:01:36,355 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-17 20:01:36,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:36,364 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:36,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:36,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:36,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:36,364 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:36,364 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:36,365 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:36,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Ended with exit code 0 [2025-03-17 20:01:36,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:36,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:36,372 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-17 20:01:36,372 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-17 20:01:36,373 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-17 20:01:36,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:36,383 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:36,383 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:36,383 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:36,383 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:36,383 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:36,383 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:36,384 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:36,389 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-17 20:01:36,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:36,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:36,390 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-17 20:01:36,391 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-17 20:01:36,392 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-17 20:01:36,401 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:36,401 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:36,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:36,401 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:36,401 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:36,402 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:36,402 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:36,403 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:36,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Ended with exit code 0 [2025-03-17 20:01:36,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:36,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:36,409 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-17 20:01:36,410 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-17 20:01:36,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-17 20:01:36,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:36,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:36,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:36,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:36,421 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:36,421 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:36,423 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:36,428 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-17 20:01:36,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:36,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:36,430 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-17 20:01:36,430 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-17 20:01:36,431 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-17 20:01:36,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:36,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:36,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:36,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:36,443 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:36,443 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:36,449 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:36,455 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-17 20:01:36,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:36,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:36,457 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-17 20:01:36,459 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-17 20:01:36,460 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-17 20:01:36,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:36,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:36,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:36,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:36,472 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:36,472 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:36,475 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:36,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:36,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:36,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:36,483 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-17 20:01:36,484 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-17 20:01:36,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-17 20:01:36,494 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:36,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:36,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:36,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:36,496 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:36,496 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:36,499 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:36,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:36,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:36,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:36,507 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-17 20:01:36,508 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-17 20:01:36,509 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-17 20:01:36,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:36,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:36,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:36,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:36,522 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:36,522 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:36,528 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:01:36,538 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-03-17 20:01:36,539 INFO L444 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-03-17 20:01:36,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:36,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:36,541 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-17 20:01:36,559 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-17 20:01:36,559 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:01:36,570 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 20:01:36,571 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:01:36,571 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~a#1.base) (* ULTIMATE.start_test_fun_~i~0#1 4))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~a#1.base) (* ULTIMATE.start_test_fun_~i~0#1 4))_1 Supporting invariants [] [2025-03-17 20:01:36,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:36,612 INFO L156 tatePredicateManager]: 18 out of 19 supporting invariants were superfluous and have been removed [2025-03-17 20:01:36,614 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-17 20:01:36,614 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-17 20:01:36,614 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~a!base,]]] [2025-03-17 20:01:36,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:36,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 20:01:36,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 20:01:36,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:36,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:36,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 20:01:36,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:36,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:36,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:36,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:36,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:36,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 20:01:36,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:36,723 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-17 20:01:36,723 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-17 20:01:36,723 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 66 transitions. cyclomatic complexity: 28 Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-17 20:01:36,765 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 66 transitions. cyclomatic complexity: 28. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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 54 states and 71 transitions. Complement of second has 10 states. [2025-03-17 20:01:36,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-17 20:01:36,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-17 20:01:36,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 14 transitions. [2025-03-17 20:01:36,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 14 transitions. Stem has 29 letters. Loop has 2 letters. [2025-03-17 20:01:36,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:36,766 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 20:01:36,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:36,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 20:01:36,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 20:01:36,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:36,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:36,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 20:01:36,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:36,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:36,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:36,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:36,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:36,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 20:01:36,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:36,884 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-17 20:01:36,884 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-17 20:01:36,884 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 66 transitions. cyclomatic complexity: 28 Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-17 20:01:36,933 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 66 transitions. cyclomatic complexity: 28. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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 54 states and 71 transitions. Complement of second has 10 states. [2025-03-17 20:01:36,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-17 20:01:36,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-17 20:01:36,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 14 transitions. [2025-03-17 20:01:36,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 14 transitions. Stem has 29 letters. Loop has 2 letters. [2025-03-17 20:01:36,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:36,937 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 20:01:36,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:36,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 20:01:36,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 20:01:36,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:36,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:36,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 20:01:36,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:37,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:37,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:37,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:37,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:37,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 20:01:37,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:37,044 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-17 20:01:37,044 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-17 20:01:37,044 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 66 transitions. cyclomatic complexity: 28 Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:01:37,077 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 66 transitions. cyclomatic complexity: 28. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 63 states and 80 transitions. Complement of second has 8 states. [2025-03-17 20:01:37,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-17 20:01:37,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:01:37,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2025-03-17 20:01:37,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 29 letters. Loop has 2 letters. [2025-03-17 20:01:37,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:37,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 31 letters. Loop has 2 letters. [2025-03-17 20:01:37,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:37,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 29 letters. Loop has 4 letters. [2025-03-17 20:01:37,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:37,079 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 80 transitions. [2025-03-17 20:01:37,080 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:01:37,080 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 45 states and 57 transitions. [2025-03-17 20:01:37,080 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-03-17 20:01:37,081 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-03-17 20:01:37,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 57 transitions. [2025-03-17 20:01:37,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:01:37,081 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 57 transitions. [2025-03-17 20:01:37,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 57 transitions. [2025-03-17 20:01:37,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-03-17 20:01:37,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 44 states have internal predecessors, (57), 0 states have call successors, (0), 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-17 20:01:37,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2025-03-17 20:01:37,083 INFO L240 hiAutomatonCegarLoop]: Abstraction has 45 states and 57 transitions. [2025-03-17 20:01:37,083 INFO L432 stractBuchiCegarLoop]: Abstraction has 45 states and 57 transitions. [2025-03-17 20:01:37,083 INFO L338 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2025-03-17 20:01:37,083 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 57 transitions. [2025-03-17 20:01:37,083 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:01:37,083 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:01:37,083 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:01:37,084 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2025-03-17 20:01:37,084 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:01:37,084 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-17 20:01:37,085 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-17 20:01:37,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:37,085 INFO L85 PathProgramCache]: Analyzing trace with hash -189475308, now seen corresponding path program 11 times [2025-03-17 20:01:37,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:37,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624666602] [2025-03-17 20:01:37,085 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 20:01:37,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:37,089 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 5 equivalence classes. [2025-03-17 20:01:37,097 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 20:01:37,097 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-17 20:01:37,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:37,203 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 40 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:01:37,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:01:37,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624666602] [2025-03-17 20:01:37,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624666602] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:01:37,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161120038] [2025-03-17 20:01:37,204 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 20:01:37,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:01:37,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:37,207 INFO L229 MonitoredProcess]: Starting monitored process 167 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:01:37,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (167)] Waiting until timeout for monitored process [2025-03-17 20:01:37,260 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 5 equivalence classes. [2025-03-17 20:01:37,277 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 20:01:37,277 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-17 20:01:37,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:37,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 20:01:37,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:37,365 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 40 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:01:37,365 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:01:37,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:37,439 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 40 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:01:37,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161120038] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:01:37,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:01:37,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 16 [2025-03-17 20:01:37,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818460877] [2025-03-17 20:01:37,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:01:37,439 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:01:37,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:37,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1344, now seen corresponding path program 8 times [2025-03-17 20:01:37,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:37,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831712664] [2025-03-17 20:01:37,439 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:01:37,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:37,442 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:37,443 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:37,443 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:01:37,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:37,443 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:37,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:37,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:37,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:37,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:37,445 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:37,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:01:37,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 20:01:37,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2025-03-17 20:01:37,475 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. cyclomatic complexity: 22 Second operand has 17 states, 16 states have (on average 3.6875) internal successors, (59), 17 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-17 20:01:37,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:01:37,548 INFO L93 Difference]: Finished difference Result 79 states and 99 transitions. [2025-03-17 20:01:37,548 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 99 transitions. [2025-03-17 20:01:37,548 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:01:37,548 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 46 states and 58 transitions. [2025-03-17 20:01:37,548 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-03-17 20:01:37,548 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-03-17 20:01:37,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 58 transitions. [2025-03-17 20:01:37,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:01:37,549 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 58 transitions. [2025-03-17 20:01:37,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 58 transitions. [2025-03-17 20:01:37,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-17 20:01:37,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 45 states have internal predecessors, (58), 0 states have call successors, (0), 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-17 20:01:37,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2025-03-17 20:01:37,550 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 58 transitions. [2025-03-17 20:01:37,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 20:01:37,555 INFO L432 stractBuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2025-03-17 20:01:37,555 INFO L338 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2025-03-17 20:01:37,555 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 58 transitions. [2025-03-17 20:01:37,555 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:01:37,555 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:01:37,555 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:01:37,555 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2025-03-17 20:01:37,555 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:01:37,555 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-17 20:01:37,555 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-17 20:01:37,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:37,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1103634466, now seen corresponding path program 12 times [2025-03-17 20:01:37,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:37,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090007430] [2025-03-17 20:01:37,559 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 20:01:37,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:37,563 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 34 statements into 5 equivalence classes. [2025-03-17 20:01:37,574 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 20:01:37,574 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-17 20:01:37,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:37,574 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:37,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 20:01:37,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 20:01:37,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:37,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:37,583 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:37,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:37,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1344, now seen corresponding path program 9 times [2025-03-17 20:01:37,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:37,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379937540] [2025-03-17 20:01:37,584 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:01:37,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:37,586 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:37,587 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:37,587 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 20:01:37,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:37,587 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:37,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:37,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:37,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:37,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:37,589 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:37,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:37,590 INFO L85 PathProgramCache]: Analyzing trace with hash -264199903, now seen corresponding path program 4 times [2025-03-17 20:01:37,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:37,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586172987] [2025-03-17 20:01:37,590 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 20:01:37,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:37,595 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-03-17 20:01:37,603 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 20:01:37,604 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 20:01:37,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:37,604 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:37,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 20:01:37,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 20:01:37,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:37,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:37,613 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:39,019 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:01:39,019 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:01:39,019 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:01:39,019 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:01:39,019 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:01:39,019 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:39,019 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:01:39,019 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:01:39,019 INFO L132 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration17_Lasso [2025-03-17 20:01:39,019 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:01:39,019 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:01:39,020 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:39,022 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:39,024 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:39,025 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:39,026 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:39,028 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:39,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:39,032 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:39,033 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:39,034 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:39,278 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:39,279 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:39,281 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:39,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:39,284 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:39,285 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:39,286 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:39,288 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:39,289 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:39,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:39,292 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:39,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:39,295 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:39,297 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:39,299 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:39,504 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:01:39,504 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:01:39,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:39,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:39,506 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-17 20:01:39,507 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-17 20:01:39,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-17 20:01:39,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:39,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:39,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:39,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:39,518 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:39,518 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:39,520 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:39,525 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-17 20:01:39,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:39,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:39,526 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-17 20:01:39,527 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-17 20:01:39,528 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-17 20:01:39,540 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:39,540 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:39,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:39,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:39,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:39,540 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:39,540 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:39,541 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:39,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:39,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:39,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:39,548 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-17 20:01:39,549 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-17 20:01:39,549 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-17 20:01:39,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:39,559 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:39,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:39,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:39,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:39,559 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:39,559 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:39,560 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:39,565 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-17 20:01:39,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:39,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:39,567 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-17 20:01:39,567 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-17 20:01:39,568 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-17 20:01:39,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:39,578 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:39,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:39,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:39,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:39,578 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:39,578 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:39,579 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:39,584 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-17 20:01:39,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:39,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:39,586 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-17 20:01:39,587 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-17 20:01:39,588 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-17 20:01:39,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:39,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:39,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:39,598 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:39,598 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:39,598 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:39,600 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:39,605 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-17 20:01:39,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:39,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:39,608 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-17 20:01:39,608 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-17 20:01:39,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-17 20:01:39,618 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:39,619 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:39,619 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:39,619 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:39,619 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:39,619 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:39,622 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:39,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Ended with exit code 0 [2025-03-17 20:01:39,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:39,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:39,629 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-17 20:01:39,630 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-17 20:01:39,631 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-17 20:01:39,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:39,640 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:39,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:39,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:39,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:39,640 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:39,641 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:39,641 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:39,646 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-17 20:01:39,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:39,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:39,648 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-17 20:01:39,649 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-17 20:01:39,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-17 20:01:39,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:39,659 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:39,659 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:39,659 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:39,659 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:39,660 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:39,660 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:39,660 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:39,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Ended with exit code 0 [2025-03-17 20:01:39,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:39,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:39,667 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-17 20:01:39,668 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-17 20:01:39,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-17 20:01:39,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:39,678 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:39,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:39,679 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:39,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:39,679 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:39,679 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:39,680 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:39,685 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-17 20:01:39,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:39,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:39,687 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-17 20:01:39,687 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-17 20:01:39,688 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-17 20:01:39,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:39,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:39,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:39,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:39,699 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:39,700 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:39,703 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:39,709 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-17 20:01:39,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:39,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:39,711 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-17 20:01:39,712 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-17 20:01:39,713 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-17 20:01:39,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:39,723 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:39,723 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:39,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:39,724 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:39,724 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:39,726 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:39,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:39,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:39,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:39,733 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-17 20:01:39,734 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-17 20:01:39,735 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-17 20:01:39,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:39,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:39,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:39,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:39,745 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:39,745 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:39,749 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:39,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Ended with exit code 0 [2025-03-17 20:01:39,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:39,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:39,756 INFO L229 MonitoredProcess]: Starting monitored process 180 with /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-17 20:01:39,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Waiting until timeout for monitored process [2025-03-17 20:01:39,757 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-17 20:01:39,767 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:39,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:39,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:39,767 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:39,769 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:39,769 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:39,772 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:39,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Ended with exit code 0 [2025-03-17 20:01:39,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:39,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:39,780 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-17 20:01:39,780 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-17 20:01:39,781 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-17 20:01:39,791 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:39,791 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:39,791 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:39,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:39,792 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:39,792 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:39,796 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:39,801 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-17 20:01:39,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:39,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:39,803 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-17 20:01:39,804 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-17 20:01:39,804 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-17 20:01:39,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:39,814 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:39,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:39,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:39,816 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:39,816 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:39,819 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:39,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Ended with exit code 0 [2025-03-17 20:01:39,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:39,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:39,826 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-17 20:01:39,827 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-17 20:01:39,828 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-17 20:01:39,837 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:39,837 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:39,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:39,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:39,839 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:39,839 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:39,843 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:01:39,848 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-03-17 20:01:39,848 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-03-17 20:01:39,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:39,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:39,850 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-17 20:01:39,851 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-17 20:01:39,851 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:01:39,861 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 20:01:39,861 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:01:39,861 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 16))_1) = -1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 16))_1 Supporting invariants [] [2025-03-17 20:01:39,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Ended with exit code 0 [2025-03-17 20:01:39,884 INFO L156 tatePredicateManager]: 11 out of 13 supporting invariants were superfluous and have been removed [2025-03-17 20:01:39,887 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-17 20:01:39,887 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-17 20:01:39,887 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc12!base,]]] [2025-03-17 20:01:39,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:39,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 20:01:39,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 20:01:39,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:39,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:39,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 20:01:39,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:40,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:40,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:40,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:40,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:40,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 20:01:40,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:40,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:40,082 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-17 20:01:40,082 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-17 20:01:40,082 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 22 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-17 20:01:40,102 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 22. 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 47 states and 60 transitions. Complement of second has 5 states. [2025-03-17 20:01:40,103 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-17 20:01:40,103 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-17 20:01:40,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-17 20:01:40,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 34 letters. Loop has 2 letters. [2025-03-17 20:01:40,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:40,103 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 20:01:40,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:40,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 20:01:40,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 20:01:40,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:40,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:40,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 20:01:40,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:40,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:40,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:40,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:40,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:40,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 20:01:40,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:40,267 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-17 20:01:40,267 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-17 20:01:40,267 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 22 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-17 20:01:40,289 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 22. 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 47 states and 60 transitions. Complement of second has 5 states. [2025-03-17 20:01:40,289 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-17 20:01:40,289 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-17 20:01:40,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-17 20:01:40,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 34 letters. Loop has 2 letters. [2025-03-17 20:01:40,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:40,290 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 20:01:40,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:40,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 20:01:40,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 20:01:40,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:40,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:40,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 20:01:40,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:40,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:40,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:40,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:40,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:40,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 20:01:40,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:40,472 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-17 20:01:40,472 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-17 20:01:40,472 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 22 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-17 20:01:40,592 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 22. 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 77 states and 99 transitions. Complement of second has 17 states. [2025-03-17 20:01:40,592 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-17 20:01:40,593 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-17 20:01:40,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 65 transitions. [2025-03-17 20:01:40,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 65 transitions. Stem has 34 letters. Loop has 2 letters. [2025-03-17 20:01:40,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:40,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 65 transitions. Stem has 36 letters. Loop has 2 letters. [2025-03-17 20:01:40,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:40,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 65 transitions. Stem has 34 letters. Loop has 4 letters. [2025-03-17 20:01:40,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:40,594 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 99 transitions. [2025-03-17 20:01:40,594 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:01:40,595 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 69 states and 89 transitions. [2025-03-17 20:01:40,595 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-17 20:01:40,595 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-17 20:01:40,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 89 transitions. [2025-03-17 20:01:40,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:01:40,595 INFO L218 hiAutomatonCegarLoop]: Abstraction has 69 states and 89 transitions. [2025-03-17 20:01:40,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 89 transitions. [2025-03-17 20:01:40,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 54. [2025-03-17 20:01:40,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 53 states have internal predecessors, (68), 0 states have call successors, (0), 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-17 20:01:40,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 68 transitions. [2025-03-17 20:01:40,597 INFO L240 hiAutomatonCegarLoop]: Abstraction has 54 states and 68 transitions. [2025-03-17 20:01:40,597 INFO L432 stractBuchiCegarLoop]: Abstraction has 54 states and 68 transitions. [2025-03-17 20:01:40,597 INFO L338 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2025-03-17 20:01:40,597 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 68 transitions. [2025-03-17 20:01:40,597 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:01:40,597 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:01:40,597 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:01:40,597 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2025-03-17 20:01:40,598 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:01:40,598 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-17 20:01:40,598 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-17 20:01:40,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:40,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1362240885, now seen corresponding path program 13 times [2025-03-17 20:01:40,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:40,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985089874] [2025-03-17 20:01:40,598 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 20:01:40,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:40,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 20:01:40,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 20:01:40,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:40,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:40,760 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 40 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:01:40,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:01:40,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985089874] [2025-03-17 20:01:40,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985089874] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:01:40,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201436548] [2025-03-17 20:01:40,760 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 20:01:40,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:01:40,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:40,762 INFO L229 MonitoredProcess]: Starting monitored process 185 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:01:40,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (185)] Waiting until timeout for monitored process [2025-03-17 20:01:40,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 20:01:40,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 20:01:40,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:40,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:40,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 20:01:40,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:40,950 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 65 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:01:40,951 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:01:41,042 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 65 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:01:41,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201436548] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:01:41,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:01:41,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 21 [2025-03-17 20:01:41,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687365971] [2025-03-17 20:01:41,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:01:41,043 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:01:41,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:41,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1344, now seen corresponding path program 10 times [2025-03-17 20:01:41,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:41,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729099697] [2025-03-17 20:01:41,043 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 20:01:41,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:41,048 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-03-17 20:01:41,049 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:41,049 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 20:01:41,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:41,049 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:41,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:41,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:41,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:41,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:41,051 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:41,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:01:41,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-17 20:01:41,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2025-03-17 20:01:41,078 INFO L87 Difference]: Start difference. First operand 54 states and 68 transitions. cyclomatic complexity: 26 Second operand has 22 states, 21 states have (on average 3.857142857142857) internal successors, (81), 22 states have internal predecessors, (81), 0 states have call successors, (0), 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-17 20:01:41,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:01:41,202 INFO L93 Difference]: Finished difference Result 96 states and 120 transitions. [2025-03-17 20:01:41,202 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 120 transitions. [2025-03-17 20:01:41,202 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:01:41,202 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 55 states and 69 transitions. [2025-03-17 20:01:41,202 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-03-17 20:01:41,202 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-03-17 20:01:41,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 69 transitions. [2025-03-17 20:01:41,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:01:41,203 INFO L218 hiAutomatonCegarLoop]: Abstraction has 55 states and 69 transitions. [2025-03-17 20:01:41,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 69 transitions. [2025-03-17 20:01:41,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-17 20:01:41,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 54 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-17 20:01:41,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2025-03-17 20:01:41,204 INFO L240 hiAutomatonCegarLoop]: Abstraction has 55 states and 69 transitions. [2025-03-17 20:01:41,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 20:01:41,205 INFO L432 stractBuchiCegarLoop]: Abstraction has 55 states and 69 transitions. [2025-03-17 20:01:41,205 INFO L338 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2025-03-17 20:01:41,205 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 69 transitions. [2025-03-17 20:01:41,205 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:01:41,205 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:01:41,205 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:01:41,206 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2025-03-17 20:01:41,206 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:01:41,206 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-17 20:01:41,206 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-17 20:01:41,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:41,206 INFO L85 PathProgramCache]: Analyzing trace with hash -610024259, now seen corresponding path program 14 times [2025-03-17 20:01:41,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:41,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109949451] [2025-03-17 20:01:41,206 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:01:41,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:41,212 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-03-17 20:01:41,219 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 20:01:41,219 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:01:41,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:41,219 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:41,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 20:01:41,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 20:01:41,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:41,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:41,229 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:41,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:41,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1344, now seen corresponding path program 11 times [2025-03-17 20:01:41,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:41,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665241219] [2025-03-17 20:01:41,229 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 20:01:41,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:41,231 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:41,232 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:41,232 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:01:41,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:41,232 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:41,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:41,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:41,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:41,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:41,234 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:41,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:41,235 INFO L85 PathProgramCache]: Analyzing trace with hash -2117760260, now seen corresponding path program 5 times [2025-03-17 20:01:41,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:41,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966738517] [2025-03-17 20:01:41,235 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 20:01:41,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:41,241 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 43 statements into 6 equivalence classes. [2025-03-17 20:01:41,250 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 20:01:41,250 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-17 20:01:41,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:41,250 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:41,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-17 20:01:41,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 20:01:41,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:41,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:41,260 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:43,625 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:01:43,625 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:01:43,625 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:01:43,625 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:01:43,625 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:01:43,625 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:43,625 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:01:43,625 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:01:43,625 INFO L132 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration19_Lasso [2025-03-17 20:01:43,625 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:01:43,625 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:01:43,626 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:43,628 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:43,630 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:43,631 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:43,633 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:43,634 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:43,636 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:44,093 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:44,095 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:44,096 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:44,098 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:44,099 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:44,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:44,102 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:44,103 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:44,105 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:44,106 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:44,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:44,109 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:44,112 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:44,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:44,114 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:44,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:44,117 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:44,323 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:01:44,323 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:01:44,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:44,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:44,326 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-17 20:01:44,326 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-17 20:01:44,328 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-17 20:01:44,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:44,337 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:44,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:44,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:44,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:44,337 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:44,337 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:44,338 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:44,344 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-17 20:01:44,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:44,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:44,346 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-17 20:01:44,346 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-17 20:01:44,347 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-17 20:01:44,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:44,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:44,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:44,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:44,357 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:44,357 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:44,359 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:44,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Ended with exit code 0 [2025-03-17 20:01:44,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:44,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:44,367 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-17 20:01:44,367 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-17 20:01:44,368 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-17 20:01:44,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:44,377 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:44,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:44,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:44,378 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:44,378 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:44,378 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:44,379 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:44,383 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-17 20:01:44,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:44,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:44,385 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-17 20:01:44,385 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-17 20:01:44,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-17 20:01:44,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:44,396 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:44,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:44,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:44,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:44,397 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:44,397 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:44,397 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:44,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:44,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:44,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:44,404 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-17 20:01:44,406 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-17 20:01:44,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-17 20:01:44,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:44,416 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:44,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:44,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:44,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:44,417 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:44,417 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:44,417 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:44,422 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-17 20:01:44,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:44,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:44,425 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-17 20:01:44,426 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-17 20:01:44,426 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-17 20:01:44,436 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:44,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:44,436 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:44,436 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:44,437 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:44,437 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:44,439 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:44,444 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-17 20:01:44,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:44,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:44,446 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-17 20:01:44,449 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-17 20:01:44,450 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:01:44,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:44,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:44,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:44,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:44,461 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:44,461 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:44,464 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:44,470 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-17 20:01:44,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:44,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:44,472 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-17 20:01:44,473 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-17 20:01:44,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-17 20:01:44,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:44,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:44,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:44,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:44,484 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:44,484 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:44,488 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:44,493 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-17 20:01:44,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:44,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:44,530 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-17 20:01:44,530 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-17 20:01:44,532 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:01:44,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:44,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:44,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:44,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:44,543 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:44,543 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:44,548 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:44,553 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-17 20:01:44,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:44,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:44,556 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-17 20:01:44,557 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-17 20:01:44,558 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-17 20:01:44,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:44,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:44,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:44,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:44,570 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:44,570 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:44,573 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:44,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:44,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:44,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:44,582 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-17 20:01:44,584 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-17 20:01:44,585 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-17 20:01:44,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:44,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:44,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:44,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:44,595 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:44,595 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:44,598 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:44,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:44,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:44,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:44,605 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-17 20:01:44,606 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-17 20:01:44,607 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-17 20:01:44,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:44,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:44,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:44,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:44,619 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:44,619 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:44,622 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:44,627 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-17 20:01:44,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:44,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:44,629 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-17 20:01:44,629 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-17 20:01:44,630 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-17 20:01:44,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:44,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:44,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:44,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:44,641 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:44,641 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:44,645 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:01:44,651 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-03-17 20:01:44,651 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-03-17 20:01:44,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:44,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:44,653 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-17 20:01:44,653 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-17 20:01:44,654 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:01:44,664 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 20:01:44,665 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:01:44,665 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 20))_1) = -1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 20))_1 Supporting invariants [] [2025-03-17 20:01:44,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Ended with exit code 0 [2025-03-17 20:01:44,699 INFO L156 tatePredicateManager]: 13 out of 15 supporting invariants were superfluous and have been removed [2025-03-17 20:01:44,702 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-17 20:01:44,702 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-17 20:01:44,702 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc12!base,]]] [2025-03-17 20:01:44,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:44,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 20:01:44,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 20:01:44,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:44,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:44,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 20:01:44,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:44,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:44,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:44,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:44,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:44,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 20:01:44,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:44,890 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-17 20:01:44,890 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-17 20:01:44,891 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 55 states and 69 transitions. cyclomatic complexity: 26 Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:01:44,917 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 55 states and 69 transitions. cyclomatic complexity: 26. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 56 states and 71 transitions. Complement of second has 5 states. [2025-03-17 20:01:44,917 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-17 20:01:44,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:01:44,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-17 20:01:44,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 41 letters. Loop has 2 letters. [2025-03-17 20:01:44,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:44,918 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 20:01:44,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:44,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 20:01:44,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 20:01:44,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:44,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:44,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 20:01:44,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:45,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:45,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:45,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:45,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:45,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:45,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 20:01:45,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:45,135 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-17 20:01:45,136 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-17 20:01:45,136 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 55 states and 69 transitions. cyclomatic complexity: 26 Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:01:45,162 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 55 states and 69 transitions. cyclomatic complexity: 26. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 56 states and 71 transitions. Complement of second has 5 states. [2025-03-17 20:01:45,162 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-17 20:01:45,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:01:45,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-17 20:01:45,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 41 letters. Loop has 2 letters. [2025-03-17 20:01:45,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:45,163 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 20:01:45,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:45,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 20:01:45,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 20:01:45,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:45,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:45,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 20:01:45,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:45,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:45,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:45,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:45,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:45,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 20:01:45,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:45,374 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-17 20:01:45,374 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-17 20:01:45,374 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 55 states and 69 transitions. cyclomatic complexity: 26 Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:01:45,522 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 55 states and 69 transitions. cyclomatic complexity: 26. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 87 states and 112 transitions. Complement of second has 19 states. [2025-03-17 20:01:45,522 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-17 20:01:45,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:01:45,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 74 transitions. [2025-03-17 20:01:45,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 74 transitions. Stem has 41 letters. Loop has 2 letters. [2025-03-17 20:01:45,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:45,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 74 transitions. Stem has 43 letters. Loop has 2 letters. [2025-03-17 20:01:45,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:45,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 74 transitions. Stem has 41 letters. Loop has 4 letters. [2025-03-17 20:01:45,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:45,523 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 112 transitions. [2025-03-17 20:01:45,524 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:01:45,524 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 79 states and 102 transitions. [2025-03-17 20:01:45,524 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-17 20:01:45,524 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-17 20:01:45,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 102 transitions. [2025-03-17 20:01:45,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:01:45,524 INFO L218 hiAutomatonCegarLoop]: Abstraction has 79 states and 102 transitions. [2025-03-17 20:01:45,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 102 transitions. [2025-03-17 20:01:45,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 63. [2025-03-17 20:01:45,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 63 states have (on average 1.253968253968254) internal successors, (79), 62 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-17 20:01:45,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 79 transitions. [2025-03-17 20:01:45,529 INFO L240 hiAutomatonCegarLoop]: Abstraction has 63 states and 79 transitions. [2025-03-17 20:01:45,529 INFO L432 stractBuchiCegarLoop]: Abstraction has 63 states and 79 transitions. [2025-03-17 20:01:45,529 INFO L338 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2025-03-17 20:01:45,529 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 79 transitions. [2025-03-17 20:01:45,529 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:01:45,529 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:01:45,529 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:01:45,530 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1] [2025-03-17 20:01:45,530 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:01:45,530 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-17 20:01:45,530 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-17 20:01:45,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:45,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1111204122, now seen corresponding path program 15 times [2025-03-17 20:01:45,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:45,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823447066] [2025-03-17 20:01:45,531 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:01:45,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:45,538 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 7 equivalence classes. [2025-03-17 20:01:45,560 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 20:01:45,560 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-17 20:01:45,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:45,756 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 65 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:01:45,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:01:45,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823447066] [2025-03-17 20:01:45,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823447066] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:01:45,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082440879] [2025-03-17 20:01:45,756 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:01:45,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:01:45,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:45,758 INFO L229 MonitoredProcess]: Starting monitored process 200 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:01:45,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (200)] Waiting until timeout for monitored process [2025-03-17 20:01:45,817 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 7 equivalence classes. [2025-03-17 20:01:45,844 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 20:01:45,844 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-17 20:01:45,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:45,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 20:01:45,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:45,986 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 96 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:01:45,986 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:01:46,081 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 96 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:01:46,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082440879] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:01:46,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:01:46,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 24 [2025-03-17 20:01:46,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048570205] [2025-03-17 20:01:46,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:01:46,082 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:01:46,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:46,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1344, now seen corresponding path program 12 times [2025-03-17 20:01:46,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:46,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146552219] [2025-03-17 20:01:46,082 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 20:01:46,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:46,087 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:46,088 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:46,088 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-17 20:01:46,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:46,088 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:46,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:46,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:46,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:46,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:46,090 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:46,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:01:46,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-17 20:01:46,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2025-03-17 20:01:46,125 INFO L87 Difference]: Start difference. First operand 63 states and 79 transitions. cyclomatic complexity: 30 Second operand has 25 states, 24 states have (on average 3.9166666666666665) internal successors, (94), 25 states have internal predecessors, (94), 0 states have call successors, (0), 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-17 20:01:46,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:01:46,286 INFO L93 Difference]: Finished difference Result 113 states and 141 transitions. [2025-03-17 20:01:46,286 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 113 states and 141 transitions. [2025-03-17 20:01:46,286 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:01:46,287 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 113 states to 64 states and 80 transitions. [2025-03-17 20:01:46,287 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-03-17 20:01:46,287 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-03-17 20:01:46,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 80 transitions. [2025-03-17 20:01:46,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:01:46,287 INFO L218 hiAutomatonCegarLoop]: Abstraction has 64 states and 80 transitions. [2025-03-17 20:01:46,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 80 transitions. [2025-03-17 20:01:46,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-03-17 20:01:46,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 1.25) internal successors, (80), 63 states have internal predecessors, (80), 0 states have call successors, (0), 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-17 20:01:46,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2025-03-17 20:01:46,289 INFO L240 hiAutomatonCegarLoop]: Abstraction has 64 states and 80 transitions. [2025-03-17 20:01:46,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 20:01:46,289 INFO L432 stractBuchiCegarLoop]: Abstraction has 64 states and 80 transitions. [2025-03-17 20:01:46,289 INFO L338 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2025-03-17 20:01:46,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 80 transitions. [2025-03-17 20:01:46,290 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:01:46,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:01:46,290 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:01:46,290 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1] [2025-03-17 20:01:46,290 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:01:46,290 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-17 20:01:46,290 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-17 20:01:46,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:46,290 INFO L85 PathProgramCache]: Analyzing trace with hash -2075264908, now seen corresponding path program 16 times [2025-03-17 20:01:46,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:46,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989652074] [2025-03-17 20:01:46,291 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 20:01:46,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:46,300 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 48 statements into 2 equivalence classes. [2025-03-17 20:01:46,321 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 20:01:46,321 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 20:01:46,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:46,321 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:46,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 20:01:46,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 20:01:46,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:46,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:46,350 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:46,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:46,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1344, now seen corresponding path program 13 times [2025-03-17 20:01:46,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:46,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172254338] [2025-03-17 20:01:46,350 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 20:01:46,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:46,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:46,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:46,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:46,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:46,357 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:46,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:46,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:46,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:46,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:46,359 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:46,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:46,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1464750861, now seen corresponding path program 6 times [2025-03-17 20:01:46,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:46,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721399146] [2025-03-17 20:01:46,359 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 20:01:46,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:46,372 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 50 statements into 7 equivalence classes. [2025-03-17 20:01:46,400 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 20:01:46,400 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-17 20:01:46,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:46,400 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:46,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 20:01:46,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 20:01:46,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:46,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:46,412 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:50,020 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:01:50,020 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:01:50,020 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:01:50,020 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:01:50,020 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:01:50,020 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:50,020 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:01:50,020 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:01:50,020 INFO L132 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration21_Lasso [2025-03-17 20:01:50,020 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:01:50,020 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:01:50,021 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:50,023 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:50,024 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:50,025 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:50,026 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:50,027 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:50,028 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:50,029 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:50,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:50,032 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:50,033 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:50,034 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:50,035 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:50,037 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:50,038 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:50,039 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:50,040 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:50,041 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:50,042 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:50,043 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:50,044 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:50,045 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:50,046 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:50,797 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:51,037 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:01:51,037 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:01:51,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:51,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:51,039 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-17 20:01:51,040 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-17 20:01:51,041 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-17 20:01:51,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:51,050 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:51,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:51,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:51,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:51,051 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:51,051 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:51,051 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:51,057 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-17 20:01:51,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:51,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:51,059 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-17 20:01:51,060 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-17 20:01:51,061 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-17 20:01:51,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:51,070 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:51,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:51,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:51,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:51,070 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:51,070 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:51,071 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:51,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Ended with exit code 0 [2025-03-17 20:01:51,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:51,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:51,081 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-17 20:01:51,081 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-17 20:01:51,082 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:01:51,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:51,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:51,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:51,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:51,092 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:51,092 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:51,095 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:51,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (203)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:51,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:51,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:51,103 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-17 20:01:51,104 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-17 20:01:51,104 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-17 20:01:51,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:51,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:51,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:51,114 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:51,115 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:51,115 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:51,117 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:51,122 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-17 20:01:51,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:51,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:51,124 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-17 20:01:51,125 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-17 20:01:51,126 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-17 20:01:51,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:51,135 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:51,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:51,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:51,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:51,136 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:51,136 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:51,138 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:51,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (205)] Ended with exit code 0 [2025-03-17 20:01:51,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:51,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:51,146 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-17 20:01:51,148 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-17 20:01:51,149 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-17 20:01:51,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:51,158 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:51,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:51,159 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:51,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:51,159 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:51,159 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:51,160 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:51,165 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-17 20:01:51,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:51,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:51,167 INFO L229 MonitoredProcess]: Starting monitored process 207 with /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-17 20:01:51,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (207)] Waiting until timeout for monitored process [2025-03-17 20:01:51,168 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-17 20:01:51,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:51,178 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:51,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:51,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:51,178 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:51,178 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:51,178 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:51,179 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:51,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (207)] Ended with exit code 0 [2025-03-17 20:01:51,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:51,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:51,186 INFO L229 MonitoredProcess]: Starting monitored process 208 with /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-17 20:01:51,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (208)] Waiting until timeout for monitored process [2025-03-17 20:01:51,188 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-17 20:01:51,197 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:51,197 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:51,197 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:51,197 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:51,197 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:51,197 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:51,197 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:51,198 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:51,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (208)] Ended with exit code 0 [2025-03-17 20:01:51,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:51,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:51,205 INFO L229 MonitoredProcess]: Starting monitored process 209 with /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-17 20:01:51,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (209)] Waiting until timeout for monitored process [2025-03-17 20:01:51,207 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-17 20:01:51,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:51,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:51,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:51,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:51,217 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:51,217 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:51,220 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:51,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (209)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:51,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:51,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:51,227 INFO L229 MonitoredProcess]: Starting monitored process 210 with /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-17 20:01:51,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (210)] Waiting until timeout for monitored process [2025-03-17 20:01:51,228 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-17 20:01:51,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:51,238 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:51,238 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:51,238 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:51,238 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:51,239 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:51,239 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:51,240 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:51,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (210)] Ended with exit code 0 [2025-03-17 20:01:51,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:51,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:51,246 INFO L229 MonitoredProcess]: Starting monitored process 211 with /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-17 20:01:51,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (211)] Waiting until timeout for monitored process [2025-03-17 20:01:51,248 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-17 20:01:51,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:51,257 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:51,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:51,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:51,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:51,258 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:51,258 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:51,259 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:51,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (211)] Ended with exit code 0 [2025-03-17 20:01:51,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:51,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:51,266 INFO L229 MonitoredProcess]: Starting monitored process 212 with /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-17 20:01:51,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (212)] Waiting until timeout for monitored process [2025-03-17 20:01:51,268 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-17 20:01:51,277 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:51,277 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:51,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:51,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:51,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:51,278 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:51,278 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:51,278 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:51,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (212)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:51,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:51,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:51,285 INFO L229 MonitoredProcess]: Starting monitored process 213 with /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-17 20:01:51,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (213)] Waiting until timeout for monitored process [2025-03-17 20:01:51,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-17 20:01:51,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:51,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:51,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:51,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:51,300 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:51,300 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:51,302 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:51,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (213)] Ended with exit code 0 [2025-03-17 20:01:51,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:51,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:51,309 INFO L229 MonitoredProcess]: Starting monitored process 214 with /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-17 20:01:51,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (214)] Waiting until timeout for monitored process [2025-03-17 20:01:51,311 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-17 20:01:51,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:51,320 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:51,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:51,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:51,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:51,320 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:51,321 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:51,324 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:51,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (214)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:51,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:51,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:51,331 INFO L229 MonitoredProcess]: Starting monitored process 215 with /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-17 20:01:51,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (215)] Waiting until timeout for monitored process [2025-03-17 20:01:51,333 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-17 20:01:51,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:51,342 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:51,342 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:51,342 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:51,342 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:51,342 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:51,342 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:51,343 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:51,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (215)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:51,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:51,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:51,350 INFO L229 MonitoredProcess]: Starting monitored process 216 with /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-17 20:01:51,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (216)] Waiting until timeout for monitored process [2025-03-17 20:01:51,351 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-17 20:01:51,361 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:51,361 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:51,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:51,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:51,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:51,361 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:51,361 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:51,362 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:51,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (216)] Ended with exit code 0 [2025-03-17 20:01:51,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:51,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:51,369 INFO L229 MonitoredProcess]: Starting monitored process 217 with /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-17 20:01:51,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (217)] Waiting until timeout for monitored process [2025-03-17 20:01:51,370 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-17 20:01:51,379 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:51,380 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:51,380 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:51,380 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:51,380 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:51,380 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:51,380 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:51,381 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:51,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (217)] Ended with exit code 0 [2025-03-17 20:01:51,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:51,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:51,388 INFO L229 MonitoredProcess]: Starting monitored process 218 with /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-17 20:01:51,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (218)] Waiting until timeout for monitored process [2025-03-17 20:01:51,389 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-17 20:01:51,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:51,399 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:51,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:51,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:51,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:51,399 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:51,399 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:51,400 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:51,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (218)] Ended with exit code 0 [2025-03-17 20:01:51,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:51,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:51,407 INFO L229 MonitoredProcess]: Starting monitored process 219 with /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-17 20:01:51,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (219)] Waiting until timeout for monitored process [2025-03-17 20:01:51,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-17 20:01:51,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:51,418 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:51,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:51,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:51,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:51,418 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:51,418 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:51,419 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:51,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (219)] Ended with exit code 0 [2025-03-17 20:01:51,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:51,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:51,426 INFO L229 MonitoredProcess]: Starting monitored process 220 with /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-17 20:01:51,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (220)] Waiting until timeout for monitored process [2025-03-17 20:01:51,427 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-17 20:01:51,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:51,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:51,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:51,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:51,437 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:51,438 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:51,439 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:51,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (220)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:51,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:51,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:51,446 INFO L229 MonitoredProcess]: Starting monitored process 221 with /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-17 20:01:51,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (221)] Waiting until timeout for monitored process [2025-03-17 20:01:51,448 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-17 20:01:51,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:51,457 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:51,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:51,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:51,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:51,458 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:51,458 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:51,459 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:51,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (221)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:51,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:51,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:51,466 INFO L229 MonitoredProcess]: Starting monitored process 222 with /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-17 20:01:51,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (222)] Waiting until timeout for monitored process [2025-03-17 20:01:51,467 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-17 20:01:51,477 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:51,477 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:51,477 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:51,477 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:51,477 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:51,477 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:51,477 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:51,478 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:51,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (222)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:51,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:51,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:51,485 INFO L229 MonitoredProcess]: Starting monitored process 223 with /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-17 20:01:51,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (223)] Waiting until timeout for monitored process [2025-03-17 20:01:51,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-17 20:01:51,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:51,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:51,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:51,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:51,510 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:51,510 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:51,514 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:51,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (223)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:51,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:51,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:51,522 INFO L229 MonitoredProcess]: Starting monitored process 224 with /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-17 20:01:51,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (224)] Waiting until timeout for monitored process [2025-03-17 20:01:51,523 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-17 20:01:51,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:51,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:51,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:51,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:51,534 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:51,534 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:51,538 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:51,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (224)] Ended with exit code 0 [2025-03-17 20:01:51,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:51,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:51,545 INFO L229 MonitoredProcess]: Starting monitored process 225 with /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-17 20:01:51,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (225)] Waiting until timeout for monitored process [2025-03-17 20:01:51,546 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-17 20:01:51,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:51,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:51,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:51,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:51,557 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:51,557 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:51,561 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:51,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (225)] Ended with exit code 0 [2025-03-17 20:01:51,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:51,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:51,569 INFO L229 MonitoredProcess]: Starting monitored process 226 with /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-17 20:01:51,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (226)] Waiting until timeout for monitored process [2025-03-17 20:01:51,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-17 20:01:51,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:51,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:51,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:51,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:51,582 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:51,582 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:51,585 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:51,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (226)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:51,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:51,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:51,592 INFO L229 MonitoredProcess]: Starting monitored process 227 with /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-17 20:01:51,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (227)] Waiting until timeout for monitored process [2025-03-17 20:01:51,593 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-17 20:01:51,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:51,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:51,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:51,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:51,604 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:51,604 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:51,608 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:51,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (227)] Ended with exit code 0 [2025-03-17 20:01:51,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:51,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:51,615 INFO L229 MonitoredProcess]: Starting monitored process 228 with /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-17 20:01:51,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (228)] Waiting until timeout for monitored process [2025-03-17 20:01:51,617 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-17 20:01:51,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:51,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:51,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:51,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:51,628 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:51,628 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:51,631 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:51,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (228)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:51,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:51,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:51,639 INFO L229 MonitoredProcess]: Starting monitored process 229 with /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-17 20:01:51,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (229)] Waiting until timeout for monitored process [2025-03-17 20:01:51,640 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-17 20:01:51,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:51,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:51,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:51,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:51,652 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:51,652 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:51,656 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:01:51,661 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-03-17 20:01:51,661 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-03-17 20:01:51,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:51,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:51,663 INFO L229 MonitoredProcess]: Starting monitored process 230 with /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-17 20:01:51,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (230)] Waiting until timeout for monitored process [2025-03-17 20:01:51,665 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:01:51,674 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 20:01:51,675 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:01:51,675 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 24))_1) = -1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 24))_1 Supporting invariants [] [2025-03-17 20:01:51,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (229)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:51,721 INFO L156 tatePredicateManager]: 15 out of 17 supporting invariants were superfluous and have been removed [2025-03-17 20:01:51,724 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-17 20:01:51,724 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-17 20:01:51,724 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc12!base,]]] [2025-03-17 20:01:51,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:51,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 20:01:51,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 20:01:51,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:51,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:51,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-17 20:01:51,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:51,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:51,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:51,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:51,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:51,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 20:01:51,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:51,963 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-17 20:01:51,964 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.9 stem predicates 2 loop predicates [2025-03-17 20:01:51,964 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 80 transitions. cyclomatic complexity: 30 Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 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-17 20:01:51,987 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 64 states and 80 transitions. cyclomatic complexity: 30. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 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 65 states and 82 transitions. Complement of second has 5 states. [2025-03-17 20:01:51,988 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-17 20:01:51,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 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-17 20:01:51,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-17 20:01:51,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 48 letters. Loop has 2 letters. [2025-03-17 20:01:51,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:51,988 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 20:01:52,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:52,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 20:01:52,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 20:01:52,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:52,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:52,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-17 20:01:52,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:52,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:52,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:52,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:52,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:52,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 20:01:52,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:52,217 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-17 20:01:52,217 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.9 stem predicates 2 loop predicates [2025-03-17 20:01:52,218 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 80 transitions. cyclomatic complexity: 30 Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 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-17 20:01:52,239 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 64 states and 80 transitions. cyclomatic complexity: 30. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 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 65 states and 82 transitions. Complement of second has 5 states. [2025-03-17 20:01:52,239 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-17 20:01:52,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 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-17 20:01:52,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-17 20:01:52,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 48 letters. Loop has 2 letters. [2025-03-17 20:01:52,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:52,240 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 20:01:52,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:52,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 20:01:52,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 20:01:52,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:52,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:52,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-17 20:01:52,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:52,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (230)] Ended with exit code 0 [2025-03-17 20:01:52,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:52,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:52,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:52,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:52,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 20:01:52,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:52,501 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-17 20:01:52,501 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.9 stem predicates 2 loop predicates [2025-03-17 20:01:52,502 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 80 transitions. cyclomatic complexity: 30 Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 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-17 20:01:52,699 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 64 states and 80 transitions. cyclomatic complexity: 30. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 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 97 states and 125 transitions. Complement of second has 21 states. [2025-03-17 20:01:52,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 9 stem states 2 non-accepting loop states 2 accepting loop states [2025-03-17 20:01:52,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 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-17 20:01:52,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 83 transitions. [2025-03-17 20:01:52,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 83 transitions. Stem has 48 letters. Loop has 2 letters. [2025-03-17 20:01:52,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:52,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 83 transitions. Stem has 50 letters. Loop has 2 letters. [2025-03-17 20:01:52,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:52,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 83 transitions. Stem has 48 letters. Loop has 4 letters. [2025-03-17 20:01:52,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:52,703 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 125 transitions. [2025-03-17 20:01:52,703 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:01:52,704 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 89 states and 115 transitions. [2025-03-17 20:01:52,704 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-17 20:01:52,704 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-17 20:01:52,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 115 transitions. [2025-03-17 20:01:52,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:01:52,704 INFO L218 hiAutomatonCegarLoop]: Abstraction has 89 states and 115 transitions. [2025-03-17 20:01:52,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 115 transitions. [2025-03-17 20:01:52,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 72. [2025-03-17 20:01:52,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 1.25) internal successors, (90), 71 states have internal predecessors, (90), 0 states have call successors, (0), 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-17 20:01:52,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 90 transitions. [2025-03-17 20:01:52,705 INFO L240 hiAutomatonCegarLoop]: Abstraction has 72 states and 90 transitions. [2025-03-17 20:01:52,705 INFO L432 stractBuchiCegarLoop]: Abstraction has 72 states and 90 transitions. [2025-03-17 20:01:52,705 INFO L338 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2025-03-17 20:01:52,705 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 90 transitions. [2025-03-17 20:01:52,706 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:01:52,706 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:01:52,706 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:01:52,706 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1] [2025-03-17 20:01:52,706 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:01:52,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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-17 20:01:52,707 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-17 20:01:52,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:52,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1834003805, now seen corresponding path program 17 times [2025-03-17 20:01:52,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:52,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295043202] [2025-03-17 20:01:52,707 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 20:01:52,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:52,714 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 8 equivalence classes. [2025-03-17 20:01:52,726 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 20:01:52,726 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-03-17 20:01:52,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:52,916 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 133 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:01:52,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:01:52,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295043202] [2025-03-17 20:01:52,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295043202] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:01:52,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639231908] [2025-03-17 20:01:52,917 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 20:01:52,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:01:52,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:52,919 INFO L229 MonitoredProcess]: Starting monitored process 231 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:01:52,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (231)] Waiting until timeout for monitored process [2025-03-17 20:01:52,992 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 8 equivalence classes. [2025-03-17 20:01:53,020 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 20:01:53,020 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-03-17 20:01:53,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:53,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 20:01:53,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:53,219 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 133 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:01:53,219 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:01:53,332 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 133 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:01:53,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639231908] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:01:53,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:01:53,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 25 [2025-03-17 20:01:53,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761603266] [2025-03-17 20:01:53,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:01:53,332 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:01:53,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:53,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1344, now seen corresponding path program 14 times [2025-03-17 20:01:53,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:53,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066269211] [2025-03-17 20:01:53,332 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:01:53,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:53,335 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:53,336 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:53,336 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:01:53,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:53,336 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:53,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:53,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:53,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:53,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:53,338 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:53,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:01:53,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-17 20:01:53,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2025-03-17 20:01:53,362 INFO L87 Difference]: Start difference. First operand 72 states and 90 transitions. cyclomatic complexity: 34 Second operand has 26 states, 25 states have (on average 3.92) internal successors, (98), 26 states have internal predecessors, (98), 0 states have call successors, (0), 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-17 20:01:53,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:01:53,506 INFO L93 Difference]: Finished difference Result 130 states and 162 transitions. [2025-03-17 20:01:53,506 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 162 transitions. [2025-03-17 20:01:53,506 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:01:53,507 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 73 states and 91 transitions. [2025-03-17 20:01:53,507 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-03-17 20:01:53,507 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-03-17 20:01:53,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 91 transitions. [2025-03-17 20:01:53,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:01:53,507 INFO L218 hiAutomatonCegarLoop]: Abstraction has 73 states and 91 transitions. [2025-03-17 20:01:53,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 91 transitions. [2025-03-17 20:01:53,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-03-17 20:01:53,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 73 states have (on average 1.2465753424657535) internal successors, (91), 72 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:01:53,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 91 transitions. [2025-03-17 20:01:53,509 INFO L240 hiAutomatonCegarLoop]: Abstraction has 73 states and 91 transitions. [2025-03-17 20:01:53,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 20:01:53,510 INFO L432 stractBuchiCegarLoop]: Abstraction has 73 states and 91 transitions. [2025-03-17 20:01:53,510 INFO L338 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2025-03-17 20:01:53,510 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 91 transitions. [2025-03-17 20:01:53,510 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:01:53,510 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:01:53,510 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:01:53,511 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1] [2025-03-17 20:01:53,511 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:01:53,511 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-17 20:01:53,511 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-17 20:01:53,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:53,512 INFO L85 PathProgramCache]: Analyzing trace with hash 492820495, now seen corresponding path program 18 times [2025-03-17 20:01:53,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:53,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662365884] [2025-03-17 20:01:53,512 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 20:01:53,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:53,518 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 55 statements into 8 equivalence classes. [2025-03-17 20:01:53,537 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 20:01:53,537 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-03-17 20:01:53,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:53,537 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:53,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 20:01:53,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 20:01:53,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:53,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:53,551 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:53,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:53,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1344, now seen corresponding path program 15 times [2025-03-17 20:01:53,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:53,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331048803] [2025-03-17 20:01:53,552 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:01:53,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:53,555 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:53,556 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:53,556 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 20:01:53,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:53,556 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:53,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:53,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:53,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:53,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:53,558 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:53,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:53,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1154093518, now seen corresponding path program 7 times [2025-03-17 20:01:53,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:53,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105851264] [2025-03-17 20:01:53,559 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 20:01:53,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:53,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 20:01:53,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 20:01:53,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:53,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:53,574 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:53,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 20:01:53,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 20:01:53,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:53,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:53,589 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:56,817 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:01:56,817 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:01:56,817 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:01:56,817 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:01:56,817 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:01:56,817 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:56,817 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:01:56,817 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:01:56,817 INFO L132 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration23_Lasso [2025-03-17 20:01:56,817 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:01:56,817 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:01:56,818 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:56,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:56,820 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:56,821 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:56,822 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:56,825 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:56,826 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:56,827 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:56,828 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:56,829 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:56,830 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:57,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:57,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:57,159 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:57,161 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:57,162 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:57,163 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:57,164 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:57,165 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:57,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:57,167 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:57,168 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:57,170 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:57,171 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:01:57,448 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:01:57,448 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:01:57,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:57,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:57,450 INFO L229 MonitoredProcess]: Starting monitored process 232 with /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-17 20:01:57,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (232)] Waiting until timeout for monitored process [2025-03-17 20:01:57,452 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-17 20:01:57,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:57,462 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:57,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:57,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:57,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:57,462 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:57,462 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:57,463 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:57,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (232)] Ended with exit code 0 [2025-03-17 20:01:57,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:57,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:57,470 INFO L229 MonitoredProcess]: Starting monitored process 233 with /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-17 20:01:57,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (233)] Waiting until timeout for monitored process [2025-03-17 20:01:57,472 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-17 20:01:57,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:57,482 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:57,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:57,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:57,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:57,482 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:57,482 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:57,483 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:57,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (233)] Ended with exit code 0 [2025-03-17 20:01:57,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:57,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:57,490 INFO L229 MonitoredProcess]: Starting monitored process 234 with /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-17 20:01:57,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (234)] Waiting until timeout for monitored process [2025-03-17 20:01:57,492 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-17 20:01:57,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:57,501 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:57,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:57,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:57,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:57,501 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:57,501 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:57,502 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:57,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (234)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:57,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:57,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:57,509 INFO L229 MonitoredProcess]: Starting monitored process 235 with /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-17 20:01:57,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (235)] Waiting until timeout for monitored process [2025-03-17 20:01:57,511 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-17 20:01:57,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:57,520 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:57,520 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:57,520 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:57,520 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:57,521 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:57,521 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:57,521 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:57,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (235)] Ended with exit code 0 [2025-03-17 20:01:57,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:57,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:57,529 INFO L229 MonitoredProcess]: Starting monitored process 236 with /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-17 20:01:57,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (236)] Waiting until timeout for monitored process [2025-03-17 20:01:57,530 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-17 20:01:57,540 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:57,540 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:57,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:57,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:57,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:57,541 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:57,541 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:57,542 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:57,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (236)] Ended with exit code 0 [2025-03-17 20:01:57,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:57,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:57,549 INFO L229 MonitoredProcess]: Starting monitored process 237 with /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-17 20:01:57,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (237)] Waiting until timeout for monitored process [2025-03-17 20:01:57,552 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-17 20:01:57,562 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:57,562 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:57,562 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:57,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:57,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:57,562 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:57,562 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:57,564 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:57,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (237)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:57,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:57,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:57,572 INFO L229 MonitoredProcess]: Starting monitored process 238 with /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-17 20:01:57,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (238)] Waiting until timeout for monitored process [2025-03-17 20:01:57,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-17 20:01:57,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:57,584 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:57,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:57,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:57,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:57,585 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:57,585 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:57,586 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:57,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (238)] Ended with exit code 0 [2025-03-17 20:01:57,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:57,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:57,592 INFO L229 MonitoredProcess]: Starting monitored process 239 with /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-17 20:01:57,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (239)] Waiting until timeout for monitored process [2025-03-17 20:01:57,594 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-17 20:01:57,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:57,604 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:57,604 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:57,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:57,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:57,604 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:57,604 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:57,605 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:57,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (239)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:57,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:57,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:57,612 INFO L229 MonitoredProcess]: Starting monitored process 240 with /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-17 20:01:57,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (240)] Waiting until timeout for monitored process [2025-03-17 20:01:57,613 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-17 20:01:57,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:57,623 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:57,623 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:57,623 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:57,623 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:57,623 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:57,623 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:57,624 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:57,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (240)] Ended with exit code 0 [2025-03-17 20:01:57,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:57,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:57,631 INFO L229 MonitoredProcess]: Starting monitored process 241 with /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-17 20:01:57,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (241)] Waiting until timeout for monitored process [2025-03-17 20:01:57,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-17 20:01:57,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:57,642 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:01:57,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:57,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:57,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:57,642 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:01:57,642 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:01:57,643 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:57,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (241)] Ended with exit code 0 [2025-03-17 20:01:57,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:57,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:57,650 INFO L229 MonitoredProcess]: Starting monitored process 242 with /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-17 20:01:57,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (242)] Waiting until timeout for monitored process [2025-03-17 20:01:57,652 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-17 20:01:57,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:57,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:57,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:57,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:57,663 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:57,663 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:57,666 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:57,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (242)] Ended with exit code 0 [2025-03-17 20:01:57,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:57,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:57,674 INFO L229 MonitoredProcess]: Starting monitored process 243 with /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-17 20:01:57,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (243)] Waiting until timeout for monitored process [2025-03-17 20:01:57,675 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-17 20:01:57,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:57,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:57,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:57,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:57,688 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:57,688 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:57,693 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:57,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (243)] Ended with exit code 0 [2025-03-17 20:01:57,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:57,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:57,701 INFO L229 MonitoredProcess]: Starting monitored process 244 with /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-17 20:01:57,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (244)] Waiting until timeout for monitored process [2025-03-17 20:01:57,704 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-17 20:01:57,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:57,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:57,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:57,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:57,715 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:57,715 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:57,719 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:01:57,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (244)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:57,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:57,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:57,726 INFO L229 MonitoredProcess]: Starting monitored process 245 with /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-17 20:01:57,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (245)] Waiting until timeout for monitored process [2025-03-17 20:01:57,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-17 20:01:57,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:01:57,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:01:57,736 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:01:57,736 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:01:57,738 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:01:57,738 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:01:57,742 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:01:57,747 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-03-17 20:01:57,747 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-03-17 20:01:57,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:57,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:57,749 INFO L229 MonitoredProcess]: Starting monitored process 246 with /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-17 20:01:57,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (246)] Waiting until timeout for monitored process [2025-03-17 20:01:57,750 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:01:57,760 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 20:01:57,760 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:01:57,760 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 28))_1) = -1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 28))_1 Supporting invariants [] [2025-03-17 20:01:57,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (245)] Ended with exit code 0 [2025-03-17 20:01:57,780 INFO L156 tatePredicateManager]: 10 out of 12 supporting invariants were superfluous and have been removed [2025-03-17 20:01:57,783 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-17 20:01:57,783 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-17 20:01:57,783 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc12!base,]]] [2025-03-17 20:01:57,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:57,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 20:01:57,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 20:01:57,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:57,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:57,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 20:01:57,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:58,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:58,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:58,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:58,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:58,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 20:01:58,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:58,035 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-17 20:01:58,035 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-17 20:01:58,036 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 73 states and 91 transitions. cyclomatic complexity: 34 Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 0 states have call successors, (0), 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-17 20:01:58,061 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 73 states and 91 transitions. cyclomatic complexity: 34. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 0 states have call successors, (0), 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 74 states and 93 transitions. Complement of second has 5 states. [2025-03-17 20:01:58,061 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-17 20:01:58,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 0 states have call successors, (0), 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-17 20:01:58,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-17 20:01:58,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 55 letters. Loop has 2 letters. [2025-03-17 20:01:58,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:58,062 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 20:01:58,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:58,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 20:01:58,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 20:01:58,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:58,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:58,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 20:01:58,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:58,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (246)] Forceful destruction successful, exit code 0 [2025-03-17 20:01:58,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:58,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:58,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:58,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:58,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 20:01:58,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:58,366 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-17 20:01:58,367 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-17 20:01:58,367 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 73 states and 91 transitions. cyclomatic complexity: 34 Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 0 states have call successors, (0), 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-17 20:01:58,389 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 73 states and 91 transitions. cyclomatic complexity: 34. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 0 states have call successors, (0), 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 74 states and 93 transitions. Complement of second has 5 states. [2025-03-17 20:01:58,390 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-17 20:01:58,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 0 states have call successors, (0), 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-17 20:01:58,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-17 20:01:58,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 55 letters. Loop has 2 letters. [2025-03-17 20:01:58,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:58,390 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 20:01:58,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:58,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 20:01:58,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 20:01:58,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:58,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:58,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 20:01:58,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:58,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:58,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:58,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:58,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:58,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 20:01:58,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:58,676 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-17 20:01:58,676 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-17 20:01:58,676 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 73 states and 91 transitions. cyclomatic complexity: 34 Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 0 states have call successors, (0), 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-17 20:01:58,897 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 73 states and 91 transitions. cyclomatic complexity: 34. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 107 states and 138 transitions. Complement of second has 23 states. [2025-03-17 20:01:58,897 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-17 20:01:58,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 0 states have call successors, (0), 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-17 20:01:58,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 92 transitions. [2025-03-17 20:01:58,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 92 transitions. Stem has 55 letters. Loop has 2 letters. [2025-03-17 20:01:58,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:58,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 92 transitions. Stem has 57 letters. Loop has 2 letters. [2025-03-17 20:01:58,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:58,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 92 transitions. Stem has 55 letters. Loop has 4 letters. [2025-03-17 20:01:58,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:01:58,898 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 138 transitions. [2025-03-17 20:01:58,898 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:01:58,899 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 99 states and 128 transitions. [2025-03-17 20:01:58,899 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-17 20:01:58,899 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-17 20:01:58,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 128 transitions. [2025-03-17 20:01:58,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:01:58,899 INFO L218 hiAutomatonCegarLoop]: Abstraction has 99 states and 128 transitions. [2025-03-17 20:01:58,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 128 transitions. [2025-03-17 20:01:58,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 81. [2025-03-17 20:01:58,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 81 states have (on average 1.2469135802469136) internal successors, (101), 80 states have internal predecessors, (101), 0 states have call successors, (0), 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-17 20:01:58,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 101 transitions. [2025-03-17 20:01:58,900 INFO L240 hiAutomatonCegarLoop]: Abstraction has 81 states and 101 transitions. [2025-03-17 20:01:58,900 INFO L432 stractBuchiCegarLoop]: Abstraction has 81 states and 101 transitions. [2025-03-17 20:01:58,900 INFO L338 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2025-03-17 20:01:58,900 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 81 states and 101 transitions. [2025-03-17 20:01:58,901 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:01:58,901 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:01:58,901 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:01:58,901 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1] [2025-03-17 20:01:58,901 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:01:58,901 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-17 20:01:58,901 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-17 20:01:58,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:58,902 INFO L85 PathProgramCache]: Analyzing trace with hash -895144776, now seen corresponding path program 19 times [2025-03-17 20:01:58,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:58,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427890524] [2025-03-17 20:01:58,902 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 20:01:58,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:58,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 20:01:58,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 20:01:58,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:58,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:59,182 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 133 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:01:59,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:01:59,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427890524] [2025-03-17 20:01:59,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427890524] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:01:59,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644839927] [2025-03-17 20:01:59,182 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 20:01:59,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:01:59,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:01:59,185 INFO L229 MonitoredProcess]: Starting monitored process 247 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:01:59,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (247)] Waiting until timeout for monitored process [2025-03-17 20:01:59,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 20:01:59,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 20:01:59,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:59,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:01:59,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-17 20:01:59,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:01:59,566 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 176 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:01:59,566 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:01:59,739 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 176 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:01:59,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644839927] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:01:59,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:01:59,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 30 [2025-03-17 20:01:59,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899900269] [2025-03-17 20:01:59,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:01:59,740 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:01:59,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:59,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1344, now seen corresponding path program 16 times [2025-03-17 20:01:59,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:59,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215988590] [2025-03-17 20:01:59,740 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 20:01:59,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:59,743 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-03-17 20:01:59,744 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:59,744 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 20:01:59,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:59,744 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:59,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:59,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:59,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:59,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:59,748 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:59,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:01:59,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-17 20:01:59,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=707, Unknown=0, NotChecked=0, Total=930 [2025-03-17 20:01:59,777 INFO L87 Difference]: Start difference. First operand 81 states and 101 transitions. cyclomatic complexity: 38 Second operand has 31 states, 30 states have (on average 4.0) internal successors, (120), 31 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:01:59,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:01:59,932 INFO L93 Difference]: Finished difference Result 147 states and 183 transitions. [2025-03-17 20:01:59,932 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 147 states and 183 transitions. [2025-03-17 20:01:59,932 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:01:59,933 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 147 states to 82 states and 102 transitions. [2025-03-17 20:01:59,933 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-03-17 20:01:59,933 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-03-17 20:01:59,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 102 transitions. [2025-03-17 20:01:59,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:01:59,933 INFO L218 hiAutomatonCegarLoop]: Abstraction has 82 states and 102 transitions. [2025-03-17 20:01:59,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 102 transitions. [2025-03-17 20:01:59,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-03-17 20:01:59,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 81 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:01:59,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 102 transitions. [2025-03-17 20:01:59,935 INFO L240 hiAutomatonCegarLoop]: Abstraction has 82 states and 102 transitions. [2025-03-17 20:01:59,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 20:01:59,935 INFO L432 stractBuchiCegarLoop]: Abstraction has 82 states and 102 transitions. [2025-03-17 20:01:59,935 INFO L338 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2025-03-17 20:01:59,936 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 102 transitions. [2025-03-17 20:01:59,936 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:01:59,936 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:01:59,936 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:01:59,936 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1] [2025-03-17 20:01:59,936 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:01:59,937 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-17 20:01:59,937 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-17 20:01:59,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:59,937 INFO L85 PathProgramCache]: Analyzing trace with hash -408685114, now seen corresponding path program 20 times [2025-03-17 20:01:59,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:59,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570331272] [2025-03-17 20:01:59,937 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:01:59,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:59,944 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 2 equivalence classes. [2025-03-17 20:01:59,953 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 20:01:59,954 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:01:59,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:59,954 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:59,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 20:01:59,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 20:01:59,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:59,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:59,967 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:59,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:59,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1344, now seen corresponding path program 17 times [2025-03-17 20:01:59,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:59,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029046823] [2025-03-17 20:01:59,967 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 20:01:59,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:59,970 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:59,970 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:59,970 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:01:59,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:59,971 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:59,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:01:59,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:01:59,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:01:59,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:59,973 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:59,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:01:59,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1904370235, now seen corresponding path program 8 times [2025-03-17 20:01:59,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:01:59,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116644149] [2025-03-17 20:01:59,973 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:01:59,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:01:59,980 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 64 statements into 2 equivalence classes. [2025-03-17 20:01:59,991 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 64 of 64 statements. [2025-03-17 20:01:59,992 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:01:59,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:01:59,992 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:01:59,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-17 20:02:00,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-17 20:02:00,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:00,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:00,008 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:04,152 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:02:04,152 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:02:04,152 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:02:04,152 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:02:04,152 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:02:04,152 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:04,152 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:02:04,152 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:02:04,152 INFO L132 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration25_Lasso [2025-03-17 20:02:04,152 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:02:04,152 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:02:04,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:04,154 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:04,155 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:04,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:04,157 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:04,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:04,159 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:04,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:04,161 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:04,162 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:04,163 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:04,164 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:04,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:04,167 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:04,168 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:04,169 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:04,171 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:04,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:04,173 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:04,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:04,556 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:04,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:04,558 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:04,559 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:04,855 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:02:04,855 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:02:04,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:04,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:04,857 INFO L229 MonitoredProcess]: Starting monitored process 248 with /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-17 20:02:04,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (248)] Waiting until timeout for monitored process [2025-03-17 20:02:04,859 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-17 20:02:04,869 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:04,869 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:04,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:04,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:04,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:04,870 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:04,870 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:04,871 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:04,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (248)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:04,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:04,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:04,878 INFO L229 MonitoredProcess]: Starting monitored process 249 with /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-17 20:02:04,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (249)] Waiting until timeout for monitored process [2025-03-17 20:02:04,880 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-17 20:02:04,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:04,889 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:04,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:04,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:04,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:04,890 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:04,890 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:04,891 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:04,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (249)] Ended with exit code 0 [2025-03-17 20:02:04,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:04,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:04,898 INFO L229 MonitoredProcess]: Starting monitored process 250 with /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-17 20:02:04,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (250)] Waiting until timeout for monitored process [2025-03-17 20:02:04,900 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-17 20:02:04,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:04,909 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:04,909 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:04,909 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:04,909 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:04,910 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:04,910 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:04,910 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:04,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (250)] Ended with exit code 0 [2025-03-17 20:02:04,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:04,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:04,918 INFO L229 MonitoredProcess]: Starting monitored process 251 with /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-17 20:02:04,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (251)] Waiting until timeout for monitored process [2025-03-17 20:02:04,920 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-17 20:02:04,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:04,929 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:04,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:04,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:04,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:04,930 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:04,930 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:04,930 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:04,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (251)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:04,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:04,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:04,938 INFO L229 MonitoredProcess]: Starting monitored process 252 with /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-17 20:02:04,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (252)] Waiting until timeout for monitored process [2025-03-17 20:02:04,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-17 20:02:04,950 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:04,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:04,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:04,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:04,950 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:04,950 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:04,952 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:04,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (252)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:04,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:04,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:04,959 INFO L229 MonitoredProcess]: Starting monitored process 253 with /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-17 20:02:04,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (253)] Waiting until timeout for monitored process [2025-03-17 20:02:04,961 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-17 20:02:04,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:04,970 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:04,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:04,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:04,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:04,970 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:04,970 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:04,971 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:04,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (253)] Ended with exit code 0 [2025-03-17 20:02:04,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:04,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:04,979 INFO L229 MonitoredProcess]: Starting monitored process 254 with /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-17 20:02:04,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (254)] Waiting until timeout for monitored process [2025-03-17 20:02:04,980 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-17 20:02:04,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:04,990 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:04,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:04,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:04,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:04,990 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:04,990 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:04,991 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:04,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (254)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:04,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:04,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:04,999 INFO L229 MonitoredProcess]: Starting monitored process 255 with /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-17 20:02:05,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (255)] Waiting until timeout for monitored process [2025-03-17 20:02:05,000 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-17 20:02:05,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:05,010 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:05,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:05,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:05,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:05,010 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:05,010 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:05,011 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:05,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (255)] Ended with exit code 0 [2025-03-17 20:02:05,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:05,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:05,018 INFO L229 MonitoredProcess]: Starting monitored process 256 with /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-17 20:02:05,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (256)] Waiting until timeout for monitored process [2025-03-17 20:02:05,021 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-17 20:02:05,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:05,031 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:05,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:05,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:05,031 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:05,031 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:05,031 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:05,032 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:05,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (256)] Ended with exit code 0 [2025-03-17 20:02:05,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:05,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:05,039 INFO L229 MonitoredProcess]: Starting monitored process 257 with /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-17 20:02:05,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (257)] Waiting until timeout for monitored process [2025-03-17 20:02:05,041 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-17 20:02:05,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:05,050 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:05,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:05,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:05,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:05,051 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:05,051 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:05,051 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:05,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (257)] Ended with exit code 0 [2025-03-17 20:02:05,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:05,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:05,059 INFO L229 MonitoredProcess]: Starting monitored process 258 with /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-17 20:02:05,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (258)] Waiting until timeout for monitored process [2025-03-17 20:02:05,060 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-17 20:02:05,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:05,070 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:05,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:05,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:05,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:05,070 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:05,070 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:05,071 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:05,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (258)] Ended with exit code 0 [2025-03-17 20:02:05,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:05,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:05,078 INFO L229 MonitoredProcess]: Starting monitored process 259 with /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-17 20:02:05,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (259)] Waiting until timeout for monitored process [2025-03-17 20:02:05,079 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-17 20:02:05,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:05,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:05,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:05,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:05,089 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:05,089 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:05,091 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:05,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (259)] Ended with exit code 0 [2025-03-17 20:02:05,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:05,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:05,098 INFO L229 MonitoredProcess]: Starting monitored process 260 with /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-17 20:02:05,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (260)] Waiting until timeout for monitored process [2025-03-17 20:02:05,099 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-17 20:02:05,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:05,109 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:05,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:05,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:05,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:05,109 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:05,109 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:05,110 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:05,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (260)] Ended with exit code 0 [2025-03-17 20:02:05,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:05,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:05,117 INFO L229 MonitoredProcess]: Starting monitored process 261 with /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-17 20:02:05,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (261)] Waiting until timeout for monitored process [2025-03-17 20:02:05,118 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-17 20:02:05,127 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:05,128 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:05,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:05,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:05,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:05,128 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:05,128 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:05,129 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:05,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (261)] Ended with exit code 0 [2025-03-17 20:02:05,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:05,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:05,136 INFO L229 MonitoredProcess]: Starting monitored process 262 with /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-17 20:02:05,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (262)] Waiting until timeout for monitored process [2025-03-17 20:02:05,137 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-17 20:02:05,146 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:05,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:05,146 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:05,146 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:05,147 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:05,147 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:05,149 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:05,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (262)] Ended with exit code 0 [2025-03-17 20:02:05,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:05,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:05,156 INFO L229 MonitoredProcess]: Starting monitored process 263 with /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-17 20:02:05,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (263)] Waiting until timeout for monitored process [2025-03-17 20:02:05,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-17 20:02:05,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:05,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:05,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:05,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:05,167 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:05,167 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:05,170 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:05,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (263)] Ended with exit code 0 [2025-03-17 20:02:05,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:05,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:05,177 INFO L229 MonitoredProcess]: Starting monitored process 264 with /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-17 20:02:05,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (264)] Waiting until timeout for monitored process [2025-03-17 20:02:05,179 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-17 20:02:05,188 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:05,188 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:05,188 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:05,188 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:05,188 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:05,188 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:05,188 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:05,189 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:05,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (264)] Ended with exit code 0 [2025-03-17 20:02:05,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:05,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:05,196 INFO L229 MonitoredProcess]: Starting monitored process 265 with /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-17 20:02:05,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (265)] Waiting until timeout for monitored process [2025-03-17 20:02:05,197 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-17 20:02:05,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:05,208 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:05,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:05,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:05,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:05,208 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:05,208 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:05,209 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:05,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (265)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:05,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:05,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:05,217 INFO L229 MonitoredProcess]: Starting monitored process 266 with /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-17 20:02:05,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (266)] Waiting until timeout for monitored process [2025-03-17 20:02:05,218 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-17 20:02:05,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:05,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:05,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:05,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:05,229 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:05,229 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:05,232 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:05,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (266)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:05,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:05,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:05,239 INFO L229 MonitoredProcess]: Starting monitored process 267 with /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-17 20:02:05,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (267)] Waiting until timeout for monitored process [2025-03-17 20:02:05,241 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-17 20:02:05,250 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:05,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:05,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:05,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:05,252 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:05,252 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:05,255 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:05,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (267)] Ended with exit code 0 [2025-03-17 20:02:05,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:05,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:05,262 INFO L229 MonitoredProcess]: Starting monitored process 268 with /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-17 20:02:05,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (268)] Waiting until timeout for monitored process [2025-03-17 20:02:05,263 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-17 20:02:05,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:05,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:05,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:05,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:05,274 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:05,274 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:05,277 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:05,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (268)] Ended with exit code 0 [2025-03-17 20:02:05,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:05,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:05,284 INFO L229 MonitoredProcess]: Starting monitored process 269 with /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-17 20:02:05,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (269)] Waiting until timeout for monitored process [2025-03-17 20:02:05,286 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-17 20:02:05,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:05,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:05,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:05,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:05,297 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:05,297 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:05,300 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:05,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (269)] Ended with exit code 0 [2025-03-17 20:02:05,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:05,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:05,308 INFO L229 MonitoredProcess]: Starting monitored process 270 with /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-17 20:02:05,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (270)] Waiting until timeout for monitored process [2025-03-17 20:02:05,312 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-17 20:02:05,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:05,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:05,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:05,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:05,324 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:05,324 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:05,327 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:05,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (270)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:05,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:05,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:05,334 INFO L229 MonitoredProcess]: Starting monitored process 271 with /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-17 20:02:05,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (271)] Waiting until timeout for monitored process [2025-03-17 20:02:05,336 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-17 20:02:05,345 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:05,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:05,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:05,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:05,347 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:05,347 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:05,351 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:05,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (271)] Ended with exit code 0 [2025-03-17 20:02:05,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:05,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:05,358 INFO L229 MonitoredProcess]: Starting monitored process 272 with /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-17 20:02:05,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (272)] Waiting until timeout for monitored process [2025-03-17 20:02:05,359 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-17 20:02:05,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:05,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:05,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:05,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:05,371 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:05,371 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:05,375 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:02:05,380 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-03-17 20:02:05,380 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-03-17 20:02:05,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:05,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:05,382 INFO L229 MonitoredProcess]: Starting monitored process 273 with /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-17 20:02:05,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (273)] Waiting until timeout for monitored process [2025-03-17 20:02:05,383 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:02:05,394 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 20:02:05,394 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:02:05,394 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) (+ 32 ULTIMATE.start_test_fun_~a#1.offset))_1) = -1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) (+ 32 ULTIMATE.start_test_fun_~a#1.offset))_1 Supporting invariants [] [2025-03-17 20:02:05,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (272)] Ended with exit code 0 [2025-03-17 20:02:05,430 INFO L156 tatePredicateManager]: 11 out of 13 supporting invariants were superfluous and have been removed [2025-03-17 20:02:05,433 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-17 20:02:05,433 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-17 20:02:05,433 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc12!base,]]] [2025-03-17 20:02:05,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:05,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 20:02:05,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 20:02:05,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:05,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:05,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 20:02:05,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:05,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:02:05,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:02:05,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:05,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:05,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 20:02:05,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:05,768 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-17 20:02:05,769 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-17 20:02:05,769 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 82 states and 102 transitions. cyclomatic complexity: 38 Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 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-17 20:02:05,794 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 82 states and 102 transitions. cyclomatic complexity: 38. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 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 83 states and 104 transitions. Complement of second has 5 states. [2025-03-17 20:02:05,795 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-17 20:02:05,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 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-17 20:02:05,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-17 20:02:05,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 62 letters. Loop has 2 letters. [2025-03-17 20:02:05,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:05,795 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 20:02:05,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:05,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 20:02:05,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 20:02:05,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:05,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:05,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 20:02:05,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:05,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (273)] Ended with exit code 0 [2025-03-17 20:02:06,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:02:06,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:02:06,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:06,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:06,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 20:02:06,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:06,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-17 20:02:06,101 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-17 20:02:06,101 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 82 states and 102 transitions. cyclomatic complexity: 38 Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 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-17 20:02:06,128 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 82 states and 102 transitions. cyclomatic complexity: 38. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 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 83 states and 104 transitions. Complement of second has 5 states. [2025-03-17 20:02:06,128 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-17 20:02:06,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 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-17 20:02:06,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-17 20:02:06,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 62 letters. Loop has 2 letters. [2025-03-17 20:02:06,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:06,129 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 20:02:06,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:06,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 20:02:06,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 20:02:06,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:06,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:06,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 20:02:06,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:06,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:02:06,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:02:06,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:06,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:06,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 20:02:06,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:06,476 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-17 20:02:06,477 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-17 20:02:06,477 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 82 states and 102 transitions. cyclomatic complexity: 38 Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 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-17 20:02:06,716 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 82 states and 102 transitions. cyclomatic complexity: 38. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 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 117 states and 151 transitions. Complement of second has 25 states. [2025-03-17 20:02:06,716 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-17 20:02:06,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 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-17 20:02:06,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 101 transitions. [2025-03-17 20:02:06,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 101 transitions. Stem has 62 letters. Loop has 2 letters. [2025-03-17 20:02:06,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:06,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 101 transitions. Stem has 64 letters. Loop has 2 letters. [2025-03-17 20:02:06,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:06,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 101 transitions. Stem has 62 letters. Loop has 4 letters. [2025-03-17 20:02:06,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:06,717 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 151 transitions. [2025-03-17 20:02:06,718 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:02:06,718 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 109 states and 141 transitions. [2025-03-17 20:02:06,718 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-17 20:02:06,718 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-17 20:02:06,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 109 states and 141 transitions. [2025-03-17 20:02:06,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:02:06,718 INFO L218 hiAutomatonCegarLoop]: Abstraction has 109 states and 141 transitions. [2025-03-17 20:02:06,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states and 141 transitions. [2025-03-17 20:02:06,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 90. [2025-03-17 20:02:06,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 90 states have (on average 1.2444444444444445) internal successors, (112), 89 states have internal predecessors, (112), 0 states have call successors, (0), 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-17 20:02:06,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 112 transitions. [2025-03-17 20:02:06,720 INFO L240 hiAutomatonCegarLoop]: Abstraction has 90 states and 112 transitions. [2025-03-17 20:02:06,720 INFO L432 stractBuchiCegarLoop]: Abstraction has 90 states and 112 transitions. [2025-03-17 20:02:06,720 INFO L338 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2025-03-17 20:02:06,720 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 112 transitions. [2025-03-17 20:02:06,720 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:02:06,720 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:06,720 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:06,721 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1] [2025-03-17 20:02:06,721 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:02:06,721 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-17 20:02:06,721 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-17 20:02:06,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:06,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1221335761, now seen corresponding path program 21 times [2025-03-17 20:02:06,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:06,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794690019] [2025-03-17 20:02:06,721 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:02:06,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:06,731 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 68 statements into 10 equivalence classes. [2025-03-17 20:02:06,757 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 20:02:06,757 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-03-17 20:02:06,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:07,048 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 176 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:07,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:02:07,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794690019] [2025-03-17 20:02:07,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794690019] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:02:07,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509233697] [2025-03-17 20:02:07,048 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:02:07,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:02:07,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:07,051 INFO L229 MonitoredProcess]: Starting monitored process 274 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:02:07,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (274)] Waiting until timeout for monitored process [2025-03-17 20:02:07,141 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 68 statements into 10 equivalence classes. [2025-03-17 20:02:07,352 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 20:02:07,352 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-03-17 20:02:07,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:07,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 20:02:07,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:07,623 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 225 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:07,624 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:02:07,782 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 225 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:07,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509233697] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:02:07,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:02:07,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 33 [2025-03-17 20:02:07,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075329718] [2025-03-17 20:02:07,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:02:07,783 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:02:07,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:07,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1344, now seen corresponding path program 18 times [2025-03-17 20:02:07,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:07,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172642997] [2025-03-17 20:02:07,783 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 20:02:07,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:07,785 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:02:07,786 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:02:07,786 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-17 20:02:07,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:07,786 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:07,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:02:07,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:02:07,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:07,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:07,788 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:07,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:02:07,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-17 20:02:07,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=855, Unknown=0, NotChecked=0, Total=1122 [2025-03-17 20:02:07,821 INFO L87 Difference]: Start difference. First operand 90 states and 112 transitions. cyclomatic complexity: 42 Second operand has 34 states, 33 states have (on average 4.03030303030303) internal successors, (133), 34 states have internal predecessors, (133), 0 states have call successors, (0), 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-17 20:02:08,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:02:08,029 INFO L93 Difference]: Finished difference Result 164 states and 204 transitions. [2025-03-17 20:02:08,029 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 164 states and 204 transitions. [2025-03-17 20:02:08,030 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:02:08,030 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 164 states to 91 states and 113 transitions. [2025-03-17 20:02:08,030 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-03-17 20:02:08,030 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-03-17 20:02:08,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 113 transitions. [2025-03-17 20:02:08,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:02:08,030 INFO L218 hiAutomatonCegarLoop]: Abstraction has 91 states and 113 transitions. [2025-03-17 20:02:08,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 113 transitions. [2025-03-17 20:02:08,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-03-17 20:02:08,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 91 states have (on average 1.2417582417582418) internal successors, (113), 90 states have internal predecessors, (113), 0 states have call successors, (0), 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-17 20:02:08,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 113 transitions. [2025-03-17 20:02:08,031 INFO L240 hiAutomatonCegarLoop]: Abstraction has 91 states and 113 transitions. [2025-03-17 20:02:08,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 20:02:08,032 INFO L432 stractBuchiCegarLoop]: Abstraction has 91 states and 113 transitions. [2025-03-17 20:02:08,032 INFO L338 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2025-03-17 20:02:08,033 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 113 transitions. [2025-03-17 20:02:08,033 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:02:08,033 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:08,033 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:08,033 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1] [2025-03-17 20:02:08,033 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:02:08,033 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-17 20:02:08,033 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-17 20:02:08,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:08,034 INFO L85 PathProgramCache]: Analyzing trace with hash 453079137, now seen corresponding path program 22 times [2025-03-17 20:02:08,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:08,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400432061] [2025-03-17 20:02:08,034 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 20:02:08,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:08,041 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 69 statements into 2 equivalence classes. [2025-03-17 20:02:08,065 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 20:02:08,065 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 20:02:08,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:08,065 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:08,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 20:02:08,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 20:02:08,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:08,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:08,084 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:08,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:08,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1344, now seen corresponding path program 19 times [2025-03-17 20:02:08,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:08,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432443856] [2025-03-17 20:02:08,085 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 20:02:08,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:08,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:02:08,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:02:08,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:08,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:08,089 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:08,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:02:08,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:02:08,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:08,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:08,091 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:08,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:08,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1617354144, now seen corresponding path program 9 times [2025-03-17 20:02:08,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:08,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701848723] [2025-03-17 20:02:08,092 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:02:08,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:08,101 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 71 statements into 10 equivalence classes. [2025-03-17 20:02:08,164 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 71 of 71 statements. [2025-03-17 20:02:08,164 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-03-17 20:02:08,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:08,164 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:08,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-17 20:02:08,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-17 20:02:08,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:08,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:08,184 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:21,788 WARN L286 SmtUtils]: Spent 13.57s on a formula simplification. DAG size of input: 361 DAG size of output: 272 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-03-17 20:02:22,047 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:02:22,047 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:02:22,047 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:02:22,047 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:02:22,047 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:02:22,047 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:22,047 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:02:22,047 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:02:22,047 INFO L132 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration27_Lasso [2025-03-17 20:02:22,047 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:02:22,047 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:02:22,048 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:22,050 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:22,050 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:22,051 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:22,052 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:22,053 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:22,055 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:22,056 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:22,057 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:22,058 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:22,059 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:22,060 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:22,061 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:22,062 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:22,063 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:22,813 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:22,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:22,816 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:22,817 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:22,818 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:22,820 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:22,821 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:22,822 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:22,823 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:23,098 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:02:23,099 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:02:23,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:23,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:23,101 INFO L229 MonitoredProcess]: Starting monitored process 275 with /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-17 20:02:23,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (275)] Waiting until timeout for monitored process [2025-03-17 20:02:23,112 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-17 20:02:23,122 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:23,122 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:23,122 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:23,122 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:23,122 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:23,122 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:23,122 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:23,123 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:23,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (275)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:23,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:23,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:23,150 INFO L229 MonitoredProcess]: Starting monitored process 276 with /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-17 20:02:23,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (276)] Waiting until timeout for monitored process [2025-03-17 20:02:23,152 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-17 20:02:23,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:23,161 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:23,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:23,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:23,161 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:23,161 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:23,161 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:23,162 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:23,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (276)] Ended with exit code 0 [2025-03-17 20:02:23,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:23,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:23,170 INFO L229 MonitoredProcess]: Starting monitored process 277 with /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-17 20:02:23,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (277)] Waiting until timeout for monitored process [2025-03-17 20:02:23,171 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:23,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:23,181 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:23,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:23,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:23,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:23,181 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:23,181 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:23,184 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:23,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (277)] Ended with exit code 0 [2025-03-17 20:02:23,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:23,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:23,190 INFO L229 MonitoredProcess]: Starting monitored process 278 with /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-17 20:02:23,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (278)] Waiting until timeout for monitored process [2025-03-17 20:02:23,192 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-17 20:02:23,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:23,201 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:23,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:23,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:23,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:23,202 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:23,202 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:23,203 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:23,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (278)] Ended with exit code 0 [2025-03-17 20:02:23,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:23,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:23,209 INFO L229 MonitoredProcess]: Starting monitored process 279 with /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-17 20:02:23,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (279)] Waiting until timeout for monitored process [2025-03-17 20:02:23,211 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-17 20:02:23,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:23,220 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:23,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:23,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:23,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:23,220 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:23,220 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:23,221 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:23,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (279)] Ended with exit code 0 [2025-03-17 20:02:23,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:23,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:23,227 INFO L229 MonitoredProcess]: Starting monitored process 280 with /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-17 20:02:23,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (280)] Waiting until timeout for monitored process [2025-03-17 20:02:23,229 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-17 20:02:23,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:23,238 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:23,238 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:23,238 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:23,239 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:23,239 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:23,241 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:23,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (280)] Ended with exit code 0 [2025-03-17 20:02:23,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:23,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:23,247 INFO L229 MonitoredProcess]: Starting monitored process 281 with /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-17 20:02:23,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (281)] Waiting until timeout for monitored process [2025-03-17 20:02:23,249 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-17 20:02:23,259 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:23,259 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:23,259 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:23,259 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:23,259 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:23,259 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:23,259 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:23,261 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:23,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (281)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:23,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:23,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:23,268 INFO L229 MonitoredProcess]: Starting monitored process 282 with /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-17 20:02:23,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (282)] Waiting until timeout for monitored process [2025-03-17 20:02:23,269 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-17 20:02:23,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:23,279 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:23,279 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:23,279 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:23,279 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:23,279 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:23,279 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:23,280 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:23,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (282)] Ended with exit code 0 [2025-03-17 20:02:23,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:23,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:23,287 INFO L229 MonitoredProcess]: Starting monitored process 283 with /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-17 20:02:23,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (283)] Waiting until timeout for monitored process [2025-03-17 20:02:23,288 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-17 20:02:23,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:23,298 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:23,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:23,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:23,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:23,298 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:23,298 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:23,299 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:23,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (283)] Ended with exit code 0 [2025-03-17 20:02:23,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:23,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:23,305 INFO L229 MonitoredProcess]: Starting monitored process 284 with /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-17 20:02:23,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (284)] Waiting until timeout for monitored process [2025-03-17 20:02:23,307 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-17 20:02:23,316 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:23,316 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:23,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:23,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:23,316 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:23,316 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:23,316 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:23,317 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:23,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (284)] Ended with exit code 0 [2025-03-17 20:02:23,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:23,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:23,324 INFO L229 MonitoredProcess]: Starting monitored process 285 with /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-17 20:02:23,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (285)] Waiting until timeout for monitored process [2025-03-17 20:02:23,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-17 20:02:23,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:23,334 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:23,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:23,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:23,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:23,335 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:23,335 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:23,335 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:23,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (285)] Ended with exit code 0 [2025-03-17 20:02:23,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:23,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:23,342 INFO L229 MonitoredProcess]: Starting monitored process 286 with /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-17 20:02:23,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (286)] Waiting until timeout for monitored process [2025-03-17 20:02:23,343 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-17 20:02:23,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:23,352 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:23,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:23,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:23,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:23,353 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:23,353 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:23,353 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:23,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (286)] Ended with exit code 0 [2025-03-17 20:02:23,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:23,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:23,363 INFO L229 MonitoredProcess]: Starting monitored process 287 with /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-17 20:02:23,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (287)] Waiting until timeout for monitored process [2025-03-17 20:02:23,364 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-17 20:02:23,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:23,373 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:23,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:23,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:23,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:23,374 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:23,374 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:23,374 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:23,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (287)] Ended with exit code 0 [2025-03-17 20:02:23,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:23,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:23,381 INFO L229 MonitoredProcess]: Starting monitored process 288 with /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-17 20:02:23,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (288)] Waiting until timeout for monitored process [2025-03-17 20:02:23,394 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-17 20:02:23,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:23,404 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:23,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:23,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:23,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:23,404 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:23,404 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:23,405 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:23,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (288)] Ended with exit code 0 [2025-03-17 20:02:23,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:23,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:23,412 INFO L229 MonitoredProcess]: Starting monitored process 289 with /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-17 20:02:23,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (289)] Waiting until timeout for monitored process [2025-03-17 20:02:23,413 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-17 20:02:23,422 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:23,422 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:23,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:23,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:23,424 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:23,424 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:23,427 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:23,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (289)] Ended with exit code 0 [2025-03-17 20:02:23,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:23,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:23,434 INFO L229 MonitoredProcess]: Starting monitored process 290 with /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-17 20:02:23,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (290)] Waiting until timeout for monitored process [2025-03-17 20:02:23,435 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-17 20:02:23,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:23,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:23,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:23,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:23,446 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:23,446 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:23,450 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:23,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (290)] Ended with exit code 0 [2025-03-17 20:02:23,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:23,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:23,457 INFO L229 MonitoredProcess]: Starting monitored process 291 with /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-17 20:02:23,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (291)] Waiting until timeout for monitored process [2025-03-17 20:02:23,458 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-17 20:02:23,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:23,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:23,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:23,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:23,469 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:23,469 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:23,472 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:23,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (291)] Ended with exit code 0 [2025-03-17 20:02:23,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:23,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:23,479 INFO L229 MonitoredProcess]: Starting monitored process 292 with /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-17 20:02:23,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (292)] Waiting until timeout for monitored process [2025-03-17 20:02:23,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-17 20:02:23,490 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:23,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:23,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:23,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:23,491 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:23,491 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:23,493 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:23,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (292)] Ended with exit code 0 [2025-03-17 20:02:23,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:23,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:23,500 INFO L229 MonitoredProcess]: Starting monitored process 293 with /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-17 20:02:23,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (293)] Waiting until timeout for monitored process [2025-03-17 20:02:23,501 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-17 20:02:23,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:23,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:23,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:23,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:23,511 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:23,511 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:23,513 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:23,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (293)] Ended with exit code 0 [2025-03-17 20:02:23,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:23,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:23,520 INFO L229 MonitoredProcess]: Starting monitored process 294 with /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-17 20:02:23,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (294)] Waiting until timeout for monitored process [2025-03-17 20:02:23,521 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-17 20:02:23,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:23,531 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:23,531 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:23,531 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:23,532 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:23,532 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:23,535 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:23,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (294)] Ended with exit code 0 [2025-03-17 20:02:23,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:23,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:23,542 INFO L229 MonitoredProcess]: Starting monitored process 295 with /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-17 20:02:23,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (295)] Waiting until timeout for monitored process [2025-03-17 20:02:23,544 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-17 20:02:23,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:23,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:23,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:23,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:23,555 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:23,555 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:23,558 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:23,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (295)] Ended with exit code 0 [2025-03-17 20:02:23,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:23,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:23,565 INFO L229 MonitoredProcess]: Starting monitored process 296 with /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-17 20:02:23,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (296)] Waiting until timeout for monitored process [2025-03-17 20:02:23,566 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:23,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:23,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:23,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:23,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:23,578 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:23,578 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:23,583 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:23,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (296)] Ended with exit code 0 [2025-03-17 20:02:23,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:23,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:23,590 INFO L229 MonitoredProcess]: Starting monitored process 297 with /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-17 20:02:23,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (297)] Waiting until timeout for monitored process [2025-03-17 20:02:23,591 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-17 20:02:23,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:23,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:23,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:23,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:23,602 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:23,602 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:23,605 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:23,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (297)] Ended with exit code 0 [2025-03-17 20:02:23,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:23,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:23,612 INFO L229 MonitoredProcess]: Starting monitored process 298 with /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-17 20:02:23,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (298)] Waiting until timeout for monitored process [2025-03-17 20:02:23,614 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-17 20:02:23,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:23,623 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:23,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:23,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:23,625 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:23,625 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:23,628 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:23,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (298)] Ended with exit code 0 [2025-03-17 20:02:23,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:23,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:23,636 INFO L229 MonitoredProcess]: Starting monitored process 299 with /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-17 20:02:23,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (299)] Waiting until timeout for monitored process [2025-03-17 20:02:23,637 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-17 20:02:23,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:23,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:23,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:23,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:23,648 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:23,648 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:23,652 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:23,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (299)] Ended with exit code 0 [2025-03-17 20:02:23,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:23,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:23,659 INFO L229 MonitoredProcess]: Starting monitored process 300 with /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-17 20:02:23,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (300)] Waiting until timeout for monitored process [2025-03-17 20:02:23,662 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-17 20:02:23,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:23,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:23,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:23,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:23,674 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:23,674 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:23,679 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:23,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (300)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:23,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:23,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:23,687 INFO L229 MonitoredProcess]: Starting monitored process 301 with /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-17 20:02:23,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (301)] Waiting until timeout for monitored process [2025-03-17 20:02:23,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-17 20:02:23,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:23,699 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:23,699 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:23,699 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:23,701 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:23,701 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:23,705 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:02:23,712 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-03-17 20:02:23,713 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-03-17 20:02:23,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:23,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:23,715 INFO L229 MonitoredProcess]: Starting monitored process 302 with /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-17 20:02:23,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (302)] Waiting until timeout for monitored process [2025-03-17 20:02:23,717 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:02:23,728 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 20:02:23,729 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:02:23,729 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) 36)_1) = -1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) 36)_1 Supporting invariants [] [2025-03-17 20:02:23,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (301)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:23,826 INFO L156 tatePredicateManager]: 39 out of 41 supporting invariants were superfluous and have been removed [2025-03-17 20:02:23,829 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-17 20:02:23,830 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-17 20:02:23,830 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc12!base,]]] [2025-03-17 20:02:23,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:23,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 20:02:23,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 20:02:23,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:23,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:23,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-17 20:02:23,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:24,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:02:24,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:02:24,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:24,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:24,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 20:02:24,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:24,275 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-17 20:02:24,275 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.12 stem predicates 2 loop predicates [2025-03-17 20:02:24,275 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 91 states and 113 transitions. cyclomatic complexity: 42 Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 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-17 20:02:24,302 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 91 states and 113 transitions. cyclomatic complexity: 42. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 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) Result 92 states and 115 transitions. Complement of second has 5 states. [2025-03-17 20:02:24,303 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-17 20:02:24,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 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-17 20:02:24,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-17 20:02:24,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 69 letters. Loop has 2 letters. [2025-03-17 20:02:24,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:24,303 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 20:02:24,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:24,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 20:02:24,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 20:02:24,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:24,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:24,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-17 20:02:24,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:24,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (302)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:24,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:02:24,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:02:24,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:24,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:24,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 20:02:24,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:24,749 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-17 20:02:24,750 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.12 stem predicates 2 loop predicates [2025-03-17 20:02:24,750 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 91 states and 113 transitions. cyclomatic complexity: 42 Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 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-17 20:02:24,776 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 91 states and 113 transitions. cyclomatic complexity: 42. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 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) Result 92 states and 115 transitions. Complement of second has 5 states. [2025-03-17 20:02:24,777 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-17 20:02:24,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 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-17 20:02:24,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-17 20:02:24,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 69 letters. Loop has 2 letters. [2025-03-17 20:02:24,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:24,777 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 20:02:24,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:24,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 20:02:24,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 20:02:24,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:24,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:24,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-17 20:02:24,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:25,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:02:25,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:02:25,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:25,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:25,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 20:02:25,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:25,207 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-17 20:02:25,207 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.12 stem predicates 2 loop predicates [2025-03-17 20:02:25,207 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 91 states and 113 transitions. cyclomatic complexity: 42 Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 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-17 20:02:25,508 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 91 states and 113 transitions. cyclomatic complexity: 42. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 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) Result 127 states and 164 transitions. Complement of second has 27 states. [2025-03-17 20:02:25,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 12 stem states 2 non-accepting loop states 2 accepting loop states [2025-03-17 20:02:25,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 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-17 20:02:25,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 110 transitions. [2025-03-17 20:02:25,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 110 transitions. Stem has 69 letters. Loop has 2 letters. [2025-03-17 20:02:25,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:25,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 110 transitions. Stem has 71 letters. Loop has 2 letters. [2025-03-17 20:02:25,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:25,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 110 transitions. Stem has 69 letters. Loop has 4 letters. [2025-03-17 20:02:25,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:25,509 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 164 transitions. [2025-03-17 20:02:25,510 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:02:25,510 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 119 states and 154 transitions. [2025-03-17 20:02:25,510 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-17 20:02:25,510 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-17 20:02:25,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 154 transitions. [2025-03-17 20:02:25,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:02:25,511 INFO L218 hiAutomatonCegarLoop]: Abstraction has 119 states and 154 transitions. [2025-03-17 20:02:25,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 154 transitions. [2025-03-17 20:02:25,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 99. [2025-03-17 20:02:25,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 99 states have (on average 1.2424242424242424) internal successors, (123), 98 states have internal predecessors, (123), 0 states have call successors, (0), 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-17 20:02:25,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 123 transitions. [2025-03-17 20:02:25,512 INFO L240 hiAutomatonCegarLoop]: Abstraction has 99 states and 123 transitions. [2025-03-17 20:02:25,512 INFO L432 stractBuchiCegarLoop]: Abstraction has 99 states and 123 transitions. [2025-03-17 20:02:25,512 INFO L338 stractBuchiCegarLoop]: ======== Iteration 28 ============ [2025-03-17 20:02:25,512 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 123 transitions. [2025-03-17 20:02:25,512 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:02:25,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:25,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:25,513 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1] [2025-03-17 20:02:25,513 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:02:25,513 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-17 20:02:25,514 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-17 20:02:25,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:25,514 INFO L85 PathProgramCache]: Analyzing trace with hash -260849782, now seen corresponding path program 23 times [2025-03-17 20:02:25,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:25,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478029450] [2025-03-17 20:02:25,514 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 20:02:25,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:25,521 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 75 statements into 11 equivalence classes. [2025-03-17 20:02:25,532 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 20:02:25,533 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-17 20:02:25,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:25,860 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 280 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:25,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:02:25,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478029450] [2025-03-17 20:02:25,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478029450] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:02:25,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585302053] [2025-03-17 20:02:25,861 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 20:02:25,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:02:25,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:25,863 INFO L229 MonitoredProcess]: Starting monitored process 303 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:02:25,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (303)] Waiting until timeout for monitored process [2025-03-17 20:02:25,965 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 75 statements into 11 equivalence classes. [2025-03-17 20:02:26,020 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 20:02:26,020 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-17 20:02:26,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:26,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 20:02:26,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:26,300 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 280 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:26,300 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:02:26,493 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 280 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:26,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585302053] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:02:26,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:02:26,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 34 [2025-03-17 20:02:26,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220259245] [2025-03-17 20:02:26,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:02:26,494 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:02:26,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:26,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1344, now seen corresponding path program 20 times [2025-03-17 20:02:26,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:26,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927524170] [2025-03-17 20:02:26,494 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:02:26,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:26,497 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:02:26,497 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:02:26,497 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:02:26,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:26,497 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:26,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:02:26,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:02:26,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:26,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:26,499 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:26,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:02:26,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-17 20:02:26,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=892, Unknown=0, NotChecked=0, Total=1190 [2025-03-17 20:02:26,531 INFO L87 Difference]: Start difference. First operand 99 states and 123 transitions. cyclomatic complexity: 46 Second operand has 35 states, 34 states have (on average 4.029411764705882) internal successors, (137), 35 states have internal predecessors, (137), 0 states have call successors, (0), 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-17 20:02:26,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:02:26,747 INFO L93 Difference]: Finished difference Result 181 states and 225 transitions. [2025-03-17 20:02:26,747 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 181 states and 225 transitions. [2025-03-17 20:02:26,748 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:02:26,748 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 181 states to 100 states and 124 transitions. [2025-03-17 20:02:26,748 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-03-17 20:02:26,748 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-03-17 20:02:26,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 124 transitions. [2025-03-17 20:02:26,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:02:26,749 INFO L218 hiAutomatonCegarLoop]: Abstraction has 100 states and 124 transitions. [2025-03-17 20:02:26,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 124 transitions. [2025-03-17 20:02:26,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-17 20:02:26,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 100 states have (on average 1.24) internal successors, (124), 99 states have internal predecessors, (124), 0 states have call successors, (0), 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-17 20:02:26,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 124 transitions. [2025-03-17 20:02:26,750 INFO L240 hiAutomatonCegarLoop]: Abstraction has 100 states and 124 transitions. [2025-03-17 20:02:26,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-17 20:02:26,750 INFO L432 stractBuchiCegarLoop]: Abstraction has 100 states and 124 transitions. [2025-03-17 20:02:26,750 INFO L338 stractBuchiCegarLoop]: ======== Iteration 29 ============ [2025-03-17 20:02:26,750 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 100 states and 124 transitions. [2025-03-17 20:02:26,751 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:02:26,751 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:26,751 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:26,751 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1] [2025-03-17 20:02:26,751 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:02:26,751 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-17 20:02:26,751 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-17 20:02:26,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:26,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1453418472, now seen corresponding path program 24 times [2025-03-17 20:02:26,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:26,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782283039] [2025-03-17 20:02:26,752 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 20:02:26,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:26,759 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 76 statements into 11 equivalence classes. [2025-03-17 20:02:26,798 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 20:02:26,798 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2025-03-17 20:02:26,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:26,798 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:26,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-17 20:02:26,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 20:02:26,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:26,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:26,815 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:26,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:26,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1344, now seen corresponding path program 21 times [2025-03-17 20:02:26,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:26,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264677082] [2025-03-17 20:02:26,816 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:02:26,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:26,819 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:02:26,819 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:02:26,819 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 20:02:26,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:26,819 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:26,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:02:26,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:02:26,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:26,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:26,822 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:26,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:26,822 INFO L85 PathProgramCache]: Analyzing trace with hash -870780009, now seen corresponding path program 10 times [2025-03-17 20:02:26,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:26,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938998090] [2025-03-17 20:02:26,822 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 20:02:26,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:26,830 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 78 statements into 2 equivalence classes. [2025-03-17 20:02:26,849 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 20:02:26,849 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 20:02:26,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:26,849 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:26,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 20:02:26,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 20:02:26,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:26,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:26,865 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:41,407 WARN L286 SmtUtils]: Spent 14.51s on a formula simplification. DAG size of input: 392 DAG size of output: 298 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-03-17 20:02:42,282 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:02:42,282 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:02:42,282 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:02:42,282 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:02:42,282 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:02:42,282 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:42,282 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:02:42,282 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:02:42,282 INFO L132 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration29_Lasso [2025-03-17 20:02:42,282 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:02:42,282 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:02:42,283 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:42,285 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:42,286 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:42,287 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:45,424 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:45,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:45,427 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:45,428 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:45,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:45,431 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:45,434 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:45,436 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:45,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:45,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:45,440 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:45,442 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:45,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:45,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:45,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:45,446 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:45,447 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:45,448 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:45,449 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:45,451 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:45,755 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:02:45,755 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:02:45,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:45,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:45,757 INFO L229 MonitoredProcess]: Starting monitored process 304 with /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-17 20:02:45,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (304)] Waiting until timeout for monitored process [2025-03-17 20:02:45,761 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-17 20:02:45,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:45,770 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:45,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:45,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:45,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:45,771 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:45,771 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:45,772 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:45,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (304)] Ended with exit code 0 [2025-03-17 20:02:45,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:45,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:45,779 INFO L229 MonitoredProcess]: Starting monitored process 305 with /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-17 20:02:45,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (305)] Waiting until timeout for monitored process [2025-03-17 20:02:45,781 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-17 20:02:45,791 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:45,791 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:45,791 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:45,791 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:45,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:45,791 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:45,791 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:45,792 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:45,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (305)] Ended with exit code 0 [2025-03-17 20:02:45,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:45,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:45,799 INFO L229 MonitoredProcess]: Starting monitored process 306 with /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-17 20:02:45,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (306)] Waiting until timeout for monitored process [2025-03-17 20:02:45,801 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-17 20:02:45,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:45,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:45,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:45,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:45,811 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:45,811 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:45,813 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:45,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (306)] Ended with exit code 0 [2025-03-17 20:02:45,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:45,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:45,821 INFO L229 MonitoredProcess]: Starting monitored process 307 with /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-17 20:02:45,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (307)] Waiting until timeout for monitored process [2025-03-17 20:02:45,822 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-17 20:02:45,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:45,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:45,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:45,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:45,833 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:45,834 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:45,837 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:45,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (307)] Ended with exit code 0 [2025-03-17 20:02:45,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:45,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:45,844 INFO L229 MonitoredProcess]: Starting monitored process 308 with /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-17 20:02:45,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (308)] Waiting until timeout for monitored process [2025-03-17 20:02:45,846 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-17 20:02:45,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:45,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:45,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:45,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:45,857 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:45,857 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:45,860 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:45,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (308)] Ended with exit code 0 [2025-03-17 20:02:45,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:45,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:45,868 INFO L229 MonitoredProcess]: Starting monitored process 309 with /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-17 20:02:45,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (309)] Waiting until timeout for monitored process [2025-03-17 20:02:45,870 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-17 20:02:45,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:45,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:45,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:45,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:45,881 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:45,881 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:45,885 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:02:45,891 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-03-17 20:02:45,891 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-03-17 20:02:45,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:45,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:45,893 INFO L229 MonitoredProcess]: Starting monitored process 310 with /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-17 20:02:45,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (310)] Waiting until timeout for monitored process [2025-03-17 20:02:45,894 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:02:45,905 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 20:02:45,905 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:02:45,905 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~a#1.base) (+ 40 ULTIMATE.start_test_fun_~a#1.offset))_1) = -1*v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~a#1.base) (+ 40 ULTIMATE.start_test_fun_~a#1.offset))_1 Supporting invariants [] [2025-03-17 20:02:45,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (309)] Ended with exit code 0 [2025-03-17 20:02:46,019 INFO L156 tatePredicateManager]: 24 out of 25 supporting invariants were superfluous and have been removed [2025-03-17 20:02:46,020 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-17 20:02:46,021 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-17 20:02:46,021 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~a!base,]]] [2025-03-17 20:02:46,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:46,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-17 20:02:46,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 20:02:46,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:46,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:46,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 20:02:46,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:46,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:02:46,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:02:46,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:46,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:46,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 20:02:46,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:46,299 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-17 20:02:46,300 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.12 stem predicates 2 loop predicates [2025-03-17 20:02:46,300 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 100 states and 124 transitions. cyclomatic complexity: 46 Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 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-17 20:02:46,318 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 100 states and 124 transitions. cyclomatic complexity: 46. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 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 101 states and 126 transitions. Complement of second has 4 states. [2025-03-17 20:02:46,319 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-17 20:02:46,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 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-17 20:02:46,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2025-03-17 20:02:46,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 76 letters. Loop has 2 letters. [2025-03-17 20:02:46,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:46,319 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 20:02:46,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:46,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-17 20:02:46,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 20:02:46,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:46,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:46,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 20:02:46,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:46,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (310)] Ended with exit code 0 [2025-03-17 20:02:46,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:02:46,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:02:46,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:46,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:46,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 20:02:46,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:46,593 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-17 20:02:46,593 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.12 stem predicates 2 loop predicates [2025-03-17 20:02:46,593 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 100 states and 124 transitions. cyclomatic complexity: 46 Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 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-17 20:02:46,607 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 100 states and 124 transitions. cyclomatic complexity: 46. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 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 101 states and 126 transitions. Complement of second has 4 states. [2025-03-17 20:02:46,609 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-17 20:02:46,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 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-17 20:02:46,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2025-03-17 20:02:46,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 76 letters. Loop has 2 letters. [2025-03-17 20:02:46,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:46,610 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 20:02:46,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:46,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-17 20:02:46,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 20:02:46,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:46,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:46,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 20:02:46,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:46,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:02:46,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:02:46,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:46,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:46,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 20:02:46,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:46,850 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-17 20:02:46,850 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.12 stem predicates 2 loop predicates [2025-03-17 20:02:46,850 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 100 states and 124 transitions. cyclomatic complexity: 46 Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 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-17 20:02:47,146 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 100 states and 124 transitions. cyclomatic complexity: 46. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 137 states and 177 transitions. Complement of second has 28 states. [2025-03-17 20:02:47,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 12 stem states 2 non-accepting loop states 2 accepting loop states [2025-03-17 20:02:47,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 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-17 20:02:47,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 119 transitions. [2025-03-17 20:02:47,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 119 transitions. Stem has 76 letters. Loop has 2 letters. [2025-03-17 20:02:47,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:47,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 119 transitions. Stem has 78 letters. Loop has 2 letters. [2025-03-17 20:02:47,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:47,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 119 transitions. Stem has 76 letters. Loop has 4 letters. [2025-03-17 20:02:47,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:47,147 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 137 states and 177 transitions. [2025-03-17 20:02:47,147 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:02:47,148 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 137 states to 129 states and 167 transitions. [2025-03-17 20:02:47,148 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-17 20:02:47,148 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-17 20:02:47,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 129 states and 167 transitions. [2025-03-17 20:02:47,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:02:47,148 INFO L218 hiAutomatonCegarLoop]: Abstraction has 129 states and 167 transitions. [2025-03-17 20:02:47,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states and 167 transitions. [2025-03-17 20:02:47,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 108. [2025-03-17 20:02:47,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 108 states have (on average 1.2407407407407407) internal successors, (134), 107 states have internal predecessors, (134), 0 states have call successors, (0), 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-17 20:02:47,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 134 transitions. [2025-03-17 20:02:47,149 INFO L240 hiAutomatonCegarLoop]: Abstraction has 108 states and 134 transitions. [2025-03-17 20:02:47,149 INFO L432 stractBuchiCegarLoop]: Abstraction has 108 states and 134 transitions. [2025-03-17 20:02:47,149 INFO L338 stractBuchiCegarLoop]: ======== Iteration 30 ============ [2025-03-17 20:02:47,149 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 108 states and 134 transitions. [2025-03-17 20:02:47,149 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:02:47,149 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:47,149 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:47,150 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1] [2025-03-17 20:02:47,150 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:02:47,150 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-17 20:02:47,150 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-17 20:02:47,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:47,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1756103169, now seen corresponding path program 25 times [2025-03-17 20:02:47,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:47,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713729999] [2025-03-17 20:02:47,151 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 20:02:47,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:47,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-17 20:02:47,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-17 20:02:47,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:47,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:47,509 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 280 proven. 127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:47,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:02:47,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713729999] [2025-03-17 20:02:47,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713729999] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:02:47,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792855192] [2025-03-17 20:02:47,510 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 20:02:47,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:02:47,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:47,512 INFO L229 MonitoredProcess]: Starting monitored process 311 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:02:47,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (311)] Waiting until timeout for monitored process [2025-03-17 20:02:47,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-17 20:02:47,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-17 20:02:47,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:47,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:47,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-17 20:02:47,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:47,994 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 341 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:47,995 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:02:48,250 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 341 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:48,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792855192] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:02:48,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:02:48,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 39 [2025-03-17 20:02:48,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551553737] [2025-03-17 20:02:48,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:02:48,250 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:02:48,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:48,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1344, now seen corresponding path program 22 times [2025-03-17 20:02:48,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:48,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129398504] [2025-03-17 20:02:48,251 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 20:02:48,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:48,253 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-03-17 20:02:48,254 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:02:48,254 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 20:02:48,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:48,254 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:48,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:02:48,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:02:48,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:48,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:48,257 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:48,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:02:48,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-17 20:02:48,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=1193, Unknown=0, NotChecked=0, Total=1560 [2025-03-17 20:02:48,287 INFO L87 Difference]: Start difference. First operand 108 states and 134 transitions. cyclomatic complexity: 50 Second operand has 40 states, 39 states have (on average 4.076923076923077) internal successors, (159), 40 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:02:48,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:02:48,469 INFO L93 Difference]: Finished difference Result 198 states and 246 transitions. [2025-03-17 20:02:48,469 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 198 states and 246 transitions. [2025-03-17 20:02:48,470 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:02:48,470 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 198 states to 109 states and 135 transitions. [2025-03-17 20:02:48,470 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-03-17 20:02:48,470 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-03-17 20:02:48,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 109 states and 135 transitions. [2025-03-17 20:02:48,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:02:48,470 INFO L218 hiAutomatonCegarLoop]: Abstraction has 109 states and 135 transitions. [2025-03-17 20:02:48,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states and 135 transitions. [2025-03-17 20:02:48,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-03-17 20:02:48,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 109 states have (on average 1.238532110091743) internal successors, (135), 108 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-17 20:02:48,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 135 transitions. [2025-03-17 20:02:48,472 INFO L240 hiAutomatonCegarLoop]: Abstraction has 109 states and 135 transitions. [2025-03-17 20:02:48,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-17 20:02:48,472 INFO L432 stractBuchiCegarLoop]: Abstraction has 109 states and 135 transitions. [2025-03-17 20:02:48,472 INFO L338 stractBuchiCegarLoop]: ======== Iteration 31 ============ [2025-03-17 20:02:48,472 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states and 135 transitions. [2025-03-17 20:02:48,473 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:02:48,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:48,473 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:48,473 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1] [2025-03-17 20:02:48,473 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:02:48,473 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-03-17 20:02:48,473 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-03-17 20:02:48,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:48,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1363479987, now seen corresponding path program 26 times [2025-03-17 20:02:48,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:48,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689704699] [2025-03-17 20:02:48,474 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:02:48,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:48,482 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-03-17 20:02:48,495 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 20:02:48,495 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:02:48,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:48,496 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:48,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 20:02:48,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 20:02:48,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:48,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:48,515 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:48,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:48,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1344, now seen corresponding path program 23 times [2025-03-17 20:02:48,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:48,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792346380] [2025-03-17 20:02:48,515 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 20:02:48,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:48,518 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:02:48,519 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:02:48,519 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:02:48,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:48,519 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:48,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:02:48,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:02:48,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:48,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:48,521 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:48,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:48,521 INFO L85 PathProgramCache]: Analyzing trace with hash 339242610, now seen corresponding path program 11 times [2025-03-17 20:02:48,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:48,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133703543] [2025-03-17 20:02:48,522 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 20:02:48,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:48,530 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 85 statements into 12 equivalence classes. [2025-03-17 20:02:48,548 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) and asserted 85 of 85 statements. [2025-03-17 20:02:48,549 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2025-03-17 20:02:48,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:48,549 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:48,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-17 20:02:48,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-17 20:02:48,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:48,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:48,566 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace