./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/b.13-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 551b0097 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-memory-alloca/b.13-alloca.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 e86ab88515027c2a8ad7a1a5d7cd34e589814e2f5fa9f70f400cd1ca5df85524 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 07:06:19,833 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 07:06:19,891 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-01-10 07:06:19,896 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 07:06:19,896 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 07:06:19,919 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 07:06:19,920 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 07:06:19,920 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 07:06:19,920 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 07:06:19,920 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 07:06:19,921 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 07:06:19,921 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 07:06:19,921 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 07:06:19,921 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-01-10 07:06:19,921 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-01-10 07:06:19,921 INFO L153 SettingsManager]: * Use old map elimination=false [2025-01-10 07:06:19,921 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-01-10 07:06:19,921 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-01-10 07:06:19,921 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-01-10 07:06:19,921 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 07:06:19,921 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-01-10 07:06:19,922 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 07:06:19,922 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 07:06:19,922 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-01-10 07:06:19,922 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-01-10 07:06:19,922 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-01-10 07:06:19,922 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 07:06:19,922 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 07:06:19,922 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-01-10 07:06:19,922 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 07:06:19,922 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 07:06:19,922 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 07:06:19,922 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 07:06:19,922 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 07:06:19,922 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 07:06:19,922 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-01-10 07:06:19,922 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 -> e86ab88515027c2a8ad7a1a5d7cd34e589814e2f5fa9f70f400cd1ca5df85524 [2025-01-10 07:06:20,127 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 07:06:20,134 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 07:06:20,136 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 07:06:20,137 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 07:06:20,137 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 07:06:20,138 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/b.13-alloca.i [2025-01-10 07:06:21,295 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f0e6d0e21/0a0897920b0f43b48e4e8f3c32d5c6e9/FLAGab28eb7f3 [2025-01-10 07:06:21,521 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 07:06:21,522 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/b.13-alloca.i [2025-01-10 07:06:21,529 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f0e6d0e21/0a0897920b0f43b48e4e8f3c32d5c6e9/FLAGab28eb7f3 [2025-01-10 07:06:21,863 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f0e6d0e21/0a0897920b0f43b48e4e8f3c32d5c6e9 [2025-01-10 07:06:21,865 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 07:06:21,866 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 07:06:21,867 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 07:06:21,867 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 07:06:21,870 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 07:06:21,870 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:06:21" (1/1) ... [2025-01-10 07:06:21,871 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fa1c470 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:06:21, skipping insertion in model container [2025-01-10 07:06:21,871 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:06:21" (1/1) ... [2025-01-10 07:06:21,888 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 07:06:22,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:06:22,085 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 07:06:22,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:06:22,138 INFO L204 MainTranslator]: Completed translation [2025-01-10 07:06:22,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:06:22 WrapperNode [2025-01-10 07:06:22,140 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 07:06:22,141 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 07:06:22,141 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 07:06:22,141 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 07:06:22,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:06:22" (1/1) ... [2025-01-10 07:06:22,156 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:06:22" (1/1) ... [2025-01-10 07:06:22,169 INFO L138 Inliner]: procedures = 111, calls = 32, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 94 [2025-01-10 07:06:22,169 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 07:06:22,170 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 07:06:22,170 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 07:06:22,171 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 07:06:22,176 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:06:22" (1/1) ... [2025-01-10 07:06:22,176 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:06:22" (1/1) ... [2025-01-10 07:06:22,178 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:06:22" (1/1) ... [2025-01-10 07:06:22,184 INFO L175 MemorySlicer]: Split 17 memory accesses to 4 slices as follows [2, 5, 5, 5]. 29 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0, 0]. The 6 writes are split as follows [1, 1, 2, 2]. [2025-01-10 07:06:22,187 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:06:22" (1/1) ... [2025-01-10 07:06:22,187 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:06:22" (1/1) ... [2025-01-10 07:06:22,190 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:06:22" (1/1) ... [2025-01-10 07:06:22,191 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:06:22" (1/1) ... [2025-01-10 07:06:22,194 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:06:22" (1/1) ... [2025-01-10 07:06:22,195 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:06:22" (1/1) ... [2025-01-10 07:06:22,195 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:06:22" (1/1) ... [2025-01-10 07:06:22,196 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 07:06:22,197 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 07:06:22,197 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 07:06:22,197 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 07:06:22,197 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:06:22" (1/1) ... [2025-01-10 07:06:22,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:22,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:22,225 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-01-10 07:06:22,232 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-01-10 07:06:22,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 07:06:22,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 07:06:22,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 07:06:22,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 07:06:22,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 07:06:22,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 07:06:22,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 07:06:22,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 07:06:22,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 07:06:22,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 07:06:22,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 07:06:22,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 07:06:22,326 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 07:06:22,327 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 07:06:22,443 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-01-10 07:06:22,444 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 07:06:22,449 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 07:06:22,450 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-10 07:06:22,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:06:22 BoogieIcfgContainer [2025-01-10 07:06:22,451 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 07:06:22,451 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-01-10 07:06:22,452 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-01-10 07:06:22,455 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-01-10 07:06:22,455 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:06:22,455 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.01 07:06:21" (1/3) ... [2025-01-10 07:06:22,456 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@f34f8a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:06:22, skipping insertion in model container [2025-01-10 07:06:22,456 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:06:22,456 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:06:22" (2/3) ... [2025-01-10 07:06:22,456 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@f34f8a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:06:22, skipping insertion in model container [2025-01-10 07:06:22,456 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:06:22,456 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:06:22" (3/3) ... [2025-01-10 07:06:22,457 INFO L363 chiAutomizerObserver]: Analyzing ICFG b.13-alloca.i [2025-01-10 07:06:22,486 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-01-10 07:06:22,486 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-01-10 07:06:22,486 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-01-10 07:06:22,487 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-01-10 07:06:22,487 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-01-10 07:06:22,487 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-01-10 07:06:22,487 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-01-10 07:06:22,487 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-01-10 07:06:22,490 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:06:22,500 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-01-10 07:06:22,500 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:06:22,500 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:06:22,504 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:06:22,504 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-01-10 07:06:22,504 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-01-10 07:06:22,504 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:06:22,505 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-01-10 07:06:22,505 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:06:22,505 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:06:22,505 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:06:22,505 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-01-10 07:06:22,509 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~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~ret21#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1, test_fun_#in~z#1 := main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~short10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_#t~mem13#1, test_fun_#t~mem14#1, test_fun_#t~mem15#1, test_fun_#t~mem16#1, test_fun_#t~mem17#1, test_fun_~x#1, test_fun_~y#1, test_fun_~z#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;test_fun_~z#1 := test_fun_#in~z#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset;call write~int#3(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#2(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(test_fun_~z#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int#0(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4);" [2025-01-10 07:06:22,510 INFO L754 eck$LassoCheckResult]: Loop: "call test_fun_#t~mem6#1 := read~int#3(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short10#1 := test_fun_#t~mem6#1 > test_fun_#t~mem7#1;" "assume test_fun_#t~short10#1;" "assume test_fun_#t~short10#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~mem9#1;havoc test_fun_#t~short10#1;" "call test_fun_#t~mem11#1 := read~int#3(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem12#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);" "assume test_fun_#t~mem11#1 > test_fun_#t~mem12#1;havoc test_fun_#t~mem11#1;havoc test_fun_#t~mem12#1;call test_fun_#t~mem13#1 := read~int#3(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#3(test_fun_#t~mem13#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem13#1;" [2025-01-10 07:06:22,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:06:22,513 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2025-01-10 07:06:22,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:06:22,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12788328] [2025-01-10 07:06:22,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:06:22,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:06:22,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:06:22,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:06:22,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:22,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:22,634 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:06:22,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:06:22,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:06:22,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:22,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:22,679 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:06:22,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:06:22,681 INFO L85 PathProgramCache]: Analyzing trace with hash 34453422, now seen corresponding path program 1 times [2025-01-10 07:06:22,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:06:22,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554779145] [2025-01-10 07:06:22,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:06:22,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:06:22,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:06:22,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:06:22,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:22,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:22,699 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:06:22,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:06:22,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:06:22,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:22,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:22,710 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:06:22,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:06:22,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1805892908, now seen corresponding path program 1 times [2025-01-10 07:06:22,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:06:22,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146290928] [2025-01-10 07:06:22,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:06:22,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:06:22,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:06:22,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:06:22,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:22,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:22,775 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:06:22,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:06:22,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:06:22,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:22,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:22,807 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:06:23,641 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:06:23,642 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:06:23,642 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:06:23,642 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:06:23,642 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:06:23,642 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:23,642 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:06:23,643 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:06:23,643 INFO L132 ssoRankerPreferences]: Filename of dumped script: b.13-alloca.i_Iteration1_Lasso [2025-01-10 07:06:23,643 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:06:23,643 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:06:23,657 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:23,667 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:23,669 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:23,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:23,674 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:23,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:23,678 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:24,074 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:24,076 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:24,077 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:24,079 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:24,081 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:24,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:24,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:24,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:24,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:24,089 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:24,090 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:24,092 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:24,094 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:24,390 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:06:24,393 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:06:24,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:24,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:24,395 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-01-10 07:06:24,396 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-01-10 07:06:24,397 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:06:24,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:24,407 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:06:24,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:24,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:24,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:24,411 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:06:24,411 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:06:24,413 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:24,419 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-01-10 07:06:24,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:24,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:24,422 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-01-10 07:06:24,423 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-01-10 07:06:24,425 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:06:24,436 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:24,436 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:06:24,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:24,436 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:24,436 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:24,437 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:06:24,437 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:06:24,438 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:24,444 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-01-10 07:06:24,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:24,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:24,446 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-01-10 07:06:24,447 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-01-10 07:06:24,447 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:06:24,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:24,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:24,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:24,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:24,461 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:06:24,461 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:06:24,464 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:24,471 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-01-10 07:06:24,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:24,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:24,472 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-01-10 07:06:24,474 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-01-10 07:06:24,475 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:06:24,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:24,486 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:06:24,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:24,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:24,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:24,486 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:06:24,486 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:06:24,488 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:24,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-01-10 07:06:24,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:24,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:24,496 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-01-10 07:06:24,498 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-01-10 07:06:24,499 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:06:24,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:24,509 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:06:24,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:24,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:24,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:24,509 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:06:24,509 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:06:24,510 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:24,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-01-10 07:06:24,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:24,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:24,517 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-01-10 07:06:24,518 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-01-10 07:06:24,519 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:06:24,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:24,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:24,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:24,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:24,531 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:06:24,531 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:06:24,533 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:24,539 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-01-10 07:06:24,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:24,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:24,541 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-01-10 07:06:24,542 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-01-10 07:06:24,543 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:06:24,554 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:24,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:24,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:24,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:24,563 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:06:24,563 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:06:24,570 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:24,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-01-10 07:06:24,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:24,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:24,578 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-01-10 07:06:24,579 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-01-10 07:06:24,580 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:06:24,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:24,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:24,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:24,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:24,593 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:06:24,593 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:06:24,597 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:24,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-01-10 07:06:24,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:24,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:24,605 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-01-10 07:06:24,607 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-01-10 07:06:24,608 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:06:24,618 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:24,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:24,618 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:24,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:24,620 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:06:24,620 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:06:24,624 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:24,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-01-10 07:06:24,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:24,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:24,632 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-01-10 07:06:24,634 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-01-10 07:06:24,635 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:06:24,645 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:24,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:24,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:24,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:24,647 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:06:24,647 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:06:24,650 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:24,656 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-01-10 07:06:24,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:24,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:24,658 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-01-10 07:06:24,659 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-01-10 07:06:24,661 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:06:24,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:24,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:24,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:24,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:24,674 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:06:24,674 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:06:24,676 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:24,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-01-10 07:06:24,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:24,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:24,684 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-01-10 07:06:24,685 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-01-10 07:06:24,686 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:06:24,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:24,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:24,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:24,696 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:24,700 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:06:24,700 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:06:24,705 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:24,711 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-01-10 07:06:24,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:24,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:24,713 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-01-10 07:06:24,715 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-01-10 07:06:24,716 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:06:24,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:24,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:24,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:24,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:24,728 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:06:24,728 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:06:24,734 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:24,740 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-01-10 07:06:24,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:24,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:24,742 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-01-10 07:06:24,743 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-01-10 07:06:24,744 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:06:24,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:24,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:24,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:24,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:24,758 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:06:24,758 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:06:24,764 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:06:24,775 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-01-10 07:06:24,777 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-01-10 07:06:24,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:24,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:24,781 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-01-10 07:06:24,782 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-01-10 07:06:24,782 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:06:24,793 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-01-10 07:06:24,793 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:06:24,794 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#3 ULTIMATE.start_test_fun_~x_ref~0#1.base) 0)_1, v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~z_ref~0#1.base) ULTIMATE.start_test_fun_~z_ref~0#1.offset)_1) = 1*v_rep(select (select #memory_int#3 ULTIMATE.start_test_fun_~x_ref~0#1.base) 0)_1 - 1*v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~z_ref~0#1.base) ULTIMATE.start_test_fun_~z_ref~0#1.offset)_1 Supporting invariants [] [2025-01-10 07:06:24,800 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-01-10 07:06:24,871 INFO L156 tatePredicateManager]: 27 out of 28 supporting invariants were superfluous and have been removed [2025-01-10 07:06:24,876 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-01-10 07:06:24,877 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-01-10 07:06:24,877 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2025-01-10 07:06:24,878 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-01-10 07:06:24,878 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-01-10 07:06:24,878 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~z_ref~0!base,]]] [2025-01-10 07:06:24,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:06:24,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:06:24,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:06:24,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:24,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:06:24,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 07:06:24,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:06:24,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:06:24,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:06:24,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:24,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:06:24,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 07:06:24,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:06:25,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:06:25,073 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-01-10 07:06:25,074 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:06:25,164 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 45 states and 63 transitions. Complement of second has 10 states. [2025-01-10 07:06:25,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-01-10 07:06:25,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:06:25,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2025-01-10 07:06:25,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 32 transitions. Stem has 2 letters. Loop has 5 letters. [2025-01-10 07:06:25,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:06:25,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 32 transitions. Stem has 7 letters. Loop has 5 letters. [2025-01-10 07:06:25,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:06:25,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 32 transitions. Stem has 2 letters. Loop has 10 letters. [2025-01-10 07:06:25,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:06:25,174 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 63 transitions. [2025-01-10 07:06:25,178 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2025-01-10 07:06:25,179 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 29 states and 43 transitions. [2025-01-10 07:06:25,180 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2025-01-10 07:06:25,180 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2025-01-10 07:06:25,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 43 transitions. [2025-01-10 07:06:25,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:06:25,182 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 43 transitions. [2025-01-10 07:06:25,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 43 transitions. [2025-01-10 07:06:25,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2025-01-10 07:06:25,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 27 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:06:25,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 41 transitions. [2025-01-10 07:06:25,202 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 41 transitions. [2025-01-10 07:06:25,202 INFO L432 stractBuchiCegarLoop]: Abstraction has 28 states and 41 transitions. [2025-01-10 07:06:25,202 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-01-10 07:06:25,202 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 41 transitions. [2025-01-10 07:06:25,203 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2025-01-10 07:06:25,203 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:06:25,203 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:06:25,203 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-01-10 07:06:25,203 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-01-10 07:06:25,203 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~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~ret21#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1, test_fun_#in~z#1 := main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~short10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_#t~mem13#1, test_fun_#t~mem14#1, test_fun_#t~mem15#1, test_fun_#t~mem16#1, test_fun_#t~mem17#1, test_fun_~x#1, test_fun_~y#1, test_fun_~z#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;test_fun_~z#1 := test_fun_#in~z#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset;call write~int#3(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#2(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(test_fun_~z#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int#0(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4);" "call test_fun_#t~mem6#1 := read~int#3(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short10#1 := test_fun_#t~mem6#1 > test_fun_#t~mem7#1;" [2025-01-10 07:06:25,203 INFO L754 eck$LassoCheckResult]: Loop: "assume !test_fun_#t~short10#1;call test_fun_#t~mem8#1 := read~int#2(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem9#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short10#1 := test_fun_#t~mem8#1 > test_fun_#t~mem9#1;" "assume test_fun_#t~short10#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~mem9#1;havoc test_fun_#t~short10#1;" "call test_fun_#t~mem11#1 := read~int#3(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem12#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);" "assume test_fun_#t~mem11#1 > test_fun_#t~mem12#1;havoc test_fun_#t~mem11#1;havoc test_fun_#t~mem12#1;call test_fun_#t~mem13#1 := read~int#3(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#3(test_fun_#t~mem13#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem13#1;" "call test_fun_#t~mem6#1 := read~int#3(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short10#1 := test_fun_#t~mem6#1 > test_fun_#t~mem7#1;" [2025-01-10 07:06:25,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:06:25,206 INFO L85 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 1 times [2025-01-10 07:06:25,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:06:25,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913807189] [2025-01-10 07:06:25,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:06:25,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:06:25,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:06:25,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:06:25,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:25,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:25,246 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:06:25,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:06:25,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:06:25,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:25,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:25,261 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:06:25,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:06:25,261 INFO L85 PathProgramCache]: Analyzing trace with hash 39253694, now seen corresponding path program 1 times [2025-01-10 07:06:25,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:06:25,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492861267] [2025-01-10 07:06:25,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:06:25,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:06:25,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:06:25,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:06:25,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:25,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:25,274 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:06:25,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:06:25,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:06:25,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:25,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:25,281 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:06:25,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:06:25,282 INFO L85 PathProgramCache]: Analyzing trace with hash 149952348, now seen corresponding path program 1 times [2025-01-10 07:06:25,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:06:25,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167873064] [2025-01-10 07:06:25,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:06:25,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:06:25,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:06:25,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:06:25,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:25,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:06:25,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:06:25,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:06:25,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167873064] [2025-01-10 07:06:25,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167873064] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:06:25,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:06:25,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 07:06:25,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145111088] [2025-01-10 07:06:25,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:06:25,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:06:25,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 07:06:25,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 07:06:25,658 INFO L87 Difference]: Start difference. First operand 28 states and 41 transitions. cyclomatic complexity: 16 Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:06:25,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:06:25,696 INFO L93 Difference]: Finished difference Result 42 states and 59 transitions. [2025-01-10 07:06:25,696 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 59 transitions. [2025-01-10 07:06:25,697 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 18 [2025-01-10 07:06:25,697 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 30 states and 41 transitions. [2025-01-10 07:06:25,698 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2025-01-10 07:06:25,698 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2025-01-10 07:06:25,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 41 transitions. [2025-01-10 07:06:25,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:06:25,698 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 41 transitions. [2025-01-10 07:06:25,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 41 transitions. [2025-01-10 07:06:25,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 16. [2025-01-10 07:06:25,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:06:25,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2025-01-10 07:06:25,699 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 22 transitions. [2025-01-10 07:06:25,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 07:06:25,701 INFO L432 stractBuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2025-01-10 07:06:25,701 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-01-10 07:06:25,701 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2025-01-10 07:06:25,702 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-01-10 07:06:25,702 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:06:25,702 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:06:25,702 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-01-10 07:06:25,702 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-01-10 07:06:25,702 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~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~ret21#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1, test_fun_#in~z#1 := main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~short10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_#t~mem13#1, test_fun_#t~mem14#1, test_fun_#t~mem15#1, test_fun_#t~mem16#1, test_fun_#t~mem17#1, test_fun_~x#1, test_fun_~y#1, test_fun_~z#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;test_fun_~z#1 := test_fun_#in~z#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset;call write~int#3(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#2(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(test_fun_~z#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int#0(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4);" "call test_fun_#t~mem6#1 := read~int#3(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short10#1 := test_fun_#t~mem6#1 > test_fun_#t~mem7#1;" [2025-01-10 07:06:25,702 INFO L754 eck$LassoCheckResult]: Loop: "assume test_fun_#t~short10#1;" "assume test_fun_#t~short10#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~mem9#1;havoc test_fun_#t~short10#1;" "call test_fun_#t~mem11#1 := read~int#3(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem12#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);" "assume !(test_fun_#t~mem11#1 > test_fun_#t~mem12#1);havoc test_fun_#t~mem11#1;havoc test_fun_#t~mem12#1;call test_fun_#t~mem14#1 := read~int#2(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem15#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);" "assume test_fun_#t~mem14#1 > test_fun_#t~mem15#1;havoc test_fun_#t~mem14#1;havoc test_fun_#t~mem15#1;call test_fun_#t~mem16#1 := read~int#2(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#2(test_fun_#t~mem16#1 - 1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem16#1;" "call test_fun_#t~mem6#1 := read~int#3(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short10#1 := test_fun_#t~mem6#1 > test_fun_#t~mem7#1;" [2025-01-10 07:06:25,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:06:25,703 INFO L85 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 2 times [2025-01-10 07:06:25,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:06:25,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564000127] [2025-01-10 07:06:25,703 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:06:25,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:06:25,715 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:06:25,733 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:06:25,734 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:06:25,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:25,734 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:06:25,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:06:25,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:06:25,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:25,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:25,752 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:06:25,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:06:25,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1159608791, now seen corresponding path program 1 times [2025-01-10 07:06:25,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:06:25,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365439562] [2025-01-10 07:06:25,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:06:25,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:06:25,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:06:25,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:06:25,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:25,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:25,766 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:06:25,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:06:25,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:06:25,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:25,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:25,774 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:06:25,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:06:25,777 INFO L85 PathProgramCache]: Analyzing trace with hash 296299769, now seen corresponding path program 1 times [2025-01-10 07:06:25,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:06:25,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229445602] [2025-01-10 07:06:25,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:06:25,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:06:25,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 07:06:25,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 07:06:25,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:25,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:06:25,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:06:25,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:06:25,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229445602] [2025-01-10 07:06:25,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229445602] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:06:25,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:06:25,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 07:06:25,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914403388] [2025-01-10 07:06:25,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:06:26,017 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-01-10 07:06:26,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:06:26,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 07:06:26,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 07:06:26,072 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 8 Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:06:26,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:06:26,096 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2025-01-10 07:06:26,097 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2025-01-10 07:06:26,097 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-01-10 07:06:26,097 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 14 states and 17 transitions. [2025-01-10 07:06:26,097 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-01-10 07:06:26,097 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-01-10 07:06:26,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2025-01-10 07:06:26,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:06:26,097 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 17 transitions. [2025-01-10 07:06:26,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2025-01-10 07:06:26,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-01-10 07:06:26,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:06:26,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2025-01-10 07:06:26,098 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 17 transitions. [2025-01-10 07:06:26,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 07:06:26,099 INFO L432 stractBuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2025-01-10 07:06:26,099 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-01-10 07:06:26,099 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2025-01-10 07:06:26,099 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-01-10 07:06:26,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:06:26,099 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:06:26,099 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-01-10 07:06:26,099 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-01-10 07:06:26,099 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~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~ret21#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1, test_fun_#in~z#1 := main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~short10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_#t~mem13#1, test_fun_#t~mem14#1, test_fun_#t~mem15#1, test_fun_#t~mem16#1, test_fun_#t~mem17#1, test_fun_~x#1, test_fun_~y#1, test_fun_~z#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;test_fun_~z#1 := test_fun_#in~z#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset;call write~int#3(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#2(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(test_fun_~z#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int#0(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4);" "call test_fun_#t~mem6#1 := read~int#3(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short10#1 := test_fun_#t~mem6#1 > test_fun_#t~mem7#1;" [2025-01-10 07:06:26,100 INFO L754 eck$LassoCheckResult]: Loop: "assume !test_fun_#t~short10#1;call test_fun_#t~mem8#1 := read~int#2(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem9#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short10#1 := test_fun_#t~mem8#1 > test_fun_#t~mem9#1;" "assume test_fun_#t~short10#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~mem9#1;havoc test_fun_#t~short10#1;" "call test_fun_#t~mem11#1 := read~int#3(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem12#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);" "assume !(test_fun_#t~mem11#1 > test_fun_#t~mem12#1);havoc test_fun_#t~mem11#1;havoc test_fun_#t~mem12#1;call test_fun_#t~mem14#1 := read~int#2(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem15#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);" "assume test_fun_#t~mem14#1 > test_fun_#t~mem15#1;havoc test_fun_#t~mem14#1;havoc test_fun_#t~mem15#1;call test_fun_#t~mem16#1 := read~int#2(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#2(test_fun_#t~mem16#1 - 1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem16#1;" "call test_fun_#t~mem6#1 := read~int#3(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short10#1 := test_fun_#t~mem6#1 > test_fun_#t~mem7#1;" [2025-01-10 07:06:26,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:06:26,100 INFO L85 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 3 times [2025-01-10 07:06:26,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:06:26,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264952746] [2025-01-10 07:06:26,100 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:06:26,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:06:26,108 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:06:26,113 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:06:26,113 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 07:06:26,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:26,113 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:06:26,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:06:26,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:06:26,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:26,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:26,121 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:06:26,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:06:26,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1216867093, now seen corresponding path program 1 times [2025-01-10 07:06:26,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:06:26,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373077858] [2025-01-10 07:06:26,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:06:26,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:06:26,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:06:26,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:06:26,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:26,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:26,127 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:06:26,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:06:26,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:06:26,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:26,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:26,134 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:06:26,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:06:26,135 INFO L85 PathProgramCache]: Analyzing trace with hash 353558071, now seen corresponding path program 1 times [2025-01-10 07:06:26,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:06:26,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004713932] [2025-01-10 07:06:26,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:06:26,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:06:26,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 07:06:26,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 07:06:26,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:26,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:26,157 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:06:26,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 07:06:26,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 07:06:26,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:26,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:26,175 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:06:26,909 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:06:26,909 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:06:26,909 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:06:26,909 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:06:26,909 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:06:26,909 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:26,909 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:06:26,909 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:06:26,909 INFO L132 ssoRankerPreferences]: Filename of dumped script: b.13-alloca.i_Iteration4_Lasso [2025-01-10 07:06:26,909 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:06:26,909 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:06:26,911 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:26,916 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:26,917 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:26,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:26,920 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:27,377 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:27,386 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:27,387 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:27,389 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:27,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:27,391 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:27,397 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:27,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:27,399 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:27,400 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:27,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:27,402 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:27,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:27,745 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:06:27,745 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:06:27,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:27,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:27,748 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-01-10 07:06:27,748 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-01-10 07:06:27,749 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:06:27,759 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:27,760 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:06:27,760 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:27,760 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:27,760 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:27,760 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:06:27,760 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:06:27,761 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:27,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-01-10 07:06:27,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:27,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:27,769 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-01-10 07:06:27,769 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-01-10 07:06:27,770 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:06:27,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:27,781 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:06:27,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:27,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:27,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:27,781 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:06:27,781 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:06:27,782 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:27,788 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-01-10 07:06:27,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:27,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:27,790 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-01-10 07:06:27,790 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-01-10 07:06:27,791 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:06:27,801 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:27,801 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:06:27,801 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:27,801 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:27,801 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:27,801 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:06:27,801 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:06:27,802 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:27,807 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-01-10 07:06:27,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:27,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:27,809 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-01-10 07:06:27,810 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-01-10 07:06:27,810 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:06:27,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:27,820 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:06:27,820 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:27,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:27,820 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:27,820 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:06:27,820 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:06:27,821 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:27,826 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-01-10 07:06:27,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:27,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:27,828 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-01-10 07:06:27,829 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-01-10 07:06:27,830 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:06:27,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:27,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:27,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:27,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:27,844 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:06:27,844 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:06:27,851 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:27,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-01-10 07:06:27,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:27,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:27,859 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-01-10 07:06:27,860 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-01-10 07:06:27,861 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:06:27,870 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:27,870 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:27,870 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:27,870 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:27,872 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:06:27,872 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:06:27,874 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:27,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-01-10 07:06:27,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:27,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:27,883 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-01-10 07:06:27,884 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-01-10 07:06:27,885 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:06:27,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:27,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:27,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:27,895 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:27,895 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:06:27,896 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:06:27,898 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:27,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-01-10 07:06:27,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:27,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:27,910 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-01-10 07:06:27,910 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-01-10 07:06:27,911 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:06:27,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:27,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:27,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:27,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:27,924 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:06:27,924 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:06:27,928 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:27,934 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-01-10 07:06:27,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:27,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:27,936 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-01-10 07:06:27,937 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-01-10 07:06:27,938 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:06:27,948 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:27,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:27,948 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:27,948 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:27,950 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:06:27,950 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:06:27,953 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:27,959 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-01-10 07:06:27,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:27,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:27,961 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-01-10 07:06:27,961 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-01-10 07:06:27,962 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:06:27,972 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:27,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:27,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:27,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:27,973 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:06:27,973 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:06:27,976 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:27,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-01-10 07:06:27,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:27,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:27,984 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-01-10 07:06:27,986 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-01-10 07:06:27,987 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:06:27,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:27,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:27,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:27,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:27,999 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:06:27,999 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:06:28,003 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:28,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-01-10 07:06:28,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:28,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:28,012 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-01-10 07:06:28,014 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-01-10 07:06:28,015 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:06:28,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:28,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:28,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:28,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:28,028 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:06:28,028 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:06:28,032 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:28,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-01-10 07:06:28,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:28,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:28,041 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-01-10 07:06:28,042 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-01-10 07:06:28,044 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:06:28,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:28,055 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-01-10 07:06:28,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:28,055 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:28,060 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-01-10 07:06:28,060 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:06:28,070 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:06:28,090 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2025-01-10 07:06:28,090 INFO L444 ModelExtractionUtils]: 9 out of 25 variables were initially zero. Simplification set additionally 13 variables to zero. [2025-01-10 07:06:28,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:28,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:28,092 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-01-10 07:06:28,094 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-01-10 07:06:28,094 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:06:28,105 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-01-10 07:06:28,105 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:06:28,105 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#2 ULTIMATE.start_test_fun_~y_ref~0#1.base) 0)_1, v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~z_ref~0#1.base) ULTIMATE.start_test_fun_~z_ref~0#1.offset)_2) = 1*v_rep(select (select #memory_int#2 ULTIMATE.start_test_fun_~y_ref~0#1.base) 0)_1 - 1*v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~z_ref~0#1.base) ULTIMATE.start_test_fun_~z_ref~0#1.offset)_2 Supporting invariants [] [2025-01-10 07:06:28,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-01-10 07:06:28,192 INFO L156 tatePredicateManager]: 37 out of 38 supporting invariants were superfluous and have been removed [2025-01-10 07:06:28,194 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-01-10 07:06:28,194 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-01-10 07:06:28,194 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~z_ref~0!base,]]] [2025-01-10 07:06:28,194 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-01-10 07:06:28,194 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-01-10 07:06:28,194 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] [2025-01-10 07:06:28,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:06:28,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:06:28,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:06:28,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:28,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:06:28,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 07:06:28,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:06:28,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:06:28,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:06:28,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:28,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:06:28,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 07:06:28,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:06:28,338 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 55 treesize of output 28 [2025-01-10 07:06:28,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:06:28,353 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-01-10 07:06:28,354 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:06:28,414 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 42 transitions. Complement of second has 9 states. [2025-01-10 07:06:28,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2025-01-10 07:06:28,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:06:28,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2025-01-10 07:06:28,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 3 letters. Loop has 6 letters. [2025-01-10 07:06:28,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:06:28,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 9 letters. Loop has 6 letters. [2025-01-10 07:06:28,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:06:28,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 3 letters. Loop has 12 letters. [2025-01-10 07:06:28,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:06:28,416 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 42 transitions. [2025-01-10 07:06:28,416 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-01-10 07:06:28,417 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 42 transitions. [2025-01-10 07:06:28,417 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-01-10 07:06:28,417 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2025-01-10 07:06:28,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 42 transitions. [2025-01-10 07:06:28,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:06:28,417 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 42 transitions. [2025-01-10 07:06:28,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 42 transitions. [2025-01-10 07:06:28,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2025-01-10 07:06:28,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 28 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:06:28,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2025-01-10 07:06:28,419 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 36 transitions. [2025-01-10 07:06:28,419 INFO L432 stractBuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2025-01-10 07:06:28,419 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-01-10 07:06:28,419 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. [2025-01-10 07:06:28,419 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-01-10 07:06:28,419 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:06:28,419 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:06:28,419 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-01-10 07:06:28,420 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-01-10 07:06:28,420 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~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~ret21#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1, test_fun_#in~z#1 := main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~short10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_#t~mem13#1, test_fun_#t~mem14#1, test_fun_#t~mem15#1, test_fun_#t~mem16#1, test_fun_#t~mem17#1, test_fun_~x#1, test_fun_~y#1, test_fun_~z#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;test_fun_~z#1 := test_fun_#in~z#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset;call write~int#3(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#2(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(test_fun_~z#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int#0(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4);" "call test_fun_#t~mem6#1 := read~int#3(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short10#1 := test_fun_#t~mem6#1 > test_fun_#t~mem7#1;" "assume !test_fun_#t~short10#1;call test_fun_#t~mem8#1 := read~int#2(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem9#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short10#1 := test_fun_#t~mem8#1 > test_fun_#t~mem9#1;" [2025-01-10 07:06:28,420 INFO L754 eck$LassoCheckResult]: Loop: "assume test_fun_#t~short10#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~mem9#1;havoc test_fun_#t~short10#1;" "call test_fun_#t~mem11#1 := read~int#3(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem12#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);" "assume !(test_fun_#t~mem11#1 > test_fun_#t~mem12#1);havoc test_fun_#t~mem11#1;havoc test_fun_#t~mem12#1;call test_fun_#t~mem14#1 := read~int#2(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem15#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);" "assume !(test_fun_#t~mem14#1 > test_fun_#t~mem15#1);havoc test_fun_#t~mem14#1;havoc test_fun_#t~mem15#1;" "call test_fun_#t~mem6#1 := read~int#3(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short10#1 := test_fun_#t~mem6#1 > test_fun_#t~mem7#1;" "assume !test_fun_#t~short10#1;call test_fun_#t~mem8#1 := read~int#2(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem9#1 := read~int#1(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short10#1 := test_fun_#t~mem8#1 > test_fun_#t~mem9#1;" [2025-01-10 07:06:28,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:06:28,420 INFO L85 PathProgramCache]: Analyzing trace with hash 925640, now seen corresponding path program 1 times [2025-01-10 07:06:28,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:06:28,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066004141] [2025-01-10 07:06:28,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:06:28,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:06:28,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:06:28,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:06:28,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:28,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:28,439 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:06:28,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:06:28,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:06:28,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:28,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:28,447 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:06:28,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:06:28,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1335230895, now seen corresponding path program 1 times [2025-01-10 07:06:28,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:06:28,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184911075] [2025-01-10 07:06:28,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:06:28,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:06:28,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:06:28,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:06:28,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:28,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:28,453 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:06:28,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:06:28,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:06:28,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:28,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:28,458 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:06:28,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:06:28,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1924599754, now seen corresponding path program 1 times [2025-01-10 07:06:28,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:06:28,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716309256] [2025-01-10 07:06:28,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:06:28,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:06:28,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 07:06:28,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 07:06:28,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:28,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:06:28,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:06:28,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:06:28,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716309256] [2025-01-10 07:06:28,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716309256] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:06:28,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:06:28,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 07:06:28,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532303274] [2025-01-10 07:06:28,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:06:28,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:06:28,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 07:06:28,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 07:06:28,681 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. cyclomatic complexity: 11 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:06:28,705 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-01-10 07:06:28,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:06:28,717 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2025-01-10 07:06:28,717 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. [2025-01-10 07:06:28,717 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-01-10 07:06:28,717 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 0 states and 0 transitions. [2025-01-10 07:06:28,717 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-01-10 07:06:28,717 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-01-10 07:06:28,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-01-10 07:06:28,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:06:28,717 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 07:06:28,717 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 07:06:28,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 07:06:28,720 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 07:06:28,720 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-01-10 07:06:28,720 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-01-10 07:06:28,720 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-01-10 07:06:28,720 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-01-10 07:06:28,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.01 07:06:28 BoogieIcfgContainer [2025-01-10 07:06:28,725 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-01-10 07:06:28,725 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 07:06:28,725 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 07:06:28,726 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 07:06:28,726 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:06:22" (3/4) ... [2025-01-10 07:06:28,727 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 07:06:28,728 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 07:06:28,728 INFO L158 Benchmark]: Toolchain (without parser) took 6862.35ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 112.2MB in the beginning and 333.7MB in the end (delta: -221.6MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. [2025-01-10 07:06:28,728 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:06:28,728 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.69ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 95.7MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 07:06:28,728 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.73ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 94.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:06:28,729 INFO L158 Benchmark]: Boogie Preprocessor took 26.17ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 92.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:06:28,729 INFO L158 Benchmark]: RCFGBuilder took 254.28ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 78.5MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 07:06:28,729 INFO L158 Benchmark]: BuchiAutomizer took 6273.61ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 78.1MB in the beginning and 333.9MB in the end (delta: -255.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:06:28,729 INFO L158 Benchmark]: Witness Printer took 2.18ms. Allocated memory is still 377.5MB. Free memory was 333.8MB in the beginning and 333.7MB in the end (delta: 75.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:06:28,730 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.35ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 273.69ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 95.7MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.73ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 94.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.17ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 92.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 254.28ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 78.5MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 6273.61ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 78.1MB in the beginning and 333.9MB in the end (delta: -255.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.18ms. Allocated memory is still 377.5MB. Free memory was 333.8MB in the beginning and 333.7MB in the end (delta: 75.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~z_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~z_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (3 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 6 locations. One deterministic module has affine ranking function null and consists of 6 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.2s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 5.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 21 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 65 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 65 mSDsluCounter, 85 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 44 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 104 IncrementalHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 41 mSDtfsCounter, 104 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital278 mio100 ax106 hnf100 lsp97 ukn65 mio100 lsp26 div100 bol104 ite100 ukn100 eq160 hnf91 smp100 dnf139 smp83 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 66ms VariablesStem: 7 VariablesLoop: 10 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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-01-10 07:06:28,741 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