./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/c.01_assume-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/c.01_assume-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 252aa5e38f898b42e65698848f3b58e46a12e01218aba7e2f3e037db40adbdd2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 07:06:33,317 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 07:06:33,356 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:33,359 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 07:06:33,359 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 07:06:33,373 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 07:06:33,374 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 07:06:33,374 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 07:06:33,374 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 07:06:33,374 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 07:06:33,374 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 07:06:33,374 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 07:06:33,374 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 07:06:33,374 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-01-10 07:06:33,374 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-01-10 07:06:33,374 INFO L153 SettingsManager]: * Use old map elimination=false [2025-01-10 07:06:33,375 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-01-10 07:06:33,375 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-01-10 07:06:33,375 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-01-10 07:06:33,375 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 07:06:33,375 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-01-10 07:06:33,375 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 07:06:33,375 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 07:06:33,375 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-01-10 07:06:33,375 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-01-10 07:06:33,375 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-01-10 07:06:33,375 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 07:06:33,375 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 07:06:33,375 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-01-10 07:06:33,375 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 07:06:33,375 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 07:06:33,375 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 07:06:33,376 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 07:06:33,376 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 07:06:33,376 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 07:06:33,378 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-01-10 07:06:33,378 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 -> 252aa5e38f898b42e65698848f3b58e46a12e01218aba7e2f3e037db40adbdd2 [2025-01-10 07:06:33,556 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 07:06:33,570 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 07:06:33,573 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 07:06:33,578 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 07:06:33,579 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 07:06:33,579 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/c.01_assume-alloca.i [2025-01-10 07:06:34,855 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6e217cae1/f56e4ac8269f487cbadcdc38cc4435ec/FLAG2985502c9 [2025-01-10 07:06:35,127 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 07:06:35,128 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/c.01_assume-alloca.i [2025-01-10 07:06:35,141 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6e217cae1/f56e4ac8269f487cbadcdc38cc4435ec/FLAG2985502c9 [2025-01-10 07:06:35,402 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6e217cae1/f56e4ac8269f487cbadcdc38cc4435ec [2025-01-10 07:06:35,404 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 07:06:35,405 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 07:06:35,406 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 07:06:35,407 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 07:06:35,410 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 07:06:35,411 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:06:35" (1/1) ... [2025-01-10 07:06:35,411 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7314acf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:06:35, skipping insertion in model container [2025-01-10 07:06:35,412 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:06:35" (1/1) ... [2025-01-10 07:06:35,435 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 07:06:35,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:06:35,656 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 07:06:35,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:06:35,726 INFO L204 MainTranslator]: Completed translation [2025-01-10 07:06:35,731 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:06:35 WrapperNode [2025-01-10 07:06:35,731 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 07:06:35,732 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 07:06:35,732 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 07:06:35,732 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 07:06:35,737 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:35" (1/1) ... [2025-01-10 07:06:35,745 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:35" (1/1) ... [2025-01-10 07:06:35,759 INFO L138 Inliner]: procedures = 111, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 79 [2025-01-10 07:06:35,760 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 07:06:35,760 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 07:06:35,761 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 07:06:35,761 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 07:06:35,766 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:35" (1/1) ... [2025-01-10 07:06:35,766 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:35" (1/1) ... [2025-01-10 07:06:35,769 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:35" (1/1) ... [2025-01-10 07:06:35,778 INFO L175 MemorySlicer]: Split 14 memory accesses to 2 slices as follows [6, 8]. 57 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 5 writes are split as follows [2, 3]. [2025-01-10 07:06:35,778 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:35" (1/1) ... [2025-01-10 07:06:35,778 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:35" (1/1) ... [2025-01-10 07:06:35,781 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:35" (1/1) ... [2025-01-10 07:06:35,782 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:35" (1/1) ... [2025-01-10 07:06:35,784 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:35" (1/1) ... [2025-01-10 07:06:35,784 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:35" (1/1) ... [2025-01-10 07:06:35,785 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:35" (1/1) ... [2025-01-10 07:06:35,786 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 07:06:35,787 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 07:06:35,787 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 07:06:35,787 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 07:06:35,791 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:06:35" (1/1) ... [2025-01-10 07:06:35,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:35,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:35,813 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:35,816 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:35,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 07:06:35,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 07:06:35,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 07:06:35,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 07:06:35,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 07:06:35,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 07:06:35,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 07:06:35,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 07:06:35,897 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 07:06:35,898 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 07:06:35,978 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-01-10 07:06:35,978 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 07:06:35,984 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 07:06:35,984 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-10 07:06:35,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:06:35 BoogieIcfgContainer [2025-01-10 07:06:35,985 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 07:06:35,986 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-01-10 07:06:35,986 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-01-10 07:06:35,990 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-01-10 07:06:35,990 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:06:35,990 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.01 07:06:35" (1/3) ... [2025-01-10 07:06:35,991 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7a6fe4e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:06:35, skipping insertion in model container [2025-01-10 07:06:35,991 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:06:35,991 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:06:35" (2/3) ... [2025-01-10 07:06:35,992 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7a6fe4e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:06:35, skipping insertion in model container [2025-01-10 07:06:35,992 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:06:35,992 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:06:35" (3/3) ... [2025-01-10 07:06:35,993 INFO L363 chiAutomizerObserver]: Analyzing ICFG c.01_assume-alloca.i [2025-01-10 07:06:36,023 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-01-10 07:06:36,023 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-01-10 07:06:36,023 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-01-10 07:06:36,023 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-01-10 07:06:36,023 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-01-10 07:06:36,023 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-01-10 07:06:36,024 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-01-10 07:06:36,024 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-01-10 07:06:36,027 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:06:36,037 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2025-01-10 07:06:36,037 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:06:36,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:06:36,040 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:06:36,040 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-01-10 07:06:36,040 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-01-10 07:06:36,041 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:06:36,041 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2025-01-10 07:06:36,041 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:06:36,041 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:06:36,042 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:06:36,042 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-01-10 07:06:36,046 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#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~mem4#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~short8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#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_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#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 write~int#0(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" [2025-01-10 07:06:36,047 INFO L754 eck$LassoCheckResult]: Loop: "call test_fun_#t~mem4#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);" "assume test_fun_#t~mem4#1 >= 0;havoc test_fun_#t~mem4#1;" "call write~int#1(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" "assume !true;" "call test_fun_#t~mem12#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(test_fun_#t~mem12#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1;" [2025-01-10 07:06:36,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:06:36,050 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2025-01-10 07:06:36,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:06:36,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723629241] [2025-01-10 07:06:36,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:06:36,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:06:36,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:06:36,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:06:36,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:36,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:36,132 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:06:36,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:06:36,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:06:36,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:36,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:36,166 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:06:36,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:06:36,169 INFO L85 PathProgramCache]: Analyzing trace with hash 34452075, now seen corresponding path program 1 times [2025-01-10 07:06:36,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:06:36,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289124066] [2025-01-10 07:06:36,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:06:36,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:06:36,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:06:36,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:06:36,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:36,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:06:36,202 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:36,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:06:36,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289124066] [2025-01-10 07:06:36,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289124066] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:06:36,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:06:36,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 07:06:36,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521242678] [2025-01-10 07:06:36,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:06:36,206 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:06:36,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:06:36,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 07:06:36,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 07:06:36,228 INFO L87 Difference]: Start difference. First operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 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:36,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:06:36,233 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2025-01-10 07:06:36,234 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2025-01-10 07:06:36,234 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2025-01-10 07:06:36,238 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 11 states and 13 transitions. [2025-01-10 07:06:36,239 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-01-10 07:06:36,239 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-01-10 07:06:36,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2025-01-10 07:06:36,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:06:36,240 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 13 transitions. [2025-01-10 07:06:36,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2025-01-10 07:06:36,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-01-10 07:06:36,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:06:36,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2025-01-10 07:06:36,256 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 13 transitions. [2025-01-10 07:06:36,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 07:06:36,258 INFO L432 stractBuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2025-01-10 07:06:36,258 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-01-10 07:06:36,258 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2025-01-10 07:06:36,259 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2025-01-10 07:06:36,259 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:06:36,259 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:06:36,259 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:06:36,259 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:06:36,259 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~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#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~mem4#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~short8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#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_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#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 write~int#0(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" [2025-01-10 07:06:36,259 INFO L754 eck$LassoCheckResult]: Loop: "call test_fun_#t~mem4#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);" "assume test_fun_#t~mem4#1 >= 0;havoc test_fun_#t~mem4#1;" "call write~int#1(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" "call test_fun_#t~mem5#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1;" "assume test_fun_#t~short8#1;call test_fun_#t~mem7#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem7#1 < 1073741824;" "assume !test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1;" "call test_fun_#t~mem12#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(test_fun_#t~mem12#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1;" [2025-01-10 07:06:36,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:06:36,260 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2025-01-10 07:06:36,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:06:36,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524035418] [2025-01-10 07:06:36,260 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:06:36,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:06:36,273 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:06:36,283 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:06:36,284 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:06:36,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:36,284 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:06:36,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:06:36,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:06:36,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:36,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:36,295 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:06:36,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:06:36,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1251907465, now seen corresponding path program 1 times [2025-01-10 07:06:36,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:06:36,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937277473] [2025-01-10 07:06:36,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:06:36,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:06:36,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:06:36,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:06:36,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:36,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:06:36,445 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:36,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:06:36,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937277473] [2025-01-10 07:06:36,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937277473] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:06:36,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:06:36,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 07:06:36,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414888886] [2025-01-10 07:06:36,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:06:36,446 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:06:36,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:06:36,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 07:06:36,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 07:06:36,447 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. cyclomatic complexity: 3 Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 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:36,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:06:36,518 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2025-01-10 07:06:36,518 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 25 transitions. [2025-01-10 07:06:36,518 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2025-01-10 07:06:36,519 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 25 transitions. [2025-01-10 07:06:36,519 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2025-01-10 07:06:36,519 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2025-01-10 07:06:36,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 25 transitions. [2025-01-10 07:06:36,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:06:36,519 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 25 transitions. [2025-01-10 07:06:36,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 25 transitions. [2025-01-10 07:06:36,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 14. [2025-01-10 07:06:36,520 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:36,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2025-01-10 07:06:36,520 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 17 transitions. [2025-01-10 07:06:36,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 07:06:36,523 INFO L432 stractBuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2025-01-10 07:06:36,524 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-01-10 07:06:36,524 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2025-01-10 07:06:36,524 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2025-01-10 07:06:36,525 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:06:36,525 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:06:36,525 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:06:36,526 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:06:36,526 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~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#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~mem4#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~short8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#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_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#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 write~int#0(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" [2025-01-10 07:06:36,526 INFO L754 eck$LassoCheckResult]: Loop: "call test_fun_#t~mem4#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);" "assume test_fun_#t~mem4#1 >= 0;havoc test_fun_#t~mem4#1;" "call write~int#1(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" "call test_fun_#t~mem5#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1;" "assume !test_fun_#t~short8#1;" "assume !test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1;" "call test_fun_#t~mem12#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(test_fun_#t~mem12#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1;" [2025-01-10 07:06:36,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:06:36,526 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2025-01-10 07:06:36,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:06:36,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590028424] [2025-01-10 07:06:36,526 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:06:36,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:06:36,536 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:06:36,542 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:06:36,542 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 07:06:36,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:36,542 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:06:36,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:06:36,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:06:36,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:36,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:36,550 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:06:36,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:06:36,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1251905543, now seen corresponding path program 1 times [2025-01-10 07:06:36,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:06:36,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606709035] [2025-01-10 07:06:36,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:06:36,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:06:36,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:06:36,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:06:36,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:36,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:36,561 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:06:36,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:06:36,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:06:36,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:36,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:36,567 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:06:36,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:06:36,568 INFO L85 PathProgramCache]: Analyzing trace with hash 294391287, now seen corresponding path program 1 times [2025-01-10 07:06:36,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:06:36,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415400657] [2025-01-10 07:06:36,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:06:36,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:06:36,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 07:06:36,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 07:06:36,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:36,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:36,584 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:06:36,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 07:06:36,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 07:06:36,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:36,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:36,595 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:06:36,939 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:06:36,940 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:06:36,940 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:06:36,940 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:06:36,940 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:06:36,940 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:36,940 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:06:36,940 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:06:36,941 INFO L132 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca.i_Iteration3_Lasso [2025-01-10 07:06:36,941 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:06:36,941 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:06:36,950 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:36,955 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:36,957 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:36,959 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:36,961 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:37,168 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:37,171 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:37,173 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:37,175 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:37,176 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:37,178 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:37,180 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:37,182 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:37,184 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:37,185 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:37,187 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:37,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:37,414 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:06:37,417 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:06:37,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:37,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:37,427 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:37,432 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:37,433 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:06:37,455 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:37,456 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:06:37,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:37,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:37,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:37,462 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:06:37,462 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:06:37,466 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:37,479 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:37,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:37,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:37,488 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:37,489 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:37,490 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:06:37,503 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:37,503 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:06:37,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:37,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:37,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:37,504 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:06:37,504 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:06:37,506 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:37,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-01-10 07:06:37,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:37,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:37,517 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:37,519 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:37,521 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:06:37,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:37,531 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:06:37,531 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:37,531 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:37,531 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:37,532 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:06:37,532 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:06:37,533 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:37,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-01-10 07:06:37,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:37,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:37,545 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:37,549 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:37,550 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:06:37,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:37,574 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:06:37,574 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:37,574 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:37,574 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:37,575 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:06:37,575 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:06:37,577 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:37,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-01-10 07:06:37,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:37,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:37,591 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:37,593 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:37,596 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:06:37,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:37,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:37,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:37,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:37,630 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:06:37,630 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:06:37,641 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:37,654 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:37,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:37,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:37,656 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:37,661 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:37,662 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:06:37,683 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:37,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:37,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:37,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:37,686 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:06:37,686 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:06:37,694 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:37,707 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:37,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:37,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:37,714 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:37,716 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:37,720 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:06:37,737 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:37,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:37,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:37,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:37,747 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:06:37,747 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:06:37,758 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:37,768 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:37,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:37,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:37,771 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:37,771 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:37,773 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:37,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:37,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:37,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:37,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:37,799 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:06:37,799 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:06:37,810 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:37,820 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:37,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:37,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:37,822 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:37,824 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:37,825 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:37,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:37,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:37,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:37,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:37,838 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:06:37,838 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:06:37,843 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:37,849 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:37,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:37,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:37,851 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:37,852 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:37,858 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:37,868 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:37,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:37,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:37,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:37,871 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:06:37,871 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:06:37,874 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:37,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-01-10 07:06:37,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:37,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:37,887 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:37,888 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:37,889 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:37,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:37,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:37,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:37,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:37,903 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:06:37,903 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:06:37,909 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:06:37,920 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-01-10 07:06:37,922 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-01-10 07:06:37,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:37,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:37,925 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:37,931 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:37,933 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:06:37,944 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-01-10 07:06:37,944 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:06:37,945 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~x_ref~0#1.base) 0)_1) = 2*v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~x_ref~0#1.base) 0)_1 + 1 Supporting invariants [] [2025-01-10 07:06:37,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-01-10 07:06:37,974 INFO L156 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2025-01-10 07:06:37,980 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-01-10 07:06:37,981 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-01-10 07:06:37,981 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2025-01-10 07:06:38,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:06:38,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:06:38,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:06:38,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:38,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:06:38,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 07:06:38,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:06:38,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:06:38,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:06:38,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:38,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:06:38,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 07:06:38,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:06:38,093 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:38,095 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:38,095 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 4 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:06:38,150 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 4. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 26 states and 33 transitions. Complement of second has 6 states. [2025-01-10 07:06:38,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-01-10 07:06:38,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:06:38,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2025-01-10 07:06:38,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 2 letters. Loop has 7 letters. [2025-01-10 07:06:38,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:06:38,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 9 letters. Loop has 7 letters. [2025-01-10 07:06:38,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:06:38,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 2 letters. Loop has 14 letters. [2025-01-10 07:06:38,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:06:38,156 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2025-01-10 07:06:38,157 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:06:38,158 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 25 states and 32 transitions. [2025-01-10 07:06:38,158 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2025-01-10 07:06:38,158 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-01-10 07:06:38,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 32 transitions. [2025-01-10 07:06:38,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:06:38,158 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 32 transitions. [2025-01-10 07:06:38,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 32 transitions. [2025-01-10 07:06:38,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2025-01-10 07:06:38,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:06:38,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2025-01-10 07:06:38,160 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 28 transitions. [2025-01-10 07:06:38,160 INFO L432 stractBuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2025-01-10 07:06:38,160 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-01-10 07:06:38,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2025-01-10 07:06:38,160 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:06:38,160 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:06:38,160 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:06:38,161 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-01-10 07:06:38,161 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-01-10 07:06:38,161 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~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#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~mem4#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~short8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#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_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#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 write~int#0(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" "call test_fun_#t~mem4#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);" "assume test_fun_#t~mem4#1 >= 0;havoc test_fun_#t~mem4#1;" "call write~int#1(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" [2025-01-10 07:06:38,161 INFO L754 eck$LassoCheckResult]: Loop: "call test_fun_#t~mem5#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1;" "assume test_fun_#t~short8#1;call test_fun_#t~mem7#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem7#1 < 1073741824;" "assume test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1;" "call test_fun_#t~mem9#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" "assume !(test_fun_#t~mem9#1 <= 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem11#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(2 * test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1;" [2025-01-10 07:06:38,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:06:38,161 INFO L85 PathProgramCache]: Analyzing trace with hash 28694791, now seen corresponding path program 1 times [2025-01-10 07:06:38,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:06:38,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473853] [2025-01-10 07:06:38,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:06:38,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:06:38,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:06:38,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:06:38,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:38,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:38,173 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:06:38,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:06:38,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:06:38,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:38,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:38,200 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:06:38,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:06:38,200 INFO L85 PathProgramCache]: Analyzing trace with hash 44950779, now seen corresponding path program 1 times [2025-01-10 07:06:38,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:06:38,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599315882] [2025-01-10 07:06:38,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:06:38,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:06:38,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-01-10 07:06:38,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:06:38,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:06:38,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:38,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:38,208 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:06:38,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:06:38,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:06:38,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:38,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:38,213 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:06:38,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:06:38,213 INFO L85 PathProgramCache]: Analyzing trace with hash 536133557, now seen corresponding path program 1 times [2025-01-10 07:06:38,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:06:38,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708933090] [2025-01-10 07:06:38,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:06:38,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:06:38,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 07:06:38,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 07:06:38,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:38,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:38,228 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:06:38,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 07:06:38,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 07:06:38,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:38,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:38,237 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:06:38,560 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:06:38,561 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:06:38,561 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:06:38,561 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:06:38,561 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:06:38,561 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:38,561 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:06:38,561 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:06:38,561 INFO L132 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca.i_Iteration4_Lasso [2025-01-10 07:06:38,561 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:06:38,561 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:06:38,563 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:38,565 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:38,566 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:38,568 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:38,570 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:38,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:38,712 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:38,714 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:38,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:38,717 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:38,719 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:38,721 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:38,722 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:38,724 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:38,725 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:38,727 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:38,729 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:38,901 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:06:38,901 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:06:38,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:38,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:38,907 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:38,911 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:38,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:38,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:38,921 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:06:38,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:38,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:38,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:38,922 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:06:38,922 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:06:38,927 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:38,932 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:38,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:38,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:38,935 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:38,939 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:38,944 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:06:38,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:38,961 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:06:38,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:38,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:38,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:38,962 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:06:38,962 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:06:38,965 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:38,974 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:38,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:38,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:38,980 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:38,981 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:38,982 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:38,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:38,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:38,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:38,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:38,993 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:06:38,993 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:06:38,995 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:39,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-01-10 07:06:39,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:39,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:39,004 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:39,004 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:39,006 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:39,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:39,016 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:06:39,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:39,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:39,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:39,017 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:06:39,017 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:06:39,020 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:39,026 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:39,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:39,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:39,028 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:39,029 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:39,030 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:39,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:39,040 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:06:39,040 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:39,040 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:39,040 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:39,041 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:06:39,041 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:06:39,043 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:39,049 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:39,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:39,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:39,052 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:39,053 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:39,053 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:39,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:39,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:39,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:39,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:39,066 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:06:39,066 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:06:39,073 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:39,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-01-10 07:06:39,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:39,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:39,089 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:39,094 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:39,095 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:06:39,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:39,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:39,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:39,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:39,115 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:06:39,115 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:06:39,127 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:06:39,157 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-01-10 07:06:39,158 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-01-10 07:06:39,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:39,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:39,162 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:39,163 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:39,163 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:06:39,178 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-01-10 07:06:39,178 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:06:39,178 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~y_ref~0#1.base) ULTIMATE.start_test_fun_~y_ref~0#1.offset)_2) = -2*v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~y_ref~0#1.base) ULTIMATE.start_test_fun_~y_ref~0#1.offset)_2 + 2147483647 Supporting invariants [] [2025-01-10 07:06:39,191 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:39,209 INFO L156 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2025-01-10 07:06:39,211 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-01-10 07:06:39,211 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-01-10 07:06:39,211 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] [2025-01-10 07:06:39,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:06:39,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:06:39,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:06:39,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:39,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:06:39,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:06:39,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:06:39,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:06:39,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:06:39,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:39,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:06:39,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 07:06:39,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:06:39,305 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:39,306 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2025-01-10 07:06:39,306 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 8 Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 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:39,346 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 8. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 62 states and 78 transitions. Complement of second has 11 states. [2025-01-10 07:06:39,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2025-01-10 07:06:39,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 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:39,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2025-01-10 07:06:39,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 5 letters. Loop has 5 letters. [2025-01-10 07:06:39,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:06:39,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 10 letters. Loop has 5 letters. [2025-01-10 07:06:39,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:06:39,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 5 letters. Loop has 10 letters. [2025-01-10 07:06:39,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:06:39,348 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 78 transitions. [2025-01-10 07:06:39,349 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:06:39,350 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 41 states and 52 transitions. [2025-01-10 07:06:39,350 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2025-01-10 07:06:39,350 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2025-01-10 07:06:39,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 52 transitions. [2025-01-10 07:06:39,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:06:39,350 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 52 transitions. [2025-01-10 07:06:39,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 52 transitions. [2025-01-10 07:06:39,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2025-01-10 07:06:39,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 32 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:06:39,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2025-01-10 07:06:39,352 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 42 transitions. [2025-01-10 07:06:39,352 INFO L432 stractBuchiCegarLoop]: Abstraction has 33 states and 42 transitions. [2025-01-10 07:06:39,352 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-01-10 07:06:39,352 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 42 transitions. [2025-01-10 07:06:39,352 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:06:39,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:06:39,353 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:06:39,353 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 07:06:39,353 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-01-10 07:06:39,353 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~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#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~mem4#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~short8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#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_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#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 write~int#0(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" "call test_fun_#t~mem4#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);" "assume test_fun_#t~mem4#1 >= 0;havoc test_fun_#t~mem4#1;" "call write~int#1(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" "call test_fun_#t~mem5#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1;" "assume !test_fun_#t~short8#1;" "assume !test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1;" "call test_fun_#t~mem12#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(test_fun_#t~mem12#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1;" "call test_fun_#t~mem4#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);" "assume test_fun_#t~mem4#1 >= 0;havoc test_fun_#t~mem4#1;" "call write~int#1(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" [2025-01-10 07:06:39,353 INFO L754 eck$LassoCheckResult]: Loop: "call test_fun_#t~mem5#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1;" "assume test_fun_#t~short8#1;call test_fun_#t~mem7#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem7#1 < 1073741824;" "assume test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1;" "call test_fun_#t~mem9#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" "assume !(test_fun_#t~mem9#1 <= 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem11#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(2 * test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1;" [2025-01-10 07:06:39,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:06:39,353 INFO L85 PathProgramCache]: Analyzing trace with hash -112381357, now seen corresponding path program 2 times [2025-01-10 07:06:39,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:06:39,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029234041] [2025-01-10 07:06:39,354 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:06:39,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:06:39,360 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-01-10 07:06:39,369 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 07:06:39,369 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:06:39,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:39,369 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:06:39,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 07:06:39,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 07:06:39,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:39,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:39,378 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:06:39,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:06:39,378 INFO L85 PathProgramCache]: Analyzing trace with hash 44950779, now seen corresponding path program 2 times [2025-01-10 07:06:39,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:06:39,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287252063] [2025-01-10 07:06:39,379 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:06:39,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:06:39,382 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:06:39,385 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:06:39,385 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:06:39,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:39,385 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:06:39,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:06:39,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:06:39,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:39,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:39,390 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:06:39,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:06:39,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1346546199, now seen corresponding path program 1 times [2025-01-10 07:06:39,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:06:39,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253574458] [2025-01-10 07:06:39,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:06:39,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:06:39,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 07:06:39,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 07:06:39,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:39,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:06:39,457 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:39,683 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:06:39,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:06:39,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253574458] [2025-01-10 07:06:39,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253574458] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:06:39,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830477285] [2025-01-10 07:06:39,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:06:39,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:06:39,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:39,689 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:06:39,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-01-10 07:06:39,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 07:06:39,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 07:06:39,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:39,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:06:39,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-10 07:06:39,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:06:39,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 07:06:39,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-10 07:06:39,889 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 25 treesize of output 13 [2025-01-10 07:06:39,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-10 07:06:39,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-10 07:06:39,944 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:06:39,944 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:06:39,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2025-01-10 07:06:40,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-10 07:06:40,042 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:06:40,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830477285] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:06:40,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:06:40,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2025-01-10 07:06:40,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434621177] [2025-01-10 07:06:40,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:06:40,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:06:40,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-10 07:06:40,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2025-01-10 07:06:40,143 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. cyclomatic complexity: 12 Second operand has 20 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:06:40,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:06:40,401 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2025-01-10 07:06:40,401 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 102 states and 115 transitions. [2025-01-10 07:06:40,402 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:06:40,404 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 102 states to 60 states and 65 transitions. [2025-01-10 07:06:40,404 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2025-01-10 07:06:40,404 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2025-01-10 07:06:40,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 65 transitions. [2025-01-10 07:06:40,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:06:40,404 INFO L218 hiAutomatonCegarLoop]: Abstraction has 60 states and 65 transitions. [2025-01-10 07:06:40,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 65 transitions. [2025-01-10 07:06:40,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2025-01-10 07:06:40,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.119047619047619) internal successors, (47), 41 states have internal predecessors, (47), 0 states have call successors, (0), 0 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:40,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2025-01-10 07:06:40,407 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 47 transitions. [2025-01-10 07:06:40,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-10 07:06:40,407 INFO L432 stractBuchiCegarLoop]: Abstraction has 42 states and 47 transitions. [2025-01-10 07:06:40,407 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-01-10 07:06:40,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 47 transitions. [2025-01-10 07:06:40,408 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:06:40,408 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:06:40,408 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:06:40,409 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 07:06:40,409 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-01-10 07:06:40,409 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~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#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~mem4#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~short8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#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_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#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 write~int#0(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" "call test_fun_#t~mem4#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);" "assume test_fun_#t~mem4#1 >= 0;havoc test_fun_#t~mem4#1;" "call write~int#1(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" "call test_fun_#t~mem5#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1;" "assume test_fun_#t~short8#1;call test_fun_#t~mem7#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem7#1 < 1073741824;" "assume test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1;" "call test_fun_#t~mem9#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" "assume !(test_fun_#t~mem9#1 <= 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem11#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(2 * test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1;" "call test_fun_#t~mem5#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1;" "assume test_fun_#t~short8#1;call test_fun_#t~mem7#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem7#1 < 1073741824;" "assume test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1;" "call test_fun_#t~mem9#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" "assume !(test_fun_#t~mem9#1 <= 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem11#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(2 * test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1;" "call test_fun_#t~mem5#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1;" "assume !test_fun_#t~short8#1;" "assume !test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1;" "call test_fun_#t~mem12#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(test_fun_#t~mem12#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1;" "call test_fun_#t~mem4#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);" "assume test_fun_#t~mem4#1 >= 0;havoc test_fun_#t~mem4#1;" "call write~int#1(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" [2025-01-10 07:06:40,409 INFO L754 eck$LassoCheckResult]: Loop: "call test_fun_#t~mem5#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem5#1 > test_fun_#t~mem6#1;" "assume test_fun_#t~short8#1;call test_fun_#t~mem7#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short8#1 := test_fun_#t~mem7#1 < 1073741824;" "assume test_fun_#t~short8#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short8#1;" "call test_fun_#t~mem9#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);" "assume !(test_fun_#t~mem9#1 <= 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem11#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(2 * test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1;" [2025-01-10 07:06:40,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:06:40,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1758485907, now seen corresponding path program 2 times [2025-01-10 07:06:40,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:06:40,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096079465] [2025-01-10 07:06:40,410 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:06:40,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:06:40,419 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-01-10 07:06:40,429 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 07:06:40,430 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:06:40,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:40,430 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:06:40,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 07:06:40,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 07:06:40,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:40,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:40,443 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:06:40,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:06:40,443 INFO L85 PathProgramCache]: Analyzing trace with hash 44950779, now seen corresponding path program 3 times [2025-01-10 07:06:40,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:06:40,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560501748] [2025-01-10 07:06:40,444 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:06:40,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:06:40,447 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:06:40,449 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:06:40,449 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 07:06:40,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:40,450 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:06:40,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:06:40,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:06:40,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:40,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:40,453 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:06:40,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:06:40,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1202926249, now seen corresponding path program 3 times [2025-01-10 07:06:40,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:06:40,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549734773] [2025-01-10 07:06:40,454 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:06:40,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:06:40,463 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 4 equivalence classes. [2025-01-10 07:06:40,481 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 07:06:40,481 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-10 07:06:40,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:40,481 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:06:40,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 07:06:40,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 07:06:40,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:40,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:06:40,500 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:06:41,466 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:06:41,466 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:06:41,466 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:06:41,466 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:06:41,466 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:06:41,466 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:41,466 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:06:41,466 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:06:41,466 INFO L132 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca.i_Iteration6_Lasso [2025-01-10 07:06:41,466 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:06:41,467 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:06:41,468 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:41,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:41,472 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:41,473 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:41,475 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:41,477 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:41,478 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:41,480 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:41,481 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:41,483 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:41,484 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:41,486 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:41,637 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:41,639 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:41,641 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:41,642 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:41,644 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:06:41,809 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:06:41,809 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:06:41,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:41,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:41,813 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:41,814 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:41,816 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:41,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:41,825 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:06:41,825 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:41,825 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:41,825 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:41,826 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:06:41,826 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:06:41,827 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:41,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-01-10 07:06:41,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:41,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:41,834 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:41,835 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:41,837 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:41,847 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:41,847 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:06:41,847 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:41,847 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:41,847 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:41,848 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:06:41,848 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:06:41,849 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:41,855 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:41,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:41,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:41,857 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:41,858 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:41,860 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:41,869 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:41,869 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:06:41,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:41,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:41,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:41,870 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:06:41,870 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:06:41,871 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:41,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-01-10 07:06:41,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:41,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:41,880 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:41,882 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:41,882 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:41,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:41,892 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:06:41,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:41,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:41,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:41,893 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:06:41,893 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:06:41,894 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:41,902 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:41,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:41,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:41,907 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:41,908 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:41,910 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:41,920 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:41,920 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:41,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:41,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:41,922 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:06:41,922 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:06:41,925 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:41,934 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:41,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:41,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:41,937 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:41,937 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:41,939 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:41,949 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:41,949 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:06:41,949 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:41,949 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:41,949 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:41,949 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:06:41,950 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:06:41,951 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:41,956 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:41,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:41,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:41,959 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:41,960 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:41,961 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:06:41,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:41,972 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:06:41,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:41,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:41,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:41,972 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:06:41,972 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:06:41,973 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:41,979 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:41,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:41,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:41,983 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:41,984 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:41,985 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:41,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:41,995 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:06:41,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:41,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:41,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:41,995 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:06:41,995 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:06:41,996 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:42,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-01-10 07:06:42,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:42,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:42,004 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:06:42,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-01-10 07:06:42,007 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:42,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:42,016 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:06:42,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:42,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:42,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:42,017 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:06:42,017 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:06:42,017 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:42,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-01-10 07:06:42,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:42,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:42,026 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:06:42,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-01-10 07:06:42,028 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:06:42,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:42,038 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:06:42,038 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:42,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:42,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:42,039 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:06:42,039 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:06:42,040 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:42,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2025-01-10 07:06:42,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:42,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:42,047 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:06:42,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-01-10 07:06:42,050 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:42,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:42,060 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:06:42,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:42,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:42,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:42,061 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:06:42,061 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:06:42,062 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:42,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2025-01-10 07:06:42,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:42,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:42,070 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:06:42,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-01-10 07:06:42,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:06:42,082 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:42,082 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:42,082 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:42,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:42,095 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:06:42,095 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:06:42,107 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:06:42,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2025-01-10 07:06:42,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:42,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:42,119 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:06:42,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-01-10 07:06:42,121 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:42,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:06:42,131 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:06:42,131 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:06:42,131 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:06:42,134 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:06:42,134 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:06:42,139 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:06:42,151 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-01-10 07:06:42,151 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-01-10 07:06:42,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:06:42,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:06:42,153 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:06:42,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-01-10 07:06:42,156 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:06:42,166 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-01-10 07:06:42,166 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:06:42,167 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~y_ref~0#1.base) ULTIMATE.start_test_fun_~y_ref~0#1.offset)_3) = -2*v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~y_ref~0#1.base) ULTIMATE.start_test_fun_~y_ref~0#1.offset)_3 + 2147483647 Supporting invariants [] [2025-01-10 07:06:42,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2025-01-10 07:06:42,209 INFO L156 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2025-01-10 07:06:42,211 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-01-10 07:06:42,211 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-01-10 07:06:42,212 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] [2025-01-10 07:06:42,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:06:42,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 07:06:42,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 07:06:42,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:42,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:06:42,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:06:42,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:06:42,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:06:42,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:06:42,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:42,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:06:42,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 07:06:42,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:06:42,333 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:42,335 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2025-01-10 07:06:42,335 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 47 transitions. cyclomatic complexity: 8 Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:06:42,381 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 47 transitions. cyclomatic complexity: 8. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 65 states and 73 transitions. Complement of second has 11 states. [2025-01-10 07:06:42,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2025-01-10 07:06:42,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:06:42,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2025-01-10 07:06:42,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 22 letters. Loop has 5 letters. [2025-01-10 07:06:42,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:06:42,384 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:06:42,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:06:42,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 07:06:42,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 07:06:42,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:42,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:06:42,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:06:42,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:06:42,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:06:42,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:06:42,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:42,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:06:42,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 07:06:42,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:06:42,492 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:42,493 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2025-01-10 07:06:42,493 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 47 transitions. cyclomatic complexity: 8 Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:06:42,528 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 47 transitions. cyclomatic complexity: 8. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 65 states and 73 transitions. Complement of second has 11 states. [2025-01-10 07:06:42,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2025-01-10 07:06:42,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:06:42,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2025-01-10 07:06:42,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 22 letters. Loop has 5 letters. [2025-01-10 07:06:42,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:06:42,529 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:06:42,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:06:42,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 07:06:42,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 07:06:42,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:42,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:06:42,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:06:42,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:06:42,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:06:42,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:06:42,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:06:42,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:06:42,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 07:06:42,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:06:42,635 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:42,636 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2025-01-10 07:06:42,636 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 47 transitions. cyclomatic complexity: 8 Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:06:42,674 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 47 transitions. cyclomatic complexity: 8. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 73 states and 84 transitions. Complement of second has 10 states. [2025-01-10 07:06:42,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2025-01-10 07:06:42,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:06:42,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2025-01-10 07:06:42,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 22 letters. Loop has 5 letters. [2025-01-10 07:06:42,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:06:42,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 27 letters. Loop has 5 letters. [2025-01-10 07:06:42,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:06:42,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 22 letters. Loop has 10 letters. [2025-01-10 07:06:42,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:06:42,676 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 84 transitions. [2025-01-10 07:06:42,678 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-01-10 07:06:42,678 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 0 states and 0 transitions. [2025-01-10 07:06:42,678 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-01-10 07:06:42,678 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-01-10 07:06:42,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-01-10 07:06:42,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:06:42,678 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 07:06:42,678 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 07:06:42,678 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 07:06:42,678 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-01-10 07:06:42,678 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-01-10 07:06:42,679 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-01-10 07:06:42,679 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-01-10 07:06:42,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.01 07:06:42 BoogieIcfgContainer [2025-01-10 07:06:42,686 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-01-10 07:06:42,686 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 07:06:42,686 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 07:06:42,686 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 07:06:42,688 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:35" (3/4) ... [2025-01-10 07:06:42,689 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 07:06:42,689 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 07:06:42,690 INFO L158 Benchmark]: Toolchain (without parser) took 7285.25ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 109.0MB in the beginning and 135.7MB in the end (delta: -26.8MB). Peak memory consumption was 127.9MB. Max. memory is 16.1GB. [2025-01-10 07:06:42,690 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:06:42,690 INFO L158 Benchmark]: CACSL2BoogieTranslator took 325.98ms. Allocated memory is still 142.6MB. Free memory was 109.0MB in the beginning and 93.1MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 07:06:42,690 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.55ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 91.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:06:42,691 INFO L158 Benchmark]: Boogie Preprocessor took 25.86ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 89.9MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 07:06:42,691 INFO L158 Benchmark]: RCFGBuilder took 198.28ms. Allocated memory is still 142.6MB. Free memory was 89.9MB in the beginning and 77.2MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 07:06:42,691 INFO L158 Benchmark]: BuchiAutomizer took 6700.12ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 77.2MB in the beginning and 135.8MB in the end (delta: -58.6MB). Peak memory consumption was 94.3MB. Max. memory is 16.1GB. [2025-01-10 07:06:42,691 INFO L158 Benchmark]: Witness Printer took 3.48ms. Allocated memory is still 293.6MB. Free memory was 135.8MB in the beginning and 135.7MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:06:42,692 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.17ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 325.98ms. Allocated memory is still 142.6MB. Free memory was 109.0MB in the beginning and 93.1MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.55ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 91.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.86ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 89.9MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 198.28ms. Allocated memory is still 142.6MB. Free memory was 89.9MB in the beginning and 77.2MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 6700.12ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 77.2MB in the beginning and 135.8MB in the end (delta: -58.6MB). Peak memory consumption was 94.3MB. Max. memory is 16.1GB. * Witness Printer took 3.48ms. Allocated memory is still 293.6MB. Free memory was 135.8MB in the beginning and 135.7MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~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[~y_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[~y_ref~0!base,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function null and consists of 4 locations. One deterministic module has affine ranking function null and consists of 6 locations. One nondeterministic module has affine ranking function null and consists of 6 locations. 3 modules have a trivial ranking function, the largest among these consists of 20 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.6s and 7 iterations. TraceHistogramMax:3. Analysis of lassos took 5.4s. Construction of modules took 0.2s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 36 StatesRemovedByMinimization, 4 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, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 139 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 135 mSDsluCounter, 185 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 99 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 323 IncrementalHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 86 mSDtfsCounter, 323 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital183 mio100 ax109 hnf100 lsp91 ukn65 mio100 lsp22 div100 bol100 ite100 ukn100 eq162 hnf90 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 52ms VariablesStem: 3 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-01-10 07:06:42,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-01-10 07:06:42,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-01-10 07:06:43,106 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