./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/BrockschmidtCookFuhs-2013CAV-Fig1-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/BrockschmidtCookFuhs-2013CAV-Fig1-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 1e35e1f5dba77fd8ed843a6cdfa0fc21590233839dbc71bb991dc25008dd4b76 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 06:52:33,245 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:52:33,304 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-09 06:52:33,307 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:52:33,308 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:52:33,308 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-09 06:52:33,330 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:52:33,331 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:52:33,331 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:52:33,331 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:52:33,331 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:52:33,331 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:52:33,331 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:52:33,332 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:52:33,332 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-09 06:52:33,332 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-09 06:52:33,332 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-09 06:52:33,332 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-09 06:52:33,332 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-09 06:52:33,332 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-09 06:52:33,332 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:52:33,332 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-09 06:52:33,332 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:52:33,332 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:52:33,332 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-09 06:52:33,332 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-09 06:52:33,332 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-09 06:52:33,332 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:52:33,332 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:52:33,332 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-09 06:52:33,332 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:52:33,332 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:52:33,332 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:52:33,332 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:52:33,333 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:52:33,333 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:52:33,333 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-09 06:52:33,333 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1e35e1f5dba77fd8ed843a6cdfa0fc21590233839dbc71bb991dc25008dd4b76 [2025-03-09 06:52:33,541 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:52:33,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:52:33,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:52:33,549 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:52:33,549 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:52:33,550 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/BrockschmidtCookFuhs-2013CAV-Fig1-alloca-2.i [2025-03-09 06:52:34,640 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a09e60b61/8325ef471c6a4dd2a6904de5fd5faa83/FLAG53149b326 [2025-03-09 06:52:34,894 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:52:34,895 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/BrockschmidtCookFuhs-2013CAV-Fig1-alloca-2.i [2025-03-09 06:52:34,907 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a09e60b61/8325ef471c6a4dd2a6904de5fd5faa83/FLAG53149b326 [2025-03-09 06:52:35,199 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a09e60b61/8325ef471c6a4dd2a6904de5fd5faa83 [2025-03-09 06:52:35,201 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:52:35,202 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:52:35,203 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:52:35,203 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:52:35,207 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:52:35,207 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:52:35" (1/1) ... [2025-03-09 06:52:35,208 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ceaecac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:52:35, skipping insertion in model container [2025-03-09 06:52:35,208 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:52:35" (1/1) ... [2025-03-09 06:52:35,225 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:52:35,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:52:35,419 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:52:35,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:52:35,469 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:52:35,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:52:35 WrapperNode [2025-03-09 06:52:35,469 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:52:35,470 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:52:35,471 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:52:35,471 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:52:35,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:52:35" (1/1) ... [2025-03-09 06:52:35,484 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:52:35" (1/1) ... [2025-03-09 06:52:35,496 INFO L138 Inliner]: procedures = 110, calls = 23, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 58 [2025-03-09 06:52:35,497 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:52:35,498 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:52:35,498 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:52:35,498 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:52:35,502 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:52:35" (1/1) ... [2025-03-09 06:52:35,502 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:52:35" (1/1) ... [2025-03-09 06:52:35,504 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:52:35" (1/1) ... [2025-03-09 06:52:35,511 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [5, 5, 2]. 42 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 6 writes are split as follows [2, 3, 1]. [2025-03-09 06:52:35,511 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:52:35" (1/1) ... [2025-03-09 06:52:35,511 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:52:35" (1/1) ... [2025-03-09 06:52:35,518 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:52:35" (1/1) ... [2025-03-09 06:52:35,519 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:52:35" (1/1) ... [2025-03-09 06:52:35,519 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:52:35" (1/1) ... [2025-03-09 06:52:35,520 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:52:35" (1/1) ... [2025-03-09 06:52:35,521 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:52:35,521 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:52:35,521 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:52:35,521 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:52:35,522 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:52:35" (1/1) ... [2025-03-09 06:52:35,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:35,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:35,546 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:52:35,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-09 06:52:35,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 06:52:35,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 06:52:35,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 06:52:35,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 06:52:35,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 06:52:35,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 06:52:35,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 06:52:35,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 06:52:35,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:52:35,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:52:35,632 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:52:35,633 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:52:35,711 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L548: call ULTIMATE.dealloc(main_#t~malloc2#1.base, main_#t~malloc2#1.offset);havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call ULTIMATE.dealloc(main_#t~malloc3#1.base, main_#t~malloc3#1.offset);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call ULTIMATE.dealloc(main_#t~malloc4#1.base, main_#t~malloc4#1.offset);havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; [2025-03-09 06:52:35,718 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2025-03-09 06:52:35,719 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:52:35,725 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:52:35,725 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 06:52:35,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:52:35 BoogieIcfgContainer [2025-03-09 06:52:35,725 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:52:35,726 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-09 06:52:35,726 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-09 06:52:35,730 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-09 06:52:35,731 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:52:35,731 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.03 06:52:35" (1/3) ... [2025-03-09 06:52:35,731 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@66f0fa0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 06:52:35, skipping insertion in model container [2025-03-09 06:52:35,731 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:52:35,731 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:52:35" (2/3) ... [2025-03-09 06:52:35,732 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@66f0fa0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 06:52:35, skipping insertion in model container [2025-03-09 06:52:35,732 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:52:35,732 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:52:35" (3/3) ... [2025-03-09 06:52:35,733 INFO L363 chiAutomizerObserver]: Analyzing ICFG BrockschmidtCookFuhs-2013CAV-Fig1-alloca-2.i [2025-03-09 06:52:35,763 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-09 06:52:35,764 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-09 06:52:35,764 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-09 06:52:35,764 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-09 06:52:35,764 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-09 06:52:35,764 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-09 06:52:35,764 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-09 06:52:35,764 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-09 06:52:35,768 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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-09 06:52:35,778 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-09 06:52:35,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:52:35,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:52:35,782 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-09 06:52:35,782 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-09 06:52:35,782 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-09 06:52:35,782 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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-09 06:52:35,783 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-09 06:52:35,783 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:52:35,783 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:52:35,783 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-09 06:52:35,783 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-09 06:52:35,787 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~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~nondet5#1;call write~int#0(main_#t~nondet5#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;call write~int#2(main_#t~nondet7#1, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~nondet7#1;" [2025-03-09 06:52:35,787 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem8#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~n~0#1.base, main_~n~0#1.offset, 4);" "assume main_#t~mem8#1 < main_#t~mem9#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int#1(0, main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume !true;" "call main_#t~mem13#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int#0(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1;" [2025-03-09 06:52:35,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:35,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1536, now seen corresponding path program 1 times [2025-03-09 06:52:35,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:52:35,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425972126] [2025-03-09 06:52:35,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:52:35,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:52:35,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:52:35,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:52:35,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:35,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:35,888 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:52:35,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:52:35,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:52:35,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:35,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:35,917 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:52:35,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:35,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1384154, now seen corresponding path program 1 times [2025-03-09 06:52:35,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:52:35,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283190466] [2025-03-09 06:52:35,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:52:35,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:52:35,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:52:35,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:52:35,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:35,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:52:35,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-09 06:52:35,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:52:35,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283190466] [2025-03-09 06:52:35,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283190466] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:52:35,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:52:35,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:52:35,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856028495] [2025-03-09 06:52:35,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:52:35,967 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 06:52:35,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:52:35,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 06:52:35,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 06:52:35,986 INFO L87 Difference]: Start difference. First operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 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) 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-09 06:52:35,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:52:35,989 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2025-03-09 06:52:35,989 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2025-03-09 06:52:35,990 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-09 06:52:35,993 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 7 states and 8 transitions. [2025-03-09 06:52:35,993 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-03-09 06:52:35,993 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-03-09 06:52:35,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2025-03-09 06:52:35,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:52:35,994 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions. [2025-03-09 06:52:36,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2025-03-09 06:52:36,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2025-03-09 06:52:36,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:52:36,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2025-03-09 06:52:36,010 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions. [2025-03-09 06:52:36,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 06:52:36,012 INFO L432 stractBuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2025-03-09 06:52:36,012 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-09 06:52:36,012 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2025-03-09 06:52:36,012 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-09 06:52:36,013 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:52:36,013 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:52:36,013 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-09 06:52:36,013 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-09 06:52:36,013 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~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~nondet5#1;call write~int#0(main_#t~nondet5#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;call write~int#2(main_#t~nondet7#1, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~nondet7#1;" [2025-03-09 06:52:36,013 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem8#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~n~0#1.base, main_~n~0#1.offset, 4);" "assume main_#t~mem8#1 < main_#t~mem9#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int#1(0, main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume true;call main_#t~mem10#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;" "call main_#t~mem13#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int#0(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1;" [2025-03-09 06:52:36,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:36,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1536, now seen corresponding path program 2 times [2025-03-09 06:52:36,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:52:36,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327389768] [2025-03-09 06:52:36,014 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:52:36,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:52:36,023 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:52:36,043 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:52:36,043 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:52:36,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:36,043 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:52:36,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:52:36,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:52:36,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:36,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:36,060 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:52:36,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:36,060 INFO L85 PathProgramCache]: Analyzing trace with hash 42907910, now seen corresponding path program 1 times [2025-03-09 06:52:36,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:52:36,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97227311] [2025-03-09 06:52:36,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:52:36,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:52:36,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:52:36,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:52:36,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:36,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:36,073 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:52:36,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:52:36,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:52:36,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:36,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:36,081 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:52:36,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:36,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1038981735, now seen corresponding path program 1 times [2025-03-09 06:52:36,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:52:36,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123212184] [2025-03-09 06:52:36,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:52:36,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:52:36,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:52:36,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:52:36,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:36,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:36,124 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:52:36,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:52:36,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:52:36,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:36,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:36,141 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:52:36,681 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:52:36,682 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:52:36,682 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:52:36,682 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:52:36,682 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:52:36,682 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:36,682 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:52:36,682 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:52:36,683 INFO L132 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-2013CAV-Fig1-alloca-2.i_Iteration2_Lasso [2025-03-09 06:52:36,683 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:52:36,683 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:52:36,693 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:36,698 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:37,072 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:37,074 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:37,076 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:37,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:37,080 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:37,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:37,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:37,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:37,088 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:37,090 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:37,092 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:37,094 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:37,391 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:52:37,395 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:52:37,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:37,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:37,399 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:52:37,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-09 06:52:37,401 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:52:37,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:37,412 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:37,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:37,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:37,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:37,415 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:37,415 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:37,420 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:37,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-03-09 06:52:37,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:37,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:37,428 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:52:37,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-09 06:52:37,430 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:52:37,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:37,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:37,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:37,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:37,445 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:52:37,445 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:52:37,449 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:37,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-03-09 06:52:37,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:37,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:37,458 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:52:37,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-09 06:52:37,461 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:52:37,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:37,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:37,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:37,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:37,475 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:52:37,475 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:52:37,479 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:37,485 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-09 06:52:37,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:37,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:37,487 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:52:37,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-09 06:52:37,490 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:52:37,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:37,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:37,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:37,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:37,505 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:52:37,508 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:52:37,514 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:37,521 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-09 06:52:37,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:37,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:37,523 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:52:37,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-09 06:52:37,526 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:52:37,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:37,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:37,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:37,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:37,538 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:52:37,539 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:52:37,542 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:37,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-03-09 06:52:37,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:37,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:37,551 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:52:37,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-09 06:52:37,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-09 06:52:37,562 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:37,562 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:37,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:37,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:37,564 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:52:37,564 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:52:37,568 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:37,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-03-09 06:52:37,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:37,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:37,576 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:52:37,578 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:52:37,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-09 06:52:37,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:37,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:37,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:37,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:37,596 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:52:37,596 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:52:37,618 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:37,623 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-09 06:52:37,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:37,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:37,626 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:52:37,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-09 06:52:37,629 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:52:37,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:37,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:37,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:37,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:37,645 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:52:37,645 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:52:37,649 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:37,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-03-09 06:52:37,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:37,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:37,657 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:52:37,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-09 06:52:37,659 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:52:37,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:37,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:37,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:37,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:37,676 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:52:37,676 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:52:37,683 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:52:37,694 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-03-09 06:52:37,697 INFO L444 ModelExtractionUtils]: 13 out of 19 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-03-09 06:52:37,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:37,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:37,700 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:52:37,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-09 06:52:37,702 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:52:37,715 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:52:37,716 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:52:37,716 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~i~0#1.base) 0)_1) = -1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~i~0#1.base) 0)_1 Supporting invariants [] [2025-03-09 06:52:37,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-03-09 06:52:37,770 INFO L156 tatePredicateManager]: 22 out of 23 supporting invariants were superfluous and have been removed [2025-03-09 06:52:37,776 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-09 06:52:37,777 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-09 06:52:37,777 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~i~0!base,]]] [2025-03-09 06:52:37,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:37,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:52:37,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:52:37,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:37,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:52:37,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:52:37,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:52:37,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:52:37,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:52:37,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:37,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:52:37,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 06:52:37,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:52:37,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 06:52:37,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:52:37,926 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2025-03-09 06:52:37,927 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:52:38,041 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 21 states and 26 transitions. Complement of second has 10 states. [2025-03-09 06:52:38,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2025-03-09 06:52:38,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:52:38,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2025-03-09 06:52:38,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 2 letters. Loop has 5 letters. [2025-03-09 06:52:38,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:52:38,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 7 letters. Loop has 5 letters. [2025-03-09 06:52:38,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:52:38,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 2 letters. Loop has 10 letters. [2025-03-09 06:52:38,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:52:38,052 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2025-03-09 06:52:38,052 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-09 06:52:38,053 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 20 states and 25 transitions. [2025-03-09 06:52:38,053 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-09 06:52:38,053 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-09 06:52:38,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 25 transitions. [2025-03-09 06:52:38,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:52:38,054 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 25 transitions. [2025-03-09 06:52:38,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 25 transitions. [2025-03-09 06:52:38,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2025-03-09 06:52:38,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:52:38,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2025-03-09 06:52:38,055 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 24 transitions. [2025-03-09 06:52:38,055 INFO L432 stractBuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2025-03-09 06:52:38,055 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-09 06:52:38,056 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2025-03-09 06:52:38,056 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-09 06:52:38,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:52:38,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:52:38,057 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-09 06:52:38,057 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2025-03-09 06:52:38,057 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~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~nondet5#1;call write~int#0(main_#t~nondet5#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;call write~int#2(main_#t~nondet7#1, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~nondet7#1;" "assume true;call main_#t~mem8#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~n~0#1.base, main_~n~0#1.offset, 4);" [2025-03-09 06:52:38,057 INFO L754 eck$LassoCheckResult]: Loop: "assume main_#t~mem8#1 < main_#t~mem9#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int#1(0, main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume true;call main_#t~mem10#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem10#1 <= main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1;" "assume true;call main_#t~mem10#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;" "call main_#t~mem13#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int#0(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1;" "assume true;call main_#t~mem8#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~n~0#1.base, main_~n~0#1.offset, 4);" [2025-03-09 06:52:38,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:38,057 INFO L85 PathProgramCache]: Analyzing trace with hash 47631, now seen corresponding path program 1 times [2025-03-09 06:52:38,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:52:38,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137484749] [2025-03-09 06:52:38,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:52:38,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:52:38,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:52:38,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:52:38,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:38,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:38,075 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:52:38,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:52:38,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:52:38,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:38,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:38,082 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:52:38,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:38,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1548285493, now seen corresponding path program 1 times [2025-03-09 06:52:38,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:52:38,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936347050] [2025-03-09 06:52:38,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:52:38,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:52:38,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:52:38,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:52:38,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:38,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:38,098 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:52:38,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:52:38,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:52:38,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:38,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:38,108 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:52:38,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:38,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1523355545, now seen corresponding path program 1 times [2025-03-09 06:52:38,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:52:38,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461346649] [2025-03-09 06:52:38,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:52:38,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:52:38,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 06:52:38,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 06:52:38,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:38,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:38,136 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:52:38,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 06:52:38,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 06:52:38,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:38,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:38,156 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:52:38,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-03-09 06:52:38,732 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:52:38,732 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:52:38,732 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:52:38,732 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:52:38,732 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:52:38,732 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:38,732 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:52:38,732 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:52:38,732 INFO L132 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-2013CAV-Fig1-alloca-2.i_Iteration3_Lasso [2025-03-09 06:52:38,732 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:52:38,732 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:52:38,734 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:38,737 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:38,985 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:38,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:38,992 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:38,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:38,996 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:38,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:38,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:39,000 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:39,002 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:39,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:39,238 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:52:39,238 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:52:39,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:39,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:39,241 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:52:39,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-03-09 06:52:39,243 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:52:39,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:39,253 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:39,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:39,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:39,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:39,253 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:39,253 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:39,254 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:39,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-03-09 06:52:39,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:39,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:39,262 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:52:39,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-03-09 06:52:39,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-09 06:52:39,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:39,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:39,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:39,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:39,274 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:52:39,274 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:52:39,278 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:39,284 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-09 06:52:39,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:39,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:39,286 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:52:39,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-03-09 06:52:39,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-09 06:52:39,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:39,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:39,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:39,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:39,301 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:52:39,301 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:52:39,307 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:52:39,325 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2025-03-09 06:52:39,325 INFO L444 ModelExtractionUtils]: 4 out of 19 variables were initially zero. Simplification set additionally 8 variables to zero. [2025-03-09 06:52:39,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:39,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:39,327 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:52:39,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-03-09 06:52:39,329 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:52:39,339 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2025-03-09 06:52:39,339 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:52:39,339 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#2 ULTIMATE.start_main_~n~0#1.base) ULTIMATE.start_main_~n~0#1.offset)_2, ULTIMATE.start_main_#t~mem8#1) = 1*v_rep(select (select #memory_int#2 ULTIMATE.start_main_~n~0#1.base) ULTIMATE.start_main_~n~0#1.offset)_2 - 1*ULTIMATE.start_main_#t~mem8#1 Supporting invariants [1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~i~0#1.base) ULTIMATE.start_main_~i~0#1.offset)_2 - 1*ULTIMATE.start_main_#t~mem8#1 >= 0, -1*ULTIMATE.start_main_#t~mem9#1 + 1*v_rep(select (select #memory_int#2 ULTIMATE.start_main_~n~0#1.base) ULTIMATE.start_main_~n~0#1.offset)_2 >= 0] [2025-03-09 06:52:39,344 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-09 06:52:39,398 INFO L156 tatePredicateManager]: 21 out of 23 supporting invariants were superfluous and have been removed [2025-03-09 06:52:39,402 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-03-09 06:52:39,402 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-03-09 06:52:39,402 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~n~0!base,]]] [2025-03-09 06:52:39,403 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~mem8 [2025-03-09 06:52:39,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:39,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:52:39,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:52:39,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:39,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:52:39,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:52:39,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:52:39,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:52:39,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:52:39,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:39,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:52:39,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 06:52:39,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:52:39,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 19 [2025-03-09 06:52:39,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 06:52:39,523 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-09 06:52:39,523 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:52:39,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-03-09 06:52:39,566 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 7. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 34 states and 42 transitions. Complement of second has 6 states. [2025-03-09 06:52:39,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-09 06:52:39,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:52:39,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2025-03-09 06:52:39,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 3 letters. Loop has 7 letters. [2025-03-09 06:52:39,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:52:39,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 10 letters. Loop has 7 letters. [2025-03-09 06:52:39,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:52:39,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 3 letters. Loop has 14 letters. [2025-03-09 06:52:39,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:52:39,569 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 42 transitions. [2025-03-09 06:52:39,569 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:52:39,570 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 24 states and 31 transitions. [2025-03-09 06:52:39,570 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-03-09 06:52:39,570 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-09 06:52:39,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 31 transitions. [2025-03-09 06:52:39,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:52:39,570 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 31 transitions. [2025-03-09 06:52:39,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 31 transitions. [2025-03-09 06:52:39,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2025-03-09 06:52:39,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:52:39,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2025-03-09 06:52:39,571 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 29 transitions. [2025-03-09 06:52:39,571 INFO L432 stractBuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2025-03-09 06:52:39,571 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-09 06:52:39,571 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 29 transitions. [2025-03-09 06:52:39,571 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:52:39,571 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:52:39,571 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:52:39,572 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-09 06:52:39,572 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:52:39,572 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~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~nondet5#1;call write~int#0(main_#t~nondet5#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;call write~int#2(main_#t~nondet7#1, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~nondet7#1;" "assume true;call main_#t~mem8#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~n~0#1.base, main_~n~0#1.offset, 4);" "assume main_#t~mem8#1 < main_#t~mem9#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int#1(0, main_~j~0#1.base, main_~j~0#1.offset, 4);" [2025-03-09 06:52:39,572 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem10#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem10#1 <= main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1;" [2025-03-09 06:52:39,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:39,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1476575, now seen corresponding path program 1 times [2025-03-09 06:52:39,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:52:39,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482037505] [2025-03-09 06:52:39,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:52:39,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:52:39,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:52:39,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:52:39,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:39,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:39,587 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:52:39,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:52:39,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:52:39,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:39,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:39,597 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:52:39,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:39,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 1 times [2025-03-09 06:52:39,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:52:39,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436271803] [2025-03-09 06:52:39,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:52:39,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:52:39,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:52:39,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:52:39,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:39,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:39,606 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:52:39,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:52:39,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:52:39,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:39,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:39,613 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:52:39,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:39,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1418988862, now seen corresponding path program 1 times [2025-03-09 06:52:39,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:52:39,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343018949] [2025-03-09 06:52:39,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:52:39,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:52:39,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:52:39,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:52:39,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:39,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:39,633 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:52:39,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:52:39,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:52:39,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:39,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:39,644 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:52:40,079 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:52:40,079 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:52:40,080 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:52:40,080 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:52:40,080 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:52:40,080 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:40,080 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:52:40,080 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:52:40,080 INFO L132 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-2013CAV-Fig1-alloca-2.i_Iteration4_Lasso [2025-03-09 06:52:40,080 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:52:40,080 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:52:40,081 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:40,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:40,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:40,088 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:40,090 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:40,091 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:40,092 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:40,291 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:40,294 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:40,295 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:40,297 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:40,298 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:40,300 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:40,301 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:40,476 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:52:40,476 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:52:40,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:40,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:40,478 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:52:40,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-03-09 06:52:40,480 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:52:40,490 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:40,490 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:40,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:40,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:40,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:40,490 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:40,490 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:40,491 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:40,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-03-09 06:52:40,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:40,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:40,498 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:52:40,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-03-09 06:52:40,499 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:52:40,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:40,509 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:40,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:40,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:40,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:40,509 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:40,509 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:40,510 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:40,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-03-09 06:52:40,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:40,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:40,517 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:52:40,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-03-09 06:52:40,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-09 06:52:40,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:40,527 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:40,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:40,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:40,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:40,528 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:40,529 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:40,529 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:40,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-03-09 06:52:40,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:40,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:40,536 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:52:40,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-03-09 06:52:40,538 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:52:40,547 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:40,547 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:40,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:40,547 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:40,548 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:52:40,548 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:52:40,550 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:40,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-03-09 06:52:40,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:40,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:40,557 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:52:40,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-03-09 06:52:40,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-09 06:52:40,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:40,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:40,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:40,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:40,569 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:52:40,569 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:52:40,571 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:40,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-03-09 06:52:40,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:40,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:40,578 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:52:40,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-03-09 06:52:40,580 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:52:40,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:40,590 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:40,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:40,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:40,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:40,590 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:40,590 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:40,591 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:40,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-03-09 06:52:40,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:40,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:40,598 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:52:40,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-03-09 06:52:40,600 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:52:40,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:40,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:40,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:40,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:40,611 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:52:40,611 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:52:40,615 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:40,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-03-09 06:52:40,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:40,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:40,622 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:52:40,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-03-09 06:52:40,623 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:52:40,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:40,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:40,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:40,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:40,636 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:52:40,636 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:52:40,641 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:52:40,657 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2025-03-09 06:52:40,657 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-03-09 06:52:40,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:40,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:40,659 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:52:40,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-03-09 06:52:40,660 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:52:40,671 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-03-09 06:52:40,671 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:52:40,671 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 ULTIMATE.start_main_~j~0#1.base) ULTIMATE.start_main_~j~0#1.offset)_3, v_rep(select (select #memory_int#2 ULTIMATE.start_main_~n~0#1.base) ULTIMATE.start_main_~n~0#1.offset)_3) = -1*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~j~0#1.base) ULTIMATE.start_main_~j~0#1.offset)_3 + 1*v_rep(select (select #memory_int#2 ULTIMATE.start_main_~n~0#1.base) ULTIMATE.start_main_~n~0#1.offset)_3 Supporting invariants [-2*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~i~0#1.base) 0)_2 + 2*v_rep(select (select #memory_int#2 ULTIMATE.start_main_~n~0#1.base) ULTIMATE.start_main_~n~0#1.offset)_3 - 1 >= 0] [2025-03-09 06:52:40,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-03-09 06:52:40,721 INFO L156 tatePredicateManager]: 20 out of 22 supporting invariants were superfluous and have been removed [2025-03-09 06:52:40,725 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-03-09 06:52:40,725 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-03-09 06:52:40,726 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~n~0!base,]]] [2025-03-09 06:52:40,726 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-09 06:52:40,726 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-09 06:52:40,726 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~j~0!base,]]] [2025-03-09 06:52:40,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:40,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:52:40,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:52:40,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:40,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:52:40,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 06:52:40,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:52:40,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 06:52:40,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:52:40,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:52:40,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:40,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:52:40,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 06:52:40,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:52:40,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:52:40,825 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2025-03-09 06:52:40,825 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 29 transitions. cyclomatic complexity: 10 Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:52:40,855 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-09 06:52:40,873 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 29 transitions. cyclomatic complexity: 10. Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 46 states and 58 transitions. Complement of second has 9 states. [2025-03-09 06:52:40,874 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-09 06:52:40,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:52:40,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2025-03-09 06:52:40,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 4 letters. Loop has 2 letters. [2025-03-09 06:52:40,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:52:40,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 6 letters. Loop has 2 letters. [2025-03-09 06:52:40,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:52:40,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 4 letters. Loop has 4 letters. [2025-03-09 06:52:40,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:52:40,876 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 58 transitions. [2025-03-09 06:52:40,877 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:52:40,878 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 38 states and 48 transitions. [2025-03-09 06:52:40,878 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-03-09 06:52:40,878 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-03-09 06:52:40,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 48 transitions. [2025-03-09 06:52:40,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:52:40,878 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 48 transitions. [2025-03-09 06:52:40,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 48 transitions. [2025-03-09 06:52:40,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 33. [2025-03-09 06:52:40,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.303030303030303) internal successors, (43), 32 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:52:40,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2025-03-09 06:52:40,881 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 43 transitions. [2025-03-09 06:52:40,882 INFO L432 stractBuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2025-03-09 06:52:40,882 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-09 06:52:40,882 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 43 transitions. [2025-03-09 06:52:40,882 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:52:40,882 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:52:40,882 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:52:40,882 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2025-03-09 06:52:40,882 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:52:40,883 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~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~nondet5#1;call write~int#0(main_#t~nondet5#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;call write~int#1(main_#t~nondet6#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;call write~int#2(main_#t~nondet7#1, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~nondet7#1;" "assume true;call main_#t~mem8#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~n~0#1.base, main_~n~0#1.offset, 4);" "assume main_#t~mem8#1 < main_#t~mem9#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int#1(0, main_~j~0#1.base, main_~j~0#1.offset, 4);" "assume true;call main_#t~mem10#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;" "call main_#t~mem13#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int#0(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1;" "assume true;call main_#t~mem8#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int#2(main_~n~0#1.base, main_~n~0#1.offset, 4);" "assume main_#t~mem8#1 < main_#t~mem9#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int#1(0, main_~j~0#1.base, main_~j~0#1.offset, 4);" [2025-03-09 06:52:40,883 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem10#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);" "assume main_#t~mem10#1 <= main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1;" [2025-03-09 06:52:40,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:40,883 INFO L85 PathProgramCache]: Analyzing trace with hash 2029035142, now seen corresponding path program 2 times [2025-03-09 06:52:40,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:52:40,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921354458] [2025-03-09 06:52:40,883 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:52:40,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:52:40,893 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-03-09 06:52:40,905 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:52:40,906 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:52:40,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:40,906 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:52:40,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:52:40,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:52:40,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:40,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:40,919 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:52:40,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:40,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 2 times [2025-03-09 06:52:40,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:52:40,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972615589] [2025-03-09 06:52:40,920 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:52:40,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:52:40,922 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:52:40,924 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:52:40,924 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:52:40,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:40,924 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:52:40,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:52:40,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:52:40,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:40,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:40,928 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:52:40,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:40,929 INFO L85 PathProgramCache]: Analyzing trace with hash -12380635, now seen corresponding path program 2 times [2025-03-09 06:52:40,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:52:40,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942324304] [2025-03-09 06:52:40,929 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:52:40,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:52:40,935 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-09 06:52:40,949 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 06:52:40,949 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:52:40,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:40,949 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:52:40,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 06:52:40,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 06:52:40,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:40,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:40,962 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:52:41,691 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:52:41,691 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:52:41,691 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:52:41,691 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:52:41,691 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:52:41,691 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:41,691 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:52:41,691 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:52:41,691 INFO L132 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-2013CAV-Fig1-alloca-2.i_Iteration5_Lasso [2025-03-09 06:52:41,691 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:52:41,691 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:52:41,692 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:41,864 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:41,866 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:41,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:41,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:41,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:41,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:41,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:41,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:41,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:41,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:41,882 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:41,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:41,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:42,047 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:52:42,047 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:52:42,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:42,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:42,049 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:52:42,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-03-09 06:52:42,051 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:52:42,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:42,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:42,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:42,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:42,061 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:52:42,061 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:52:42,063 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:42,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-03-09 06:52:42,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:42,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:42,070 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:52:42,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-03-09 06:52:42,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:52:42,082 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:42,082 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:42,082 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:42,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:42,083 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:52:42,083 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:52:42,087 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:42,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-03-09 06:52:42,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:42,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:42,095 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:52:42,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-03-09 06:52:42,097 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:52:42,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:42,106 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:42,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:42,106 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:42,108 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:52:42,108 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:52:42,111 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:42,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-03-09 06:52:42,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:42,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:42,118 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:52:42,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-03-09 06:52:42,120 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:52:42,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:42,130 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:42,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:42,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:42,134 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:52:42,134 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:52:42,139 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:42,145 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-09 06:52:42,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:42,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:42,146 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:52:42,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-03-09 06:52:42,148 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:52:42,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:42,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:42,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:42,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:42,159 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:52:42,159 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:52:42,162 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:42,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-03-09 06:52:42,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:42,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:42,169 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:52:42,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-03-09 06:52:42,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-09 06:52:42,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:42,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:42,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:42,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:42,183 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:52:42,183 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:52:42,187 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:42,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-03-09 06:52:42,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:42,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:42,194 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-09 06:52:42,194 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-09 06:52:42,196 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:52:42,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:42,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:42,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:42,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:42,206 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:52:42,206 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:52:42,210 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:42,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-03-09 06:52:42,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:42,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:42,217 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:52:42,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-03-09 06:52:42,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-09 06:52:42,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:42,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:42,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:42,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:42,230 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:52:42,230 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:52:42,234 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:52:42,237 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-03-09 06:52:42,237 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-09 06:52:42,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:42,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:42,239 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:52:42,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-03-09 06:52:42,241 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:52:42,251 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:52:42,251 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:52:42,251 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~i~0#1.base) ULTIMATE.start_main_~i~0#1.offset)_4, v_rep(select (select #memory_int#1 ULTIMATE.start_main_~j~0#1.base) ULTIMATE.start_main_~j~0#1.offset)_4) = 2*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~i~0#1.base) ULTIMATE.start_main_~i~0#1.offset)_4 - 2*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~j~0#1.base) ULTIMATE.start_main_~j~0#1.offset)_4 + 1 Supporting invariants [] [2025-03-09 06:52:42,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-03-09 06:52:42,295 INFO L156 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2025-03-09 06:52:42,296 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-09 06:52:42,297 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-09 06:52:42,297 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~i~0!base,]]] [2025-03-09 06:52:42,297 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-09 06:52:42,297 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-09 06:52:42,297 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~j~0!base,]]] [2025-03-09 06:52:42,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:42,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:52:42,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:52:42,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:42,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:52:42,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:52:42,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:52:42,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:52:42,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:52:42,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:42,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:52:42,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 06:52:42,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:52:42,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:52:42,353 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-09 06:52:42,353 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 43 transitions. cyclomatic complexity: 15 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:52:42,368 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 43 transitions. cyclomatic complexity: 15. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 44 states and 56 transitions. Complement of second has 7 states. [2025-03-09 06:52:42,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-09 06:52:42,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:52:42,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-09 06:52:42,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 9 letters. Loop has 2 letters. [2025-03-09 06:52:42,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:52:42,369 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:52:42,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:42,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:52:42,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:52:42,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:42,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:52:42,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:52:42,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:52:42,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:52:42,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:52:42,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:42,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:52:42,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 06:52:42,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:52:42,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:52:42,430 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-09 06:52:42,430 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 43 transitions. cyclomatic complexity: 15 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:52:42,446 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 43 transitions. cyclomatic complexity: 15. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 44 states and 56 transitions. Complement of second has 7 states. [2025-03-09 06:52:42,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-09 06:52:42,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:52:42,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2025-03-09 06:52:42,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 9 letters. Loop has 2 letters. [2025-03-09 06:52:42,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:52:42,449 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:52:42,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:42,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:52:42,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-03-09 06:52:42,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:52:42,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:42,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:52:42,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:52:42,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:52:42,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:52:42,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:52:42,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:42,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:52:42,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 06:52:42,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:52:42,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:52:42,529 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-09 06:52:42,529 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 43 transitions. cyclomatic complexity: 15 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:52:42,546 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 43 transitions. cyclomatic complexity: 15. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 47 states and 63 transitions. Complement of second has 6 states. [2025-03-09 06:52:42,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-09 06:52:42,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:52:42,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2025-03-09 06:52:42,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 2 letters. [2025-03-09 06:52:42,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:52:42,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 11 letters. Loop has 2 letters. [2025-03-09 06:52:42,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:52:42,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 4 letters. [2025-03-09 06:52:42,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:52:42,548 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 63 transitions. [2025-03-09 06:52:42,549 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-09 06:52:42,549 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 0 states and 0 transitions. [2025-03-09 06:52:42,549 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-09 06:52:42,549 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-09 06:52:42,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-09 06:52:42,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:52:42,549 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 06:52:42,549 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 06:52:42,549 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 06:52:42,549 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-09 06:52:42,549 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-09 06:52:42,550 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-09 06:52:42,550 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-09 06:52:42,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.03 06:52:42 BoogieIcfgContainer [2025-03-09 06:52:42,555 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-09 06:52:42,556 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 06:52:42,556 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 06:52:42,556 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 06:52:42,556 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:52:35" (3/4) ... [2025-03-09 06:52:42,557 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 06:52:42,558 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 06:52:42,558 INFO L158 Benchmark]: Toolchain (without parser) took 7356.02ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 116.5MB in the beginning and 132.2MB in the end (delta: -15.6MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. [2025-03-09 06:52:42,558 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 226.5MB. Free memory is still 147.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:52:42,559 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.59ms. Allocated memory is still 142.6MB. Free memory was 116.5MB in the beginning and 100.8MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 06:52:42,559 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.51ms. Allocated memory is still 142.6MB. Free memory was 100.3MB in the beginning and 99.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:52:42,559 INFO L158 Benchmark]: Boogie Preprocessor took 23.21ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 97.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:52:42,559 INFO L158 Benchmark]: IcfgBuilder took 204.33ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 85.1MB in the end (delta: 12.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 06:52:42,559 INFO L158 Benchmark]: BuchiAutomizer took 6828.98ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 85.1MB in the beginning and 133.9MB in the end (delta: -48.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:52:42,559 INFO L158 Benchmark]: Witness Printer took 2.28ms. Allocated memory is still 176.2MB. Free memory was 132.2MB in the beginning and 132.2MB in the end (delta: 33.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:52:42,560 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 226.5MB. Free memory is still 147.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 266.59ms. Allocated memory is still 142.6MB. Free memory was 116.5MB in the beginning and 100.8MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.51ms. Allocated memory is still 142.6MB. Free memory was 100.3MB in the beginning and 99.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.21ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 97.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 204.33ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 85.1MB in the end (delta: 12.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 6828.98ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 85.1MB in the beginning and 133.9MB in the end (delta: -48.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.28ms. Allocated memory is still 176.2MB. Free memory was 132.2MB in the beginning and 132.2MB in the end (delta: 33.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~i~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~n~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~mem8 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~n~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~j~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~i~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~j~0!base,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (1 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function null and consists of 6 locations. One deterministic module has affine ranking function null and consists of 4 locations. One deterministic module has affine ranking function null and consists of 6 locations. One nondeterministic module has affine ranking function null and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 2 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.7s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 5.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/2 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 43 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 40 mSDsluCounter, 51 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 73 IncrementalHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 38 mSDtfsCounter, 73 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital243 mio100 ax107 hnf100 lsp93 ukn65 mio100 lsp24 div100 bol100 ite100 ukn100 eq169 hnf89 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-03-09 06:52:42,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE