./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex3.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex3.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 33d006375056e7e3c58d58b776bed0fedce081ec4ff9e691f038a741177fe7dd --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 19:08:45,554 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 19:08:45,614 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-02-06 19:08:45,621 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 19:08:45,622 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 19:08:45,622 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-06 19:08:45,644 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 19:08:45,646 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 19:08:45,646 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 19:08:45,646 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 19:08:45,647 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 19:08:45,647 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 19:08:45,647 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 19:08:45,648 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 19:08:45,648 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-06 19:08:45,648 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-06 19:08:45,648 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-06 19:08:45,648 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-06 19:08:45,648 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-06 19:08:45,649 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-06 19:08:45,649 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 19:08:45,649 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-06 19:08:45,649 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 19:08:45,649 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 19:08:45,649 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-06 19:08:45,649 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-06 19:08:45,649 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-06 19:08:45,649 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 19:08:45,649 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 19:08:45,649 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-06 19:08:45,649 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 19:08:45,649 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 19:08:45,650 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 19:08:45,650 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 19:08:45,650 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 19:08:45,650 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 19:08:45,651 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-06 19:08:45,651 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-jdk21/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 -> 33d006375056e7e3c58d58b776bed0fedce081ec4ff9e691f038a741177fe7dd [2025-02-06 19:08:45,843 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 19:08:45,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 19:08:45,853 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 19:08:45,854 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 19:08:45,855 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 19:08:45,856 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex3.i [2025-02-06 19:08:46,949 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ae1d2c8da/c87d635aef31453b9f16f4e9c7c6c5a2/FLAG9758edd82 [2025-02-06 19:08:47,168 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 19:08:47,168 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex3.i [2025-02-06 19:08:47,178 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ae1d2c8da/c87d635aef31453b9f16f4e9c7c6c5a2/FLAG9758edd82 [2025-02-06 19:08:47,531 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ae1d2c8da/c87d635aef31453b9f16f4e9c7c6c5a2 [2025-02-06 19:08:47,534 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 19:08:47,535 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 19:08:47,537 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 19:08:47,537 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 19:08:47,541 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 19:08:47,542 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:08:47" (1/1) ... [2025-02-06 19:08:47,543 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19203cdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:47, skipping insertion in model container [2025-02-06 19:08:47,543 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:08:47" (1/1) ... [2025-02-06 19:08:47,555 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 19:08:47,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:08:47,656 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 19:08:47,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:08:47,673 INFO L204 MainTranslator]: Completed translation [2025-02-06 19:08:47,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:47 WrapperNode [2025-02-06 19:08:47,674 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 19:08:47,675 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 19:08:47,675 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 19:08:47,675 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 19:08:47,679 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:47" (1/1) ... [2025-02-06 19:08:47,682 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:47" (1/1) ... [2025-02-06 19:08:47,690 INFO L138 Inliner]: procedures = 11, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 18 [2025-02-06 19:08:47,691 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 19:08:47,692 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 19:08:47,692 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 19:08:47,692 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 19:08:47,696 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:47" (1/1) ... [2025-02-06 19:08:47,696 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:47" (1/1) ... [2025-02-06 19:08:47,697 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:47" (1/1) ... [2025-02-06 19:08:47,703 INFO L175 MemorySlicer]: Split 5 memory accesses to 1 slices as follows [5]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2025-02-06 19:08:47,704 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:47" (1/1) ... [2025-02-06 19:08:47,704 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:47" (1/1) ... [2025-02-06 19:08:47,706 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:47" (1/1) ... [2025-02-06 19:08:47,706 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:47" (1/1) ... [2025-02-06 19:08:47,706 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:47" (1/1) ... [2025-02-06 19:08:47,707 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:47" (1/1) ... [2025-02-06 19:08:47,707 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 19:08:47,708 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 19:08:47,708 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 19:08:47,708 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 19:08:47,710 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:47" (1/1) ... [2025-02-06 19:08:47,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:47,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:47,734 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:08:47,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-02-06 19:08:47,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 19:08:47,757 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2025-02-06 19:08:47,757 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2025-02-06 19:08:47,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 19:08:47,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 19:08:47,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 19:08:47,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 19:08:47,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 19:08:47,799 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 19:08:47,801 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 19:08:47,851 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L15: havoc #t~ret5; [2025-02-06 19:08:47,851 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9: havoc ~pv~0; [2025-02-06 19:08:47,890 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-02-06 19:08:47,891 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 19:08:47,896 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 19:08:47,896 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 19:08:47,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:08:47 BoogieIcfgContainer [2025-02-06 19:08:47,896 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 19:08:47,897 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-06 19:08:47,897 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-06 19:08:47,900 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-06 19:08:47,901 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:08:47,901 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.02 07:08:47" (1/3) ... [2025-02-06 19:08:47,901 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@49e85726 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:08:47, skipping insertion in model container [2025-02-06 19:08:47,901 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:08:47,901 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:47" (2/3) ... [2025-02-06 19:08:47,902 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@49e85726 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:08:47, skipping insertion in model container [2025-02-06 19:08:47,902 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:08:47,902 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:08:47" (3/3) ... [2025-02-06 19:08:47,902 INFO L363 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex3.i [2025-02-06 19:08:47,932 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-06 19:08:47,936 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-06 19:08:47,936 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-06 19:08:47,936 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-06 19:08:47,936 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-06 19:08:47,936 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-06 19:08:47,937 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-06 19:08:47,937 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-06 19:08:47,941 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 19:08:47,953 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2025-02-06 19:08:47,954 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:08:47,954 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:08:47,957 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-06 19:08:47,957 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:08:47,957 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-06 19:08:47,957 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 19:08:47,958 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2025-02-06 19:08:47,958 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:08:47,958 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:08:47,958 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-06 19:08:47,958 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:08:47,961 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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~ret9#1, main_~op~0#1.base, main_~op~0#1.offset, main_~i~0#1;havoc main_#t~nondet6#1;main_~i~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" [2025-02-06 19:08:47,962 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 > 0;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~nondet8#1;call write~int#0(main_#t~nondet8#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~nondet8#1;" "call main_#t~ret9#1 := rec(main_~op~0#1.base, main_~op~0#1.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int#0(~p.base, ~p.offset, 4);" "assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int#0(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0;" "assume true;" >"#20#return;" "main_~i~0#1 := main_~i~0#1 + main_#t~ret9#1;havoc main_~op~0#1.base, main_~op~0#1.offset;havoc main_#t~ret9#1;" [2025-02-06 19:08:47,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:47,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1440, now seen corresponding path program 1 times [2025-02-06 19:08:47,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:47,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827392287] [2025-02-06 19:08:47,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:47,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:48,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:08:48,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:08:48,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:48,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:48,018 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:48,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:08:48,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:08:48,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:48,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:48,028 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:48,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:48,030 INFO L85 PathProgramCache]: Analyzing trace with hash 58528408, now seen corresponding path program 1 times [2025-02-06 19:08:48,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:48,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477817380] [2025-02-06 19:08:48,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:48,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:48,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:08:48,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:08:48,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:48,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:48,068 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:48,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:08:48,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:08:48,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:48,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:48,093 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:48,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:48,096 INFO L85 PathProgramCache]: Analyzing trace with hash -298300391, now seen corresponding path program 1 times [2025-02-06 19:08:48,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:48,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322114030] [2025-02-06 19:08:48,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:48,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:48,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 19:08:48,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 19:08:48,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:48,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:48,112 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:48,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 19:08:48,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 19:08:48,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:48,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:48,122 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:48,537 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:08:48,537 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:08:48,538 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:08:48,538 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:08:48,538 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:08:48,538 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:48,538 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:08:48,538 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:08:48,538 INFO L132 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3.i_Iteration1_Lasso [2025-02-06 19:08:48,538 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:08:48,538 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:08:48,548 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:48,561 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:48,563 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:48,565 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:48,567 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:48,569 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:48,598 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:48,600 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:48,602 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:48,668 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:08:48,670 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:08:48,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:48,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:48,673 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:08:48,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-02-06 19:08:48,676 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:48,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:48,687 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:48,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:48,687 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:48,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:48,690 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:48,690 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:48,692 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:48,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-02-06 19:08:48,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:48,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:48,699 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:08:48,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-02-06 19:08:48,702 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:48,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:48,712 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:48,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:48,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:48,712 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:48,713 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:48,713 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:48,714 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:48,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-02-06 19:08:48,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:48,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:48,722 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:08:48,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-02-06 19:08:48,725 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:48,735 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:48,735 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:48,735 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:48,735 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:48,735 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:48,737 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:48,737 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:48,738 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:48,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-02-06 19:08:48,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:48,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:48,747 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:08:48,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-02-06 19:08:48,750 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:48,759 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:48,760 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:48,760 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:48,760 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:48,760 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:48,760 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:48,760 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:48,761 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:48,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-02-06 19:08:48,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:48,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:48,770 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:08:48,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-02-06 19:08:48,772 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:48,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:48,783 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:48,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:48,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:48,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:48,783 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:48,783 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:48,785 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:48,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-02-06 19:08:48,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:48,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:48,792 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:08:48,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-02-06 19:08:48,793 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:48,803 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:48,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:48,803 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-06 19:08:48,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:48,819 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-02-06 19:08:48,821 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-02-06 19:08:48,839 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:48,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-02-06 19:08:48,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:48,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:48,849 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:08:48,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-02-06 19:08:48,855 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:48,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:48,865 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:48,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:48,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:48,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:48,869 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:48,869 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:48,874 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:08:48,887 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-06 19:08:48,888 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-06 19:08:48,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:48,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:48,894 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:08:48,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-02-06 19:08:48,898 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:08:48,898 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-06 19:08:48,898 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:08:48,899 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2025-02-06 19:08:48,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-02-06 19:08:48,908 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-06 19:08:48,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:48,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:08:48,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:08:48,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:48,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:48,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:08:48,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:48,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:08:48,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:08:48,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:48,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:48,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 19:08:48,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:49,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 17 treesize of output 9 [2025-02-06 19:08:49,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:08:49,098 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2025-02-06 19:08:49,099 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 19:08:49,247 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2). Second operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Result 60 states and 72 transitions. Complement of second has 19 states. [2025-02-06 19:08:49,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2025-02-06 19:08:49,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 19:08:49,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 17 transitions. [2025-02-06 19:08:49,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 17 transitions. Stem has 2 letters. Loop has 7 letters. [2025-02-06 19:08:49,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:08:49,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 17 transitions. Stem has 9 letters. Loop has 7 letters. [2025-02-06 19:08:49,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:08:49,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 17 transitions. Stem has 2 letters. Loop has 14 letters. [2025-02-06 19:08:49,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:08:49,273 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 72 transitions. [2025-02-06 19:08:49,275 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2025-02-06 19:08:49,283 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 38 states and 45 transitions. [2025-02-06 19:08:49,289 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2025-02-06 19:08:49,289 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2025-02-06 19:08:49,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 45 transitions. [2025-02-06 19:08:49,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:08:49,290 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 45 transitions. [2025-02-06 19:08:49,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 45 transitions. [2025-02-06 19:08:49,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2025-02-06 19:08:49,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 19:08:49,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2025-02-06 19:08:49,324 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35 states and 41 transitions. [2025-02-06 19:08:49,324 INFO L432 stractBuchiCegarLoop]: Abstraction has 35 states and 41 transitions. [2025-02-06 19:08:49,324 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-06 19:08:49,324 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 41 transitions. [2025-02-06 19:08:49,328 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2025-02-06 19:08:49,329 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:08:49,329 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:08:49,329 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:08:49,329 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-06 19:08:49,329 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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~ret9#1, main_~op~0#1.base, main_~op~0#1.offset, main_~i~0#1;havoc main_#t~nondet6#1;main_~i~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" "assume main_~i~0#1 > 0;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~nondet8#1;call write~int#0(main_#t~nondet8#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~nondet8#1;" "call main_#t~ret9#1 := rec(main_~op~0#1.base, main_~op~0#1.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int#0(~p.base, ~p.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;" "call #t~mem3 := read~int#0(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int#0(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~mem3;havoc #t~post4;" "call #t~ret5 := rec(~p.base, ~p.offset);"< [2025-02-06 19:08:49,330 INFO L754 eck$LassoCheckResult]: Loop: "~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int#0(~p.base, ~p.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;" "call #t~mem3 := read~int#0(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int#0(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~mem3;havoc #t~post4;" "call #t~ret5 := rec(~p.base, ~p.offset);"< [2025-02-06 19:08:49,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:49,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1533642444, now seen corresponding path program 1 times [2025-02-06 19:08:49,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:49,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022465156] [2025-02-06 19:08:49,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:49,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:49,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 19:08:49,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 19:08:49,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:49,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:49,365 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:49,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 19:08:49,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 19:08:49,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:49,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:49,393 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:49,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:49,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1137934, now seen corresponding path program 1 times [2025-02-06 19:08:49,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:49,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657835533] [2025-02-06 19:08:49,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:49,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:49,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:08:49,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:08:49,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:49,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:49,414 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:49,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:08:49,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:08:49,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:49,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:49,423 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:49,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:49,431 INFO L85 PathProgramCache]: Analyzing trace with hash 361891009, now seen corresponding path program 2 times [2025-02-06 19:08:49,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:49,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063700453] [2025-02-06 19:08:49,431 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:08:49,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:49,436 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-02-06 19:08:49,466 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 19:08:49,470 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:08:49,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:49,471 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:49,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 19:08:49,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 19:08:49,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:49,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:49,502 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:49,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-02-06 19:08:50,167 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:08:50,167 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:08:50,167 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:08:50,167 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:08:50,167 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:08:50,167 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:50,167 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:08:50,167 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:08:50,167 INFO L132 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3.i_Iteration2_Lasso [2025-02-06 19:08:50,167 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:08:50,167 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:08:50,170 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:50,174 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:50,176 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:50,178 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:50,179 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:50,362 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:50,364 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:50,365 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:50,367 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:50,369 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:50,370 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:50,371 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:50,373 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:50,374 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:50,376 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:50,377 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:50,379 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:50,380 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:50,382 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:50,558 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:08:50,558 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:08:50,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:50,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:50,564 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:08:50,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-02-06 19:08:50,573 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:50,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:50,583 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:50,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:50,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:50,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:50,584 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:50,584 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:50,587 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:50,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-02-06 19:08:50,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:50,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:50,602 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:08:50,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-02-06 19:08:50,606 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:50,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:50,616 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:50,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:50,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:50,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:50,617 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:50,617 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:50,618 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:50,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-02-06 19:08:50,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:50,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:50,626 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:08:50,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-02-06 19:08:50,628 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:50,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:50,639 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:50,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:50,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:50,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:50,640 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:50,640 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:50,645 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:50,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-02-06 19:08:50,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:50,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:50,658 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:08:50,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-02-06 19:08:50,662 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:50,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:50,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:50,673 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:50,673 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:50,675 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:08:50,675 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:50,678 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:50,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-02-06 19:08:50,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:50,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:50,689 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:08:50,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-02-06 19:08:50,692 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:50,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:50,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:50,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:50,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:50,705 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:08:50,705 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:50,708 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:50,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-02-06 19:08:50,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:50,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:50,718 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:08:50,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-02-06 19:08:50,721 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:50,731 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:50,732 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-02-06 19:08:50,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:50,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:50,736 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-02-06 19:08:50,736 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:50,744 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:50,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-02-06 19:08:50,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:50,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:50,758 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:08:50,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-02-06 19:08:50,761 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:50,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:50,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:50,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:50,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:50,781 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:08:50,781 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:50,788 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:08:50,813 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2025-02-06 19:08:50,813 INFO L444 ModelExtractionUtils]: 2 out of 16 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-02-06 19:08:50,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:50,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:50,815 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:08:50,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-02-06 19:08:50,818 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:08:50,830 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2025-02-06 19:08:50,830 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:08:50,830 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select old(#memory_int#0) rec_#in~p.base) rec_#in~p.offset)_1) = 2*v_rep(select (select old(#memory_int#0) rec_#in~p.base) rec_#in~p.offset)_1 + 3 Supporting invariants [-1*v_rep(select (select #memory_int#0 rec_#in~p.base) 0)_1 + 1*v_rep(select (select old(#memory_int#0) rec_#in~p.base) rec_#in~p.offset)_1 >= 0, 1*v_rep(select (select old(#memory_int#0) rec_#in~p.base) rec_#in~p.offset)_1 + 1 >= 0] [2025-02-06 19:08:50,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-02-06 19:08:50,849 INFO L156 tatePredicateManager]: 2 out of 4 supporting invariants were superfluous and have been removed [2025-02-06 19:08:50,857 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-02-06 19:08:50,858 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#0,GLOBAL]] [2025-02-06 19:08:50,858 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#0,GLOBAL]],[IdentifierExpression[#in~p!base,]]] [2025-02-06 19:08:50,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:50,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 19:08:50,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 19:08:50,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:50,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:50,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 19:08:50,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:50,979 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 17 treesize of output 9 [2025-02-06 19:08:50,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:08:50,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:08:50,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:50,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:50,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 19:08:50,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:51,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 23 treesize of output 15 [2025-02-06 19:08:51,054 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 36 treesize of output 20 [2025-02-06 19:08:51,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:08:51,074 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 4 loop predicates [2025-02-06 19:08:51,074 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 41 transitions. cyclomatic complexity: 10 Second operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:08:51,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-02-06 19:08:51,246 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 41 transitions. cyclomatic complexity: 10. Second operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 53 states and 62 transitions. Complement of second has 23 states. [2025-02-06 19:08:51,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 4 stem states 4 non-accepting loop states 1 accepting loop states [2025-02-06 19:08:51,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:08:51,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 18 transitions. [2025-02-06 19:08:51,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 18 transitions. Stem has 8 letters. Loop has 4 letters. [2025-02-06 19:08:51,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:08:51,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 18 transitions. Stem has 12 letters. Loop has 4 letters. [2025-02-06 19:08:51,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:08:51,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 18 transitions. Stem has 8 letters. Loop has 8 letters. [2025-02-06 19:08:51,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:08:51,248 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 62 transitions. [2025-02-06 19:08:51,249 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2025-02-06 19:08:51,250 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 45 states and 54 transitions. [2025-02-06 19:08:51,250 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2025-02-06 19:08:51,250 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2025-02-06 19:08:51,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 54 transitions. [2025-02-06 19:08:51,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:08:51,250 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 54 transitions. [2025-02-06 19:08:51,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 54 transitions. [2025-02-06 19:08:51,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2025-02-06 19:08:51,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 31 states have internal predecessors, (35), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-06 19:08:51,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2025-02-06 19:08:51,253 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 49 transitions. [2025-02-06 19:08:51,253 INFO L432 stractBuchiCegarLoop]: Abstraction has 42 states and 49 transitions. [2025-02-06 19:08:51,253 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-06 19:08:51,254 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 49 transitions. [2025-02-06 19:08:51,254 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2025-02-06 19:08:51,254 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:08:51,254 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:08:51,255 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:08:51,255 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:08:51,255 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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~ret9#1, main_~op~0#1.base, main_~op~0#1.offset, main_~i~0#1;havoc main_#t~nondet6#1;main_~i~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" "assume main_~i~0#1 > 0;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~nondet8#1;call write~int#0(main_#t~nondet8#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~nondet8#1;" "call main_#t~ret9#1 := rec(main_~op~0#1.base, main_~op~0#1.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int#0(~p.base, ~p.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;" "call #t~mem3 := read~int#0(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int#0(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~mem3;havoc #t~post4;" "call #t~ret5 := rec(~p.base, ~p.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int#0(~p.base, ~p.offset, 4);" "assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int#0(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0;" "assume true;" >"#18#return;" "#res := #t~ret5;havoc #t~ret5;" "assume true;" >"#20#return;" [2025-02-06 19:08:51,255 INFO L754 eck$LassoCheckResult]: Loop: "main_~i~0#1 := main_~i~0#1 + main_#t~ret9#1;havoc main_~op~0#1.base, main_~op~0#1.offset;havoc main_#t~ret9#1;" "assume main_~i~0#1 > 0;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~nondet8#1;call write~int#0(main_#t~nondet8#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~nondet8#1;" "call main_#t~ret9#1 := rec(main_~op~0#1.base, main_~op~0#1.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int#0(~p.base, ~p.offset, 4);" "assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int#0(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0;" "assume true;" >"#20#return;" [2025-02-06 19:08:51,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:51,255 INFO L85 PathProgramCache]: Analyzing trace with hash 703155633, now seen corresponding path program 1 times [2025-02-06 19:08:51,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:51,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157963570] [2025-02-06 19:08:51,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:51,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:51,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 19:08:51,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 19:08:51,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:51,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:51,271 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:51,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 19:08:51,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 19:08:51,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:51,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:51,281 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:51,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:51,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1905744422, now seen corresponding path program 2 times [2025-02-06 19:08:51,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:51,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152314943] [2025-02-06 19:08:51,282 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:08:51,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:51,286 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:08:51,290 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:08:51,290 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:08:51,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:51,290 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:51,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:08:51,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:08:51,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:51,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:51,297 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:51,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:51,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1101894186, now seen corresponding path program 1 times [2025-02-06 19:08:51,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:51,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241265371] [2025-02-06 19:08:51,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:51,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:51,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 19:08:51,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 19:08:51,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:51,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:51,312 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:51,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 19:08:51,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 19:08:51,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:51,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:51,326 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:51,919 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:08:51,919 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:08:51,919 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:08:51,919 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:08:51,919 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:08:51,919 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:51,919 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:08:51,919 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:08:51,919 INFO L132 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3.i_Iteration3_Lasso [2025-02-06 19:08:51,919 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:08:51,920 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:08:51,920 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:52,007 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:52,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:52,011 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:52,012 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:52,014 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:52,140 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:08:52,140 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:08:52,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:52,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:52,146 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:08:52,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-02-06 19:08:52,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-02-06 19:08:52,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:52,159 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-02-06 19:08:52,159 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-06 19:08:52,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:52,163 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2025-02-06 19:08:52,163 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-02-06 19:08:52,172 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:52,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-02-06 19:08:52,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:52,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:52,180 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:08:52,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-02-06 19:08:52,182 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:52,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:52,193 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:52,193 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:52,193 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:52,195 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:08:52,195 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:52,198 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:52,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-02-06 19:08:52,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:52,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:52,207 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:08:52,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-02-06 19:08:52,209 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:52,219 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:52,219 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:52,219 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:52,219 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:52,221 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:08:52,221 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:52,223 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:52,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-02-06 19:08:52,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:52,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:52,236 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:08:52,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-02-06 19:08:52,238 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:52,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:52,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:52,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:52,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:52,259 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:08:52,260 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:52,273 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:08:52,283 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-02-06 19:08:52,283 INFO L444 ModelExtractionUtils]: 8 out of 16 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-02-06 19:08:52,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:52,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:52,285 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:08:52,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-02-06 19:08:52,287 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:08:52,298 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:08:52,299 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:08:52,299 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#t~ret9#1) = 1*ULTIMATE.start_main_~i~0#1 + 1*ULTIMATE.start_main_#t~ret9#1 Supporting invariants [] [2025-02-06 19:08:52,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-02-06 19:08:52,307 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2025-02-06 19:08:52,308 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~ret9 [2025-02-06 19:08:52,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:52,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 19:08:52,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 19:08:52,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:52,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:52,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 19:08:52,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:52,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:08:52,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:08:52,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:52,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:52,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 19:08:52,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:52,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 17 treesize of output 9 [2025-02-06 19:08:52,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:08:52,547 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2025-02-06 19:08:52,547 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 11 Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 19:08:52,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-02-06 19:08:52,683 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 11. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Result 141 states and 163 transitions. Complement of second has 21 states. [2025-02-06 19:08:52,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2025-02-06 19:08:52,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 19:08:52,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 28 transitions. [2025-02-06 19:08:52,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 15 letters. Loop has 7 letters. [2025-02-06 19:08:52,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:08:52,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 22 letters. Loop has 7 letters. [2025-02-06 19:08:52,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:08:52,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 15 letters. Loop has 14 letters. [2025-02-06 19:08:52,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:08:52,688 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 141 states and 163 transitions. [2025-02-06 19:08:52,692 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2025-02-06 19:08:52,697 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 141 states to 97 states and 112 transitions. [2025-02-06 19:08:52,697 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2025-02-06 19:08:52,697 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2025-02-06 19:08:52,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 112 transitions. [2025-02-06 19:08:52,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:08:52,698 INFO L218 hiAutomatonCegarLoop]: Abstraction has 97 states and 112 transitions. [2025-02-06 19:08:52,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states and 112 transitions. [2025-02-06 19:08:52,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 89. [2025-02-06 19:08:52,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 63 states have (on average 1.1587301587301588) internal successors, (73), 66 states have internal predecessors, (73), 13 states have call successors, (13), 11 states have call predecessors, (13), 13 states have return successors, (17), 11 states have call predecessors, (17), 13 states have call successors, (17) [2025-02-06 19:08:52,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 103 transitions. [2025-02-06 19:08:52,707 INFO L240 hiAutomatonCegarLoop]: Abstraction has 89 states and 103 transitions. [2025-02-06 19:08:52,707 INFO L432 stractBuchiCegarLoop]: Abstraction has 89 states and 103 transitions. [2025-02-06 19:08:52,707 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-06 19:08:52,707 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 103 transitions. [2025-02-06 19:08:52,708 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2025-02-06 19:08:52,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:08:52,708 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:08:52,711 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:08:52,711 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-06 19:08:52,711 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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~ret9#1, main_~op~0#1.base, main_~op~0#1.offset, main_~i~0#1;havoc main_#t~nondet6#1;main_~i~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" "assume main_~i~0#1 > 0;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~nondet8#1;call write~int#0(main_#t~nondet8#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~nondet8#1;" "call main_#t~ret9#1 := rec(main_~op~0#1.base, main_~op~0#1.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int#0(~p.base, ~p.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;" "call #t~mem3 := read~int#0(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int#0(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~mem3;havoc #t~post4;" "call #t~ret5 := rec(~p.base, ~p.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int#0(~p.base, ~p.offset, 4);" "assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int#0(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0;" "assume true;" >"#18#return;" "#res := #t~ret5;havoc #t~ret5;" "assume true;" >"#20#return;" "main_~i~0#1 := main_~i~0#1 + main_#t~ret9#1;havoc main_~op~0#1.base, main_~op~0#1.offset;havoc main_#t~ret9#1;" "assume main_~i~0#1 > 0;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~nondet8#1;call write~int#0(main_#t~nondet8#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~nondet8#1;" "call main_#t~ret9#1 := rec(main_~op~0#1.base, main_~op~0#1.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int#0(~p.base, ~p.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;" "call #t~mem3 := read~int#0(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int#0(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~mem3;havoc #t~post4;" "call #t~ret5 := rec(~p.base, ~p.offset);"< [2025-02-06 19:08:52,711 INFO L754 eck$LassoCheckResult]: Loop: "~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int#0(~p.base, ~p.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;" "call #t~mem3 := read~int#0(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int#0(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~mem3;havoc #t~post4;" "call #t~ret5 := rec(~p.base, ~p.offset);"< [2025-02-06 19:08:52,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:52,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1101894989, now seen corresponding path program 2 times [2025-02-06 19:08:52,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:52,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204666973] [2025-02-06 19:08:52,711 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:08:52,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:52,719 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-02-06 19:08:52,739 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 19:08:52,739 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:08:52,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:52,739 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:52,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 19:08:52,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 19:08:52,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:52,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:52,765 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:52,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:52,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1137934, now seen corresponding path program 2 times [2025-02-06 19:08:52,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:52,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676377179] [2025-02-06 19:08:52,766 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:08:52,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:52,772 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:08:52,775 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:08:52,775 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:08:52,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:52,775 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:52,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:08:52,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:08:52,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:52,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:52,778 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:52,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:52,778 INFO L85 PathProgramCache]: Analyzing trace with hash -618959782, now seen corresponding path program 3 times [2025-02-06 19:08:52,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:52,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206845096] [2025-02-06 19:08:52,778 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:08:52,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:52,790 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 3 equivalence classes. [2025-02-06 19:08:52,813 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 19:08:52,813 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 19:08:52,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:52,813 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:52,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 19:08:52,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 19:08:52,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:52,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:52,843 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:53,995 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:08:53,995 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:08:53,995 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:08:53,995 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:08:53,995 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:08:53,995 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:53,995 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:08:53,995 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:08:53,995 INFO L132 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3.i_Iteration4_Lasso [2025-02-06 19:08:53,995 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:08:53,995 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:08:53,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:54,000 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:54,002 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:54,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:54,005 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:54,006 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:54,008 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:54,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:54,011 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:54,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:54,159 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:54,161 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:54,163 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:54,165 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:54,167 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:54,169 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:54,171 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:54,174 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:54,176 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:54,410 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:08:54,410 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:08:54,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:54,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:54,413 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:08:54,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-02-06 19:08:54,419 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:54,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:54,430 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:54,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:54,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:54,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:54,431 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:54,431 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:54,432 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:54,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-02-06 19:08:54,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:54,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:54,439 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:08:54,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-02-06 19:08:54,444 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:54,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:54,456 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:54,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:54,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:54,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:54,456 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:54,456 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:54,457 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:54,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-02-06 19:08:54,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:54,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:54,464 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:08:54,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-02-06 19:08:54,466 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:54,476 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:54,476 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:54,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:54,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:54,476 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:54,476 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:54,476 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:54,477 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:54,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-02-06 19:08:54,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:54,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:54,485 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:08:54,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-02-06 19:08:54,487 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:54,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:54,497 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:54,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:54,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:54,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:54,497 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:54,497 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:54,498 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:54,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-02-06 19:08:54,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:54,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:54,505 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:08:54,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-02-06 19:08:54,508 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:54,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:54,517 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:54,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:54,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:54,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:54,517 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:54,517 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:54,518 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:54,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-02-06 19:08:54,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:54,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:54,526 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:08:54,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-02-06 19:08:54,528 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:54,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:54,537 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:54,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:54,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:54,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:54,538 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:54,538 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:54,539 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:54,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-02-06 19:08:54,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:54,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:54,546 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:08:54,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-02-06 19:08:54,547 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:54,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:54,557 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:54,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:54,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:54,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:54,558 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:54,558 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:54,559 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:54,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-02-06 19:08:54,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:54,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:54,566 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:08:54,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-02-06 19:08:54,568 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:54,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:54,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:54,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:54,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:54,579 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:08:54,579 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:54,582 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:54,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-02-06 19:08:54,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:54,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:54,589 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:08:54,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-02-06 19:08:54,591 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:54,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:54,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:54,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:54,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:54,602 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:08:54,602 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:54,606 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:54,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2025-02-06 19:08:54,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:54,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:54,614 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:08:54,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-02-06 19:08:54,616 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:54,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:54,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:54,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:54,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:54,628 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:08:54,628 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:54,631 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:54,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2025-02-06 19:08:54,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:54,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:54,641 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:08:54,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-02-06 19:08:54,643 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:54,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:54,653 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2025-02-06 19:08:54,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:54,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:54,659 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-02-06 19:08:54,659 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:54,667 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:54,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-02-06 19:08:54,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:54,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:54,681 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:08:54,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-02-06 19:08:54,684 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:54,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:54,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:54,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:54,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:54,696 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:08:54,696 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:54,699 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:54,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2025-02-06 19:08:54,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:54,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:54,708 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:08:54,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-02-06 19:08:54,710 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:54,720 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:54,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:54,720 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:54,720 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:54,724 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:08:54,724 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:54,728 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:08:54,734 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-06 19:08:54,734 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 2 variables to zero. [2025-02-06 19:08:54,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:54,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:54,737 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:08:54,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-02-06 19:08:54,739 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:08:54,748 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:08:54,749 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:08:54,749 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 rec_#in~p.base) rec_#in~p.offset)_2) = 2*v_rep(select (select #memory_int#0 rec_#in~p.base) rec_#in~p.offset)_2 + 1 Supporting invariants [] [2025-02-06 19:08:54,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2025-02-06 19:08:54,757 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-02-06 19:08:54,758 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-02-06 19:08:54,758 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-02-06 19:08:54,758 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#in~p!base,]]] [2025-02-06 19:08:54,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:54,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 19:08:54,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 19:08:54,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:54,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:54,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 19:08:54,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:54,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:08:54,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:08:54,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:54,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:54,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 19:08:54,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:54,988 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 36 treesize of output 20 [2025-02-06 19:08:55,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:08:55,015 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2025-02-06 19:08:55,016 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 89 states and 103 transitions. cyclomatic complexity: 21 Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 19:08:55,107 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 89 states and 103 transitions. cyclomatic complexity: 21. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 119 states and 137 transitions. Complement of second has 21 states. [2025-02-06 19:08:55,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2025-02-06 19:08:55,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 19:08:55,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 18 transitions. [2025-02-06 19:08:55,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 18 transitions. Stem has 22 letters. Loop has 4 letters. [2025-02-06 19:08:55,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:08:55,112 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:08:55,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:55,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 19:08:55,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 19:08:55,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:55,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:55,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 19:08:55,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:55,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:08:55,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:08:55,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:55,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:55,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 19:08:55,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:55,308 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 36 treesize of output 20 [2025-02-06 19:08:55,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:08:55,332 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2025-02-06 19:08:55,333 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 89 states and 103 transitions. cyclomatic complexity: 21 Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 19:08:55,429 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 89 states and 103 transitions. cyclomatic complexity: 21. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 119 states and 137 transitions. Complement of second has 21 states. [2025-02-06 19:08:55,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2025-02-06 19:08:55,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 19:08:55,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 18 transitions. [2025-02-06 19:08:55,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 18 transitions. Stem has 22 letters. Loop has 4 letters. [2025-02-06 19:08:55,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:08:55,431 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:08:55,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:55,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 19:08:55,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 19:08:55,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:55,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:55,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 19:08:55,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:55,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:08:55,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:08:55,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:55,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:55,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 19:08:55,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:55,737 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 36 treesize of output 20 [2025-02-06 19:08:55,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:08:55,750 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2025-02-06 19:08:55,750 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 89 states and 103 transitions. cyclomatic complexity: 21 Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 19:08:55,844 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 89 states and 103 transitions. cyclomatic complexity: 21. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 178 states and 203 transitions. Complement of second has 24 states. [2025-02-06 19:08:55,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2025-02-06 19:08:55,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 19:08:55,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2025-02-06 19:08:55,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 21 transitions. Stem has 22 letters. Loop has 4 letters. [2025-02-06 19:08:55,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:08:55,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 21 transitions. Stem has 26 letters. Loop has 4 letters. [2025-02-06 19:08:55,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:08:55,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 21 transitions. Stem has 22 letters. Loop has 8 letters. [2025-02-06 19:08:55,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:08:55,848 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 178 states and 203 transitions. [2025-02-06 19:08:55,850 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-02-06 19:08:55,852 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 178 states to 122 states and 147 transitions. [2025-02-06 19:08:55,852 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2025-02-06 19:08:55,852 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 80 [2025-02-06 19:08:55,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 147 transitions. [2025-02-06 19:08:55,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:08:55,852 INFO L218 hiAutomatonCegarLoop]: Abstraction has 122 states and 147 transitions. [2025-02-06 19:08:55,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 147 transitions. [2025-02-06 19:08:55,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 80. [2025-02-06 19:08:55,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 57 states have (on average 1.1754385964912282) internal successors, (67), 60 states have internal predecessors, (67), 10 states have call successors, (10), 10 states have call predecessors, (10), 13 states have return successors, (16), 9 states have call predecessors, (16), 10 states have call successors, (16) [2025-02-06 19:08:55,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 93 transitions. [2025-02-06 19:08:55,857 INFO L240 hiAutomatonCegarLoop]: Abstraction has 80 states and 93 transitions. [2025-02-06 19:08:55,857 INFO L432 stractBuchiCegarLoop]: Abstraction has 80 states and 93 transitions. [2025-02-06 19:08:55,857 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-06 19:08:55,857 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 93 transitions. [2025-02-06 19:08:55,858 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-02-06 19:08:55,858 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:08:55,858 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:08:55,858 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:08:55,858 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:08:55,858 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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~ret9#1, main_~op~0#1.base, main_~op~0#1.offset, main_~i~0#1;havoc main_#t~nondet6#1;main_~i~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" "assume main_~i~0#1 > 0;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~nondet8#1;call write~int#0(main_#t~nondet8#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~nondet8#1;" "call main_#t~ret9#1 := rec(main_~op~0#1.base, main_~op~0#1.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int#0(~p.base, ~p.offset, 4);" "assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int#0(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0;" "assume true;" >"#20#return;" "main_~i~0#1 := main_~i~0#1 + main_#t~ret9#1;havoc main_~op~0#1.base, main_~op~0#1.offset;havoc main_#t~ret9#1;" "assume main_~i~0#1 > 0;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~nondet8#1;call write~int#0(main_#t~nondet8#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~nondet8#1;" "call main_#t~ret9#1 := rec(main_~op~0#1.base, main_~op~0#1.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int#0(~p.base, ~p.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;" "call #t~mem3 := read~int#0(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int#0(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~mem3;havoc #t~post4;" "call #t~ret5 := rec(~p.base, ~p.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int#0(~p.base, ~p.offset, 4);" "assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int#0(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0;" "assume true;" >"#18#return;" "#res := #t~ret5;havoc #t~ret5;" "assume true;" >"#20#return;" [2025-02-06 19:08:55,858 INFO L754 eck$LassoCheckResult]: Loop: "main_~i~0#1 := main_~i~0#1 + main_#t~ret9#1;havoc main_~op~0#1.base, main_~op~0#1.offset;havoc main_#t~ret9#1;" "assume main_~i~0#1 > 0;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~nondet8#1;call write~int#0(main_#t~nondet8#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~nondet8#1;" "call main_#t~ret9#1 := rec(main_~op~0#1.base, main_~op~0#1.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int#0(~p.base, ~p.offset, 4);" "assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int#0(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0;" "assume true;" >"#20#return;" [2025-02-06 19:08:55,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:55,858 INFO L85 PathProgramCache]: Analyzing trace with hash 2108101592, now seen corresponding path program 4 times [2025-02-06 19:08:55,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:55,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533042844] [2025-02-06 19:08:55,859 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:08:55,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:55,864 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-02-06 19:08:55,870 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 19:08:55,871 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:08:55,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:55,871 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:55,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 19:08:55,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 19:08:55,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:55,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:55,880 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:55,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:55,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1905744422, now seen corresponding path program 3 times [2025-02-06 19:08:55,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:55,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553461596] [2025-02-06 19:08:55,880 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:08:55,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:55,886 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:08:55,889 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:08:55,889 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 19:08:55,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:55,889 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:55,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:08:55,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:08:55,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:55,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:55,893 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:55,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:55,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1420631517, now seen corresponding path program 5 times [2025-02-06 19:08:55,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:55,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075429324] [2025-02-06 19:08:55,894 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:08:55,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:55,898 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 3 equivalence classes. [2025-02-06 19:08:55,910 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 19:08:55,910 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-02-06 19:08:55,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:55,910 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:55,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 19:08:55,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 19:08:55,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:55,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:55,921 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:56,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-02-06 19:08:56,922 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:08:56,923 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:08:56,923 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:08:56,923 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:08:56,923 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:08:56,923 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:56,923 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:08:56,923 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:08:56,923 INFO L132 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3.i_Iteration5_Lasso [2025-02-06 19:08:56,923 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:08:56,923 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:08:56,925 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:56,928 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:56,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:56,931 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:56,932 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:57,105 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:57,327 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:08:57,328 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:08:57,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:57,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:57,329 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:08:57,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-02-06 19:08:57,332 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:57,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:57,342 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:57,342 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:57,342 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:57,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:57,346 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:57,347 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:57,347 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:57,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-02-06 19:08:57,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:57,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:57,358 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:08:57,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-02-06 19:08:57,360 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:57,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:57,371 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:57,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:57,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:57,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:57,372 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:57,372 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:57,373 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:57,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2025-02-06 19:08:57,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:57,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:57,380 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:08:57,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-02-06 19:08:57,382 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:57,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:57,393 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:57,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:57,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:57,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:57,394 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:57,394 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:57,395 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:57,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2025-02-06 19:08:57,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:57,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:57,406 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:08:57,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-02-06 19:08:57,412 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:57,422 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:57,422 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:57,422 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:57,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:57,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:57,422 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:57,422 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:57,423 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:57,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2025-02-06 19:08:57,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:57,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:57,432 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:08:57,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-02-06 19:08:57,433 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:57,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:57,443 INFO L203 nArgumentSynthesizer]: 6 stem disjuncts [2025-02-06 19:08:57,443 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-06 19:08:57,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:57,453 INFO L401 nArgumentSynthesizer]: We have 36 Motzkin's Theorem applications. [2025-02-06 19:08:57,453 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-02-06 19:08:57,468 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:57,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-02-06 19:08:57,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:57,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:57,476 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:08:57,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-02-06 19:08:57,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-02-06 19:08:57,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:57,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:57,491 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:57,491 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:57,494 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:08:57,494 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:57,500 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:08:57,512 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-02-06 19:08:57,513 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-02-06 19:08:57,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:57,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:57,515 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:08:57,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-02-06 19:08:57,517 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:08:57,529 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:08:57,529 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:08:57,529 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~ret9#1, ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_#t~ret9#1 + 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2025-02-06 19:08:57,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-02-06 19:08:57,537 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2025-02-06 19:08:57,538 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~ret9 [2025-02-06 19:08:57,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:57,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 19:08:57,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 19:08:57,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:57,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:57,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 19:08:57,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:57,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:08:57,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:08:57,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:57,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:57,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 19:08:57,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:57,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 17 treesize of output 9 [2025-02-06 19:08:57,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:08:57,740 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2025-02-06 19:08:57,740 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 80 states and 93 transitions. cyclomatic complexity: 18 Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 19:08:57,798 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 80 states and 93 transitions. cyclomatic complexity: 18. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Result 126 states and 147 transitions. Complement of second has 21 states. [2025-02-06 19:08:57,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2025-02-06 19:08:57,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 19:08:57,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 28 transitions. [2025-02-06 19:08:57,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 22 letters. Loop has 7 letters. [2025-02-06 19:08:57,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:08:57,800 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:08:57,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:57,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 19:08:57,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 19:08:57,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:57,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:57,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 19:08:57,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:57,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:08:57,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:08:57,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:57,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:57,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 19:08:57,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:57,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 17 treesize of output 9 [2025-02-06 19:08:58,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:08:58,012 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 6 loop predicates [2025-02-06 19:08:58,012 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 80 states and 93 transitions. cyclomatic complexity: 18 Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 19:08:58,089 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 80 states and 93 transitions. cyclomatic complexity: 18. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Result 126 states and 147 transitions. Complement of second has 21 states. [2025-02-06 19:08:58,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2025-02-06 19:08:58,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 19:08:58,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 28 transitions. [2025-02-06 19:08:58,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 22 letters. Loop has 7 letters. [2025-02-06 19:08:58,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:08:58,090 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:08:58,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:58,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 19:08:58,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 19:08:58,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:58,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:58,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 19:08:58,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:58,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:08:58,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:08:58,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:58,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:58,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 19:08:58,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:58,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 17 treesize of output 9 [2025-02-06 19:08:58,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:08:58,301 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2025-02-06 19:08:58,302 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 80 states and 93 transitions. cyclomatic complexity: 18 Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 19:08:58,364 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 80 states and 93 transitions. cyclomatic complexity: 18. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Result 153 states and 179 transitions. Complement of second has 22 states. [2025-02-06 19:08:58,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2025-02-06 19:08:58,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 19:08:58,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2025-02-06 19:08:58,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 30 transitions. Stem has 22 letters. Loop has 7 letters. [2025-02-06 19:08:58,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:08:58,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 30 transitions. Stem has 29 letters. Loop has 7 letters. [2025-02-06 19:08:58,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:08:58,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 30 transitions. Stem has 22 letters. Loop has 14 letters. [2025-02-06 19:08:58,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:08:58,366 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 153 states and 179 transitions. [2025-02-06 19:08:58,368 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-02-06 19:08:58,369 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 153 states to 100 states and 115 transitions. [2025-02-06 19:08:58,369 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2025-02-06 19:08:58,369 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2025-02-06 19:08:58,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 115 transitions. [2025-02-06 19:08:58,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:08:58,369 INFO L218 hiAutomatonCegarLoop]: Abstraction has 100 states and 115 transitions. [2025-02-06 19:08:58,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 115 transitions. [2025-02-06 19:08:58,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 34. [2025-02-06 19:08:58,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-06 19:08:58,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2025-02-06 19:08:58,371 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 40 transitions. [2025-02-06 19:08:58,371 INFO L432 stractBuchiCegarLoop]: Abstraction has 34 states and 40 transitions. [2025-02-06 19:08:58,371 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-06 19:08:58,372 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 40 transitions. [2025-02-06 19:08:58,372 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-02-06 19:08:58,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:08:58,372 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:08:58,372 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-06 19:08:58,372 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:08:58,372 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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~ret9#1, main_~op~0#1.base, main_~op~0#1.offset, main_~i~0#1;havoc main_#t~nondet6#1;main_~i~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" "assume main_~i~0#1 > 0;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~nondet8#1;call write~int#0(main_#t~nondet8#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~nondet8#1;" [2025-02-06 19:08:58,372 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~ret9#1 := rec(main_~op~0#1.base, main_~op~0#1.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int#0(~p.base, ~p.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;" "call #t~mem3 := read~int#0(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int#0(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~mem3;havoc #t~post4;" "call #t~ret5 := rec(~p.base, ~p.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int#0(~p.base, ~p.offset, 4);" "assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int#0(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0;" "assume true;" >"#18#return;" "#res := #t~ret5;havoc #t~ret5;" "assume true;" >"#20#return;" "main_~i~0#1 := main_~i~0#1 + main_#t~ret9#1;havoc main_~op~0#1.base, main_~op~0#1.offset;havoc main_#t~ret9#1;" "assume main_~i~0#1 > 0;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~nondet8#1;call write~int#0(main_#t~nondet8#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~nondet8#1;" [2025-02-06 19:08:58,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:58,373 INFO L85 PathProgramCache]: Analyzing trace with hash 44652, now seen corresponding path program 1 times [2025-02-06 19:08:58,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:58,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37542056] [2025-02-06 19:08:58,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:58,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:58,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:08:58,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:08:58,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:58,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:58,377 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:58,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:08:58,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:08:58,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:58,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:58,380 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:58,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:58,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1545662584, now seen corresponding path program 1 times [2025-02-06 19:08:58,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:58,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526519162] [2025-02-06 19:08:58,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:58,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:58,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 19:08:58,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 19:08:58,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:58,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:58,386 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:58,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 19:08:58,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 19:08:58,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:58,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:58,392 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:58,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:58,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1422698163, now seen corresponding path program 6 times [2025-02-06 19:08:58,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:58,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196117539] [2025-02-06 19:08:58,392 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 19:08:58,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:58,396 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 17 statements into 3 equivalence classes. [2025-02-06 19:08:58,401 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 19:08:58,401 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-02-06 19:08:58,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:58,401 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:58,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 19:08:58,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 19:08:58,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:58,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:58,409 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:58,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-02-06 19:08:58,853 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:08:58,853 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:08:58,853 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:08:58,853 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:08:58,853 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:08:58,853 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:58,853 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:08:58,853 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:08:58,853 INFO L132 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3.i_Iteration6_Lasso [2025-02-06 19:08:58,853 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:08:58,853 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:08:58,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:58,857 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:58,859 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:58,867 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:58,868 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:58,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:58,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:58,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:59,090 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:08:59,090 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:08:59,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:59,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:59,093 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:08:59,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-02-06 19:08:59,095 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:59,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:59,105 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:59,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:59,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:59,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:59,105 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:59,105 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:59,106 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:59,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2025-02-06 19:08:59,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:59,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:59,114 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:08:59,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-02-06 19:08:59,115 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:59,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:59,125 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:59,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:59,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:59,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:59,125 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:59,125 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:59,126 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:59,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2025-02-06 19:08:59,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:59,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:59,135 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:08:59,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-02-06 19:08:59,137 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:59,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:59,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:59,149 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:59,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:59,151 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:08:59,151 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:59,155 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:08:59,163 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-02-06 19:08:59,163 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-02-06 19:08:59,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:59,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:59,165 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:08:59,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-02-06 19:08:59,166 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:08:59,176 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:08:59,176 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:08:59,176 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2025-02-06 19:08:59,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2025-02-06 19:08:59,186 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2025-02-06 19:08:59,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:59,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:08:59,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:08:59,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:59,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:59,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:08:59,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:59,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 19:08:59,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 19:08:59,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:59,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:59,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 19:08:59,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:59,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 17 treesize of output 9 [2025-02-06 19:08:59,317 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 19:08:59,318 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2025-02-06 19:08:59,318 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 40 transitions. cyclomatic complexity: 8 Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 19:08:59,386 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 40 transitions. cyclomatic complexity: 8. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 73 states and 90 transitions. Complement of second has 22 states. [2025-02-06 19:08:59,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2025-02-06 19:08:59,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 19:08:59,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 15 transitions. [2025-02-06 19:08:59,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 15 transitions. Stem has 3 letters. Loop has 14 letters. [2025-02-06 19:08:59,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:08:59,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 15 transitions. Stem has 17 letters. Loop has 14 letters. [2025-02-06 19:08:59,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:08:59,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 15 transitions. Stem has 3 letters. Loop has 28 letters. [2025-02-06 19:08:59,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:08:59,388 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 90 transitions. [2025-02-06 19:08:59,389 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-06 19:08:59,389 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 0 states and 0 transitions. [2025-02-06 19:08:59,389 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-06 19:08:59,389 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-06 19:08:59,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-06 19:08:59,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:08:59,389 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 19:08:59,390 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 19:08:59,390 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 19:08:59,390 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-06 19:08:59,390 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-06 19:08:59,390 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-06 19:08:59,390 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-06 19:08:59,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 06.02 07:08:59 BoogieIcfgContainer [2025-02-06 19:08:59,402 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-06 19:08:59,402 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 19:08:59,402 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 19:08:59,402 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 19:08:59,407 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:08:47" (3/4) ... [2025-02-06 19:08:59,408 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 19:08:59,408 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 19:08:59,410 INFO L158 Benchmark]: Toolchain (without parser) took 11874.11ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 105.8MB in the beginning and 183.0MB in the end (delta: -77.1MB). Peak memory consumption was 99.9MB. Max. memory is 16.1GB. [2025-02-06 19:08:59,410 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:08:59,410 INFO L158 Benchmark]: CACSL2BoogieTranslator took 137.67ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 96.4MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 19:08:59,410 INFO L158 Benchmark]: Boogie Procedure Inliner took 16.14ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 95.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:08:59,410 INFO L158 Benchmark]: Boogie Preprocessor took 15.69ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 93.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:08:59,411 INFO L158 Benchmark]: IcfgBuilder took 188.74ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 82.7MB in the end (delta: 10.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 19:08:59,411 INFO L158 Benchmark]: BuchiAutomizer took 11504.81ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 82.7MB in the beginning and 186.1MB in the end (delta: -103.5MB). Peak memory consumption was 66.4MB. Max. memory is 16.1GB. [2025-02-06 19:08:59,411 INFO L158 Benchmark]: Witness Printer took 6.24ms. Allocated memory is still 318.8MB. Free memory was 186.1MB in the beginning and 183.0MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 19:08:59,412 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.25ms. Allocated memory is still 201.3MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 137.67ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 96.4MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 16.14ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 95.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 15.69ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 93.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 188.74ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 82.7MB in the end (delta: 10.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 11504.81ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 82.7MB in the beginning and 186.1MB in the end (delta: -103.5MB). Peak memory consumption was 66.4MB. Max. memory is 16.1GB. * Witness Printer took 6.24ms. Allocated memory is still 318.8MB. Free memory was 186.1MB in the beginning and 183.0MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. 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 UnaryExpression[OLD,IdentifierExpression[#memory_int#0,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#0,GLOBAL]],[IdentifierExpression[#in~p!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~ret9 - 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[#in~p!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~ret9 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (0 trivial, 4 deterministic, 2 nondeterministic). One deterministic module has affine ranking function i and consists of 7 locations. One deterministic module has affine ranking function null and consists of 9 locations. One deterministic module has affine ranking function null and consists of 8 locations. One deterministic module has affine ranking function i and consists of 8 locations. One nondeterministic module has affine ranking function null and consists of 7 locations. One nondeterministic module has affine ranking function null and consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.4s and 7 iterations. TraceHistogramMax:3. Analysis of lassos took 8.0s. Construction of modules took 0.4s. Büchi inclusion checks took 2.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 122 StatesRemovedByMinimization, 5 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 [4, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 4/4 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 194 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 185 mSDsluCounter, 291 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 156 mSDsCounter, 123 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 450 IncrementalHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 123 mSolverCounterUnsat, 135 mSDtfsCounter, 450 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso6 LassoPreprocessingBenchmarks: Lassos: inital147 mio100 ax100 hnf100 lsp133 ukn51 mio100 lsp38 div100 bol100 ite100 ukn100 eq162 hnf94 smp100 dnf159 smp88 tf100 neg100 sie114 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 38ms VariablesStem: 5 VariablesLoop: 4 DisjunctsStem: 6 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 36 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-02-06 19:08:59,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2025-02-06 19:08:59,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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