./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/lis-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 48c9605d 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/array-memsafety/lis-alloca-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 319f31ab0b5c801309acd19f3e336c9a25177d3201cf5ea4438ad6227d5f71cf --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 14:30:16,148 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:30:16,192 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-02-08 14:30:16,195 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:30:16,198 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:30:16,199 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-08 14:30:16,212 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:30:16,213 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:30:16,213 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:30:16,213 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:30:16,213 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:30:16,214 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:30:16,214 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:30:16,214 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:30:16,214 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-08 14:30:16,214 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-08 14:30:16,214 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-08 14:30:16,214 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-08 14:30:16,214 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-08 14:30:16,214 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-08 14:30:16,214 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:30:16,215 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-08 14:30:16,215 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 14:30:16,215 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:30:16,215 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 14:30:16,215 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:30:16,215 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-08 14:30:16,215 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-08 14:30:16,215 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-08 14:30:16,215 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:30:16,215 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 14:30:16,215 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:30:16,215 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-08 14:30:16,216 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:30:16,216 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:30:16,216 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:30:16,216 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:30:16,216 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:30:16,216 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:30:16,216 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-08 14:30:16,216 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 319f31ab0b5c801309acd19f3e336c9a25177d3201cf5ea4438ad6227d5f71cf [2025-02-08 14:30:16,433 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:30:16,441 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:30:16,443 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:30:16,445 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:30:16,445 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:30:16,446 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2025-02-08 14:30:17,626 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e036f9b42/ccb22ad0a1fc4775addb6b65fb834d82/FLAG1c5830644 [2025-02-08 14:30:17,869 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:30:17,869 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2025-02-08 14:30:17,880 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e036f9b42/ccb22ad0a1fc4775addb6b65fb834d82/FLAG1c5830644 [2025-02-08 14:30:18,190 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e036f9b42/ccb22ad0a1fc4775addb6b65fb834d82 [2025-02-08 14:30:18,192 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:30:18,193 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:30:18,194 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:30:18,194 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:30:18,198 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:30:18,199 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:30:18" (1/1) ... [2025-02-08 14:30:18,200 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cd58d0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:30:18, skipping insertion in model container [2025-02-08 14:30:18,200 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:30:18" (1/1) ... [2025-02-08 14:30:18,226 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:30:18,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:30:18,403 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:30:18,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:30:18,449 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:30:18,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:30:18 WrapperNode [2025-02-08 14:30:18,451 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:30:18,451 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:30:18,452 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:30:18,452 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:30:18,456 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:30:18" (1/1) ... [2025-02-08 14:30:18,463 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:30:18" (1/1) ... [2025-02-08 14:30:18,478 INFO L138 Inliner]: procedures = 116, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 99 [2025-02-08 14:30:18,478 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:30:18,479 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:30:18,479 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:30:18,479 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:30:18,485 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:30:18" (1/1) ... [2025-02-08 14:30:18,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:30:18" (1/1) ... [2025-02-08 14:30:18,487 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:30:18" (1/1) ... [2025-02-08 14:30:18,497 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [2, 7, 3]. 58 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 5 writes are split as follows [2, 2, 1]. [2025-02-08 14:30:18,497 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:30:18" (1/1) ... [2025-02-08 14:30:18,498 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:30:18" (1/1) ... [2025-02-08 14:30:18,501 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:30:18" (1/1) ... [2025-02-08 14:30:18,502 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:30:18" (1/1) ... [2025-02-08 14:30:18,504 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:30:18" (1/1) ... [2025-02-08 14:30:18,508 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:30:18" (1/1) ... [2025-02-08 14:30:18,510 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:30:18,510 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:30:18,510 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:30:18,510 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:30:18,511 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:30:18" (1/1) ... [2025-02-08 14:30:18,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:18,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:18,535 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:18,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-02-08 14:30:18,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 14:30:18,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 14:30:18,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 14:30:18,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 14:30:18,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 14:30:18,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 14:30:18,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 14:30:18,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 14:30:18,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:30:18,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:30:18,627 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:30:18,629 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:30:18,751 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L539: havoc main_#t~ret20#1;call ULTIMATE.dealloc(main_#t~malloc17#1.base, main_#t~malloc17#1.offset);havoc main_#t~malloc17#1.base, main_#t~malloc17#1.offset; [2025-02-08 14:30:18,751 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L515: call ULTIMATE.dealloc(lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset);havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call ULTIMATE.dealloc(lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset);havoc lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset; [2025-02-08 14:30:18,761 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-02-08 14:30:18,761 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:30:18,768 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:30:18,769 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:30:18,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:30:18 BoogieIcfgContainer [2025-02-08 14:30:18,769 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:30:18,770 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-08 14:30:18,770 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-08 14:30:18,774 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-08 14:30:18,774 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:30:18,775 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.02 02:30:18" (1/3) ... [2025-02-08 14:30:18,775 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@112839b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:30:18, skipping insertion in model container [2025-02-08 14:30:18,775 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:30:18,776 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:30:18" (2/3) ... [2025-02-08 14:30:18,776 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@112839b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:30:18, skipping insertion in model container [2025-02-08 14:30:18,776 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:30:18,776 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:30:18" (3/3) ... [2025-02-08 14:30:18,777 INFO L363 chiAutomizerObserver]: Analyzing ICFG lis-alloca-1.i [2025-02-08 14:30:18,812 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-08 14:30:18,813 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-08 14:30:18,813 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-08 14:30:18,813 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-08 14:30:18,813 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-08 14:30:18,813 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-08 14:30:18,814 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-08 14:30:18,814 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-08 14:30:18,819 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.5625) internal successors, (25), 16 states have internal predecessors, (25), 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-02-08 14:30:18,830 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2025-02-08 14:30:18,831 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:30:18,832 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:30:18,836 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-08 14:30:18,836 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-08 14:30:18,837 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-08 14:30:18,837 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.5625) internal successors, (25), 16 states have internal predecessors, (25), 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-02-08 14:30:18,839 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2025-02-08 14:30:18,839 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:30:18,839 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:30:18,839 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-08 14:30:18,839 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-08 14:30:18,843 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~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet18#1, main_#t~post19#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0;" [2025-02-08 14:30:18,843 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1;main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" [2025-02-08 14:30:18,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:30:18,847 INFO L85 PathProgramCache]: Analyzing trace with hash 56568, now seen corresponding path program 1 times [2025-02-08 14:30:18,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:30:18,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366031651] [2025-02-08 14:30:18,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:30:18,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:30:18,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:30:18,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:30:18,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:18,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:18,912 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:30:18,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:30:18,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:30:18,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:18,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:18,936 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:30:18,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:30:18,938 INFO L85 PathProgramCache]: Analyzing trace with hash 54, now seen corresponding path program 1 times [2025-02-08 14:30:18,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:30:18,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671054611] [2025-02-08 14:30:18,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:30:18,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:30:18,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:30:18,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:30:18,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:18,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:18,952 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:30:18,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:30:18,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:30:18,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:18,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:18,957 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:30:18,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:30:18,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1753631, now seen corresponding path program 1 times [2025-02-08 14:30:18,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:30:18,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612134389] [2025-02-08 14:30:18,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:30:18,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:30:18,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:30:18,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:30:18,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:18,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:18,989 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:30:18,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:30:19,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:30:19,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:19,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:19,005 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:30:19,237 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:30:19,238 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:30:19,238 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:30:19,238 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:30:19,238 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:30:19,238 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:19,238 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:30:19,238 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:30:19,239 INFO L132 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration1_Lasso [2025-02-08 14:30:19,239 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:30:19,239 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:30:19,252 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:19,260 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:19,262 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:19,266 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:19,269 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:19,272 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:19,275 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:19,278 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:19,284 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:19,287 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:19,678 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:30:19,680 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:30:19,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:19,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:19,683 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:19,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-02-08 14:30:19,686 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:19,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:19,697 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:19,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:19,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:19,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:19,701 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:19,701 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:19,703 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:19,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-02-08 14:30:19,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:19,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:19,712 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:19,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-02-08 14:30:19,715 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:19,725 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:19,725 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:19,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:19,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:19,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:19,726 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:19,727 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:19,731 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:19,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-02-08 14:30:19,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:19,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:19,739 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:19,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-02-08 14:30:19,742 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:19,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:19,752 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:19,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:19,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:19,755 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:30:19,755 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:30:19,758 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:19,763 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-02-08 14:30:19,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:19,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:19,766 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:19,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-02-08 14:30:19,768 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:19,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:19,778 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:19,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:19,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:19,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:19,778 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:19,778 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:19,780 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:19,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-02-08 14:30:19,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:19,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:19,787 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:19,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-02-08 14:30:19,790 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:19,800 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:19,800 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:19,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:19,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:19,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:19,800 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:19,800 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:19,801 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:19,807 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-02-08 14:30:19,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:19,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:19,809 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:19,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-02-08 14:30:19,812 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:19,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:19,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:19,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:19,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:19,824 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:30:19,825 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:30:19,829 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:19,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-02-08 14:30:19,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:19,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:19,837 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:19,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-02-08 14:30:19,840 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:19,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:19,849 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:19,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:19,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:19,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:19,851 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:19,851 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:19,853 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:19,859 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-02-08 14:30:19,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:19,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:19,861 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:19,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-02-08 14:30:19,863 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:19,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:19,873 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:19,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:19,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:19,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:19,873 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:19,873 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:19,874 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:19,880 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-02-08 14:30:19,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:19,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:19,881 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:19,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-02-08 14:30:19,883 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:19,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:19,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:19,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:19,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:19,894 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:30:19,894 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:30:19,897 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:19,906 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-02-08 14:30:19,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:19,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:19,908 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:19,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-02-08 14:30:19,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-02-08 14:30:19,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:19,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:19,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:19,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:19,924 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:30:19,924 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:30:19,926 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:19,932 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-02-08 14:30:19,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:19,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:19,935 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:19,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-02-08 14:30:19,937 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:19,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:19,948 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:19,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:19,948 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:19,948 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:19,948 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:19,948 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:19,950 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:19,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-02-08 14:30:19,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:19,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:19,957 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:19,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-02-08 14:30:19,958 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:19,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:19,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:19,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:19,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:19,974 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:30:19,974 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:30:19,982 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:30:20,003 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-02-08 14:30:20,006 INFO L444 ModelExtractionUtils]: 2 out of 19 variables were initially zero. Simplification set additionally 14 variables to zero. [2025-02-08 14:30:20,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:20,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:20,010 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:20,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-02-08 14:30:20,012 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:30:20,023 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-08 14:30:20,023 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:30:20,023 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~array_size~0#1, ULTIMATE.start_main_~i~1#1) = 1*ULTIMATE.start_main_~array_size~0#1 - 1*ULTIMATE.start_main_~i~1#1 Supporting invariants [] [2025-02-08 14:30:20,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-02-08 14:30:20,038 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2025-02-08 14:30:20,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:30:20,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:30:20,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:30:20,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:20,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:30:20,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:30:20,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:30:20,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:30:20,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:30:20,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:20,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:30:20,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:30:20,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:30:20,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:30:20,115 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-02-08 14:30:20,116 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 17 states, 16 states have (on average 1.5625) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:30:20,136 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 17 states, 16 states have (on average 1.5625) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 19 states and 29 transitions. Complement of second has 3 states. [2025-02-08 14:30:20,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-02-08 14:30:20,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:30:20,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 5 transitions. [2025-02-08 14:30:20,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 5 transitions. Stem has 3 letters. Loop has 1 letters. [2025-02-08 14:30:20,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:30:20,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 5 transitions. Stem has 4 letters. Loop has 1 letters. [2025-02-08 14:30:20,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:30:20,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 5 transitions. Stem has 3 letters. Loop has 2 letters. [2025-02-08 14:30:20,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:30:20,144 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 29 transitions. [2025-02-08 14:30:20,145 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2025-02-08 14:30:20,147 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 15 states and 25 transitions. [2025-02-08 14:30:20,147 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-02-08 14:30:20,147 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2025-02-08 14:30:20,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 25 transitions. [2025-02-08 14:30:20,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:30:20,148 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 25 transitions. [2025-02-08 14:30:20,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 25 transitions. [2025-02-08 14:30:20,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2025-02-08 14:30:20,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:30:20,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 23 transitions. [2025-02-08 14:30:20,162 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 23 transitions. [2025-02-08 14:30:20,162 INFO L432 stractBuchiCegarLoop]: Abstraction has 14 states and 23 transitions. [2025-02-08 14:30:20,162 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-08 14:30:20,162 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 23 transitions. [2025-02-08 14:30:20,162 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2025-02-08 14:30:20,162 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:30:20,162 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:30:20,162 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-08 14:30:20,162 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-08 14:30:20,163 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~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet18#1, main_#t~post19#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0;" [2025-02-08 14:30:20,163 INFO L754 eck$LassoCheckResult]: Loop: "assume lis_~i~0#1 < lis_~N#1;call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" [2025-02-08 14:30:20,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:30:20,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1753630, now seen corresponding path program 1 times [2025-02-08 14:30:20,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:30:20,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811477231] [2025-02-08 14:30:20,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:30:20,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:30:20,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:30:20,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:30:20,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:20,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:30:20,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:30:20,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:30:20,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811477231] [2025-02-08 14:30:20,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811477231] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:30:20,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:30:20,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:30:20,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497704958] [2025-02-08 14:30:20,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:30:20,287 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:30:20,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:30:20,287 INFO L85 PathProgramCache]: Analyzing trace with hash 52, now seen corresponding path program 1 times [2025-02-08 14:30:20,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:30:20,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162999956] [2025-02-08 14:30:20,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:30:20,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:30:20,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:30:20,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:30:20,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:20,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:20,301 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:30:20,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:30:20,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:30:20,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:20,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:20,309 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:30:20,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:30:20,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:30:20,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:30:20,392 INFO L87 Difference]: Start difference. First operand 14 states and 23 transitions. cyclomatic complexity: 13 Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:30:20,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:30:20,408 INFO L93 Difference]: Finished difference Result 14 states and 22 transitions. [2025-02-08 14:30:20,408 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 22 transitions. [2025-02-08 14:30:20,409 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2025-02-08 14:30:20,409 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 22 transitions. [2025-02-08 14:30:20,409 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-02-08 14:30:20,409 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-02-08 14:30:20,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 22 transitions. [2025-02-08 14:30:20,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:30:20,409 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 22 transitions. [2025-02-08 14:30:20,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 22 transitions. [2025-02-08 14:30:20,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-02-08 14:30:20,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:30:20,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 22 transitions. [2025-02-08 14:30:20,411 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 22 transitions. [2025-02-08 14:30:20,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:30:20,414 INFO L432 stractBuchiCegarLoop]: Abstraction has 14 states and 22 transitions. [2025-02-08 14:30:20,414 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-08 14:30:20,414 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 22 transitions. [2025-02-08 14:30:20,416 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2025-02-08 14:30:20,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:30:20,416 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:30:20,416 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-08 14:30:20,416 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-08 14:30:20,416 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~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet18#1, main_#t~post19#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1;main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0;" [2025-02-08 14:30:20,416 INFO L754 eck$LassoCheckResult]: Loop: "assume lis_~i~0#1 < lis_~N#1;call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" [2025-02-08 14:30:20,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:30:20,417 INFO L85 PathProgramCache]: Analyzing trace with hash 54362583, now seen corresponding path program 1 times [2025-02-08 14:30:20,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:30:20,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136513770] [2025-02-08 14:30:20,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:30:20,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:30:20,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:30:20,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:30:20,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:20,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:20,444 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:30:20,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:30:20,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:30:20,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:20,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:20,466 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:30:20,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:30:20,466 INFO L85 PathProgramCache]: Analyzing trace with hash 52, now seen corresponding path program 2 times [2025-02-08 14:30:20,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:30:20,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610667511] [2025-02-08 14:30:20,467 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:30:20,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:30:20,471 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:30:20,476 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:30:20,476 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:30:20,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:20,476 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:30:20,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:30:20,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:30:20,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:20,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:20,484 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:30:20,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:30:20,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1685240094, now seen corresponding path program 1 times [2025-02-08 14:30:20,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:30:20,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732989901] [2025-02-08 14:30:20,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:30:20,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:30:20,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:30:20,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:30:20,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:20,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:20,502 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:30:20,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:30:20,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:30:20,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:20,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:20,519 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:30:20,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-02-08 14:30:20,986 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:30:20,986 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:30:20,987 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:30:20,987 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:30:20,987 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:30:20,987 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:20,987 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:30:20,987 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:30:20,987 INFO L132 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration3_Lasso [2025-02-08 14:30:20,987 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:30:20,987 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:30:20,989 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:20,992 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:21,194 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:21,196 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:21,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:21,201 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:21,203 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:21,205 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:21,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:21,207 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:21,209 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:21,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:21,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:21,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:21,215 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:21,216 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:21,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:21,219 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:21,221 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:21,223 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:21,224 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:21,226 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:21,227 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:21,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:21,230 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:21,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:21,232 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:21,234 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:21,236 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:21,237 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:21,468 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:30:21,468 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:30:21,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:21,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:21,470 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:21,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-02-08 14:30:21,472 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:21,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:21,482 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:21,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:21,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:21,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:21,482 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:21,482 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:21,484 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:21,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-02-08 14:30:21,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:21,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:21,491 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:21,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-02-08 14:30:21,492 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:21,502 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:21,502 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:21,502 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:21,502 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:21,504 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:30:21,504 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:30:21,508 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:21,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-02-08 14:30:21,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:21,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:21,520 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:21,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-02-08 14:30:21,522 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:21,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:21,532 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:21,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:21,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:21,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:21,533 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:21,533 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:21,534 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:21,539 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-02-08 14:30:21,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:21,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:21,541 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:21,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-02-08 14:30:21,542 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:21,552 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:21,552 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:21,552 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:21,552 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:21,552 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:21,552 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:21,552 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:21,553 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:21,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-02-08 14:30:21,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:21,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:21,560 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:21,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-02-08 14:30:21,563 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:21,573 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:21,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:21,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:21,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:21,578 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:30:21,578 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:30:21,588 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:30:21,626 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2025-02-08 14:30:21,626 INFO L444 ModelExtractionUtils]: 6 out of 28 variables were initially zero. Simplification set additionally 17 variables to zero. [2025-02-08 14:30:21,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:21,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:21,629 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:21,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-02-08 14:30:21,631 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:30:21,642 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-02-08 14:30:21,642 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:30:21,642 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0#1) = -2*ULTIMATE.start_lis_~i~0#1 + 1 Supporting invariants [-1*ULTIMATE.start_lis_~N#1 + 1 >= 0] [2025-02-08 14:30:21,649 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-02-08 14:30:21,683 INFO L156 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2025-02-08 14:30:21,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:30:21,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:30:21,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:30:21,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:21,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:30:21,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 14:30:21,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:30:21,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:30:21,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:30:21,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:21,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:30:21,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:30:21,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:30:21,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:30:21,752 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 1 loop predicates [2025-02-08 14:30:21,752 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 22 transitions. cyclomatic complexity: 12 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:30:21,793 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 22 transitions. cyclomatic complexity: 12. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 20 states and 34 transitions. Complement of second has 6 states. [2025-02-08 14:30:21,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 0 non-accepting loop states 2 accepting loop states [2025-02-08 14:30:21,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:30:21,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2025-02-08 14:30:21,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 5 letters. Loop has 1 letters. [2025-02-08 14:30:21,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:30:21,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 6 letters. Loop has 1 letters. [2025-02-08 14:30:21,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:30:21,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 5 letters. Loop has 2 letters. [2025-02-08 14:30:21,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:30:21,795 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 34 transitions. [2025-02-08 14:30:21,795 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2025-02-08 14:30:21,795 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 34 transitions. [2025-02-08 14:30:21,795 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2025-02-08 14:30:21,795 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2025-02-08 14:30:21,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 34 transitions. [2025-02-08 14:30:21,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:30:21,796 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 34 transitions. [2025-02-08 14:30:21,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 34 transitions. [2025-02-08 14:30:21,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2025-02-08 14:30:21,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 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-02-08 14:30:21,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 28 transitions. [2025-02-08 14:30:21,797 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 28 transitions. [2025-02-08 14:30:21,797 INFO L432 stractBuchiCegarLoop]: Abstraction has 17 states and 28 transitions. [2025-02-08 14:30:21,797 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-08 14:30:21,797 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 28 transitions. [2025-02-08 14:30:21,797 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2025-02-08 14:30:21,797 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:30:21,797 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:30:21,799 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-02-08 14:30:21,799 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-08 14:30:21,799 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~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet18#1, main_#t~post19#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1;main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0;" "assume !(lis_~i~0#1 < lis_~N#1);lis_~i~0#1 := 1;" [2025-02-08 14:30:21,799 INFO L754 eck$LassoCheckResult]: Loop: "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" "assume !(lis_~j~0#1 < lis_~i~0#1);lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1;" [2025-02-08 14:30:21,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:30:21,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1685240093, now seen corresponding path program 1 times [2025-02-08 14:30:21,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:30:21,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946732581] [2025-02-08 14:30:21,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:30:21,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:30:21,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:30:21,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:30:21,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:21,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:30:21,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:30:21,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:30:21,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946732581] [2025-02-08 14:30:21,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946732581] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:30:21,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:30:21,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:30:21,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836817675] [2025-02-08 14:30:21,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:30:21,883 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:30:21,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:30:21,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1562, now seen corresponding path program 1 times [2025-02-08 14:30:21,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:30:21,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060980680] [2025-02-08 14:30:21,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:30:21,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:30:21,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:30:21,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:30:21,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:21,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:21,887 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:30:21,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:30:21,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:30:21,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:21,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:21,891 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:30:21,908 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:30:21,908 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:30:21,908 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:30:21,908 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:30:21,908 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-08 14:30:21,908 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:21,908 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:30:21,908 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:30:21,908 INFO L132 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration4_Loop [2025-02-08 14:30:21,908 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:30:21,908 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:30:21,909 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:21,911 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:21,918 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:21,920 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:21,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:21,926 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:21,958 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:30:21,959 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-08 14:30:21,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:21,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:21,962 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:21,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-02-08 14:30:21,964 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:30:21,964 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:30:21,982 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-08 14:30:21,982 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PID_3=1} Honda state: {v_rep~unnamed0~0~P_PID_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-08 14:30:21,987 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-02-08 14:30:21,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:21,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:21,989 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:21,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-02-08 14:30:21,990 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:30:21,990 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:30:22,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-02-08 14:30:22,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:22,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:22,008 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:22,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-02-08 14:30:22,010 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-08 14:30:22,010 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:30:22,032 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-08 14:30:22,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-02-08 14:30:22,041 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:30:22,041 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:30:22,041 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:30:22,041 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:30:22,041 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:30:22,041 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:22,041 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:30:22,041 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:30:22,041 INFO L132 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration4_Loop [2025-02-08 14:30:22,041 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:30:22,041 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:30:22,042 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:22,052 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:22,054 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:22,056 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:22,057 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:22,059 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:22,099 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:30:22,099 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:30:22,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:22,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:22,102 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:22,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-02-08 14:30:22,104 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:22,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:22,114 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:22,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:22,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:22,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:22,115 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:22,115 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:22,117 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:30:22,119 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-08 14:30:22,119 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-08 14:30:22,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:22,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:22,121 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:22,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-02-08 14:30:22,123 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:30:22,124 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-08 14:30:22,124 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:30:22,124 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0#1) = -2*ULTIMATE.start_lis_~i~0#1 + 1 Supporting invariants [] [2025-02-08 14:30:22,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-02-08 14:30:22,130 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-08 14:30:22,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:30:22,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:30:22,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:30:22,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:22,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:30:22,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:30:22,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:30:22,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:30:22,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:30:22,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:22,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:30:22,173 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:30:22,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:30:22,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:30:22,184 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-08 14:30:22,184 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 28 transitions. cyclomatic complexity: 16 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:30:22,216 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 28 transitions. cyclomatic complexity: 16. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 34 states and 57 transitions. Complement of second has 7 states. [2025-02-08 14:30:22,217 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-02-08 14:30:22,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:30:22,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2025-02-08 14:30:22,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 6 letters. Loop has 2 letters. [2025-02-08 14:30:22,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:30:22,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 8 letters. Loop has 2 letters. [2025-02-08 14:30:22,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:30:22,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 6 letters. Loop has 4 letters. [2025-02-08 14:30:22,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:30:22,218 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 57 transitions. [2025-02-08 14:30:22,219 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2025-02-08 14:30:22,219 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 57 transitions. [2025-02-08 14:30:22,219 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2025-02-08 14:30:22,219 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2025-02-08 14:30:22,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 57 transitions. [2025-02-08 14:30:22,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:30:22,219 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 57 transitions. [2025-02-08 14:30:22,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 57 transitions. [2025-02-08 14:30:22,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 26. [2025-02-08 14:30:22,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 25 states have internal predecessors, (45), 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-02-08 14:30:22,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 45 transitions. [2025-02-08 14:30:22,224 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 45 transitions. [2025-02-08 14:30:22,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:30:22,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:30:22,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:30:22,225 INFO L87 Difference]: Start difference. First operand 26 states and 45 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:30:22,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:30:22,252 INFO L93 Difference]: Finished difference Result 27 states and 45 transitions. [2025-02-08 14:30:22,252 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 45 transitions. [2025-02-08 14:30:22,252 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2025-02-08 14:30:22,254 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 45 transitions. [2025-02-08 14:30:22,254 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2025-02-08 14:30:22,254 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2025-02-08 14:30:22,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 45 transitions. [2025-02-08 14:30:22,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:30:22,255 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 45 transitions. [2025-02-08 14:30:22,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 45 transitions. [2025-02-08 14:30:22,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-02-08 14:30:22,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 26 states have internal predecessors, (45), 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-02-08 14:30:22,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 45 transitions. [2025-02-08 14:30:22,258 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 45 transitions. [2025-02-08 14:30:22,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:30:22,259 INFO L432 stractBuchiCegarLoop]: Abstraction has 27 states and 45 transitions. [2025-02-08 14:30:22,259 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-08 14:30:22,259 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 45 transitions. [2025-02-08 14:30:22,260 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2025-02-08 14:30:22,260 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:30:22,260 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:30:22,260 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2025-02-08 14:30:22,262 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-08 14:30:22,262 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~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet18#1, main_#t~post19#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1;main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1;main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0;" "assume lis_~i~0#1 < lis_~N#1;call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" [2025-02-08 14:30:22,262 INFO L754 eck$LassoCheckResult]: Loop: "assume lis_~i~0#1 < lis_~N#1;call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" [2025-02-08 14:30:22,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:30:22,262 INFO L85 PathProgramCache]: Analyzing trace with hash 702836375, now seen corresponding path program 2 times [2025-02-08 14:30:22,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:30:22,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495241362] [2025-02-08 14:30:22,262 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:30:22,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:30:22,268 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 2 equivalence classes. [2025-02-08 14:30:22,310 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:30:22,312 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:30:22,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:22,312 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:30:22,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:30:22,310 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-02-08 14:30:22,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:30:22,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:22,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:22,334 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:30:22,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:30:22,334 INFO L85 PathProgramCache]: Analyzing trace with hash 52, now seen corresponding path program 3 times [2025-02-08 14:30:22,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-02-08 14:30:22,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:30:22,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481005791] [2025-02-08 14:30:22,339 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:30:22,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:30:22,342 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:30:22,343 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:30:22,343 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 14:30:22,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:22,343 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:30:22,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:30:22,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:30:22,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:22,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:22,350 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:30:22,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:30:22,351 INFO L85 PathProgramCache]: Analyzing trace with hash 313091166, now seen corresponding path program 3 times [2025-02-08 14:30:22,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:30:22,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833059099] [2025-02-08 14:30:22,351 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:30:22,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:30:22,362 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 8 statements into 2 equivalence classes. [2025-02-08 14:30:22,396 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:30:22,396 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 14:30:22,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:22,396 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:30:22,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:30:22,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:30:22,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:22,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:22,416 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:30:23,080 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:30:23,080 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:30:23,080 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:30:23,080 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:30:23,080 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:30:23,080 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:23,080 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:30:23,080 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:30:23,080 INFO L132 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration5_Lasso [2025-02-08 14:30:23,080 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:30:23,080 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:30:23,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:23,085 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:23,090 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:23,091 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:23,093 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:23,095 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:23,096 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:23,097 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:23,099 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:23,100 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:23,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:23,103 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:23,104 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:23,105 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:23,107 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:23,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:23,110 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:23,111 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:23,369 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:23,371 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:23,373 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:23,374 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:23,375 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:23,377 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:23,378 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:23,379 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:23,380 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:23,382 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:23,383 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:23,649 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:30:23,649 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:30:23,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:23,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:23,651 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:23,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-02-08 14:30:23,652 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:23,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:23,662 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:23,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:23,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:23,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:23,662 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:23,662 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:23,663 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:23,669 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-02-08 14:30:23,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:23,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:23,671 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:23,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-02-08 14:30:23,672 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:23,682 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:23,682 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:23,682 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:23,682 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:23,682 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:23,683 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:23,683 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:23,684 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:23,689 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-02-08 14:30:23,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:23,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:23,691 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:23,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-02-08 14:30:23,692 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:23,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:23,701 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:23,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:23,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:23,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:23,702 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:23,702 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:23,703 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:23,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-02-08 14:30:23,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:23,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:23,710 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:23,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-02-08 14:30:23,713 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:23,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:23,723 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:23,723 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:23,723 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:23,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:23,723 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:23,723 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:23,724 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:23,730 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-02-08 14:30:23,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:23,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:23,732 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:23,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-02-08 14:30:23,735 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:23,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:23,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:23,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:23,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:23,748 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:30:23,748 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:30:23,750 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:23,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-02-08 14:30:23,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:23,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:23,757 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:23,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-02-08 14:30:23,759 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:23,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:23,769 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:23,769 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:23,769 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:23,769 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:23,770 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:23,770 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:23,772 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:23,778 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-02-08 14:30:23,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:23,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:23,780 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:23,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-02-08 14:30:23,782 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:23,791 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:23,791 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:23,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:23,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:23,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:23,792 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:23,792 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:23,793 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:23,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-02-08 14:30:23,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:23,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:23,800 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:23,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-02-08 14:30:23,802 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:23,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:23,811 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:23,812 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:23,812 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:23,812 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:23,812 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:23,812 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:23,813 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:23,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-02-08 14:30:23,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:23,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:23,820 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:23,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-02-08 14:30:23,821 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:23,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:23,831 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:23,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:23,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:23,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:23,831 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:23,831 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:23,832 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:23,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-02-08 14:30:23,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:23,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:23,839 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:23,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-02-08 14:30:23,845 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:23,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:23,854 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:23,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:23,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:23,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:23,855 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:23,855 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:23,856 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:23,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2025-02-08 14:30:23,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:23,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:23,864 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:23,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-02-08 14:30:23,867 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:23,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:23,877 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:23,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:23,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:23,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:23,877 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:23,877 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:23,878 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:23,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2025-02-08 14:30:23,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:23,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:23,885 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:23,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-02-08 14:30:23,887 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:23,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:23,896 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:23,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:23,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:23,896 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:23,896 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:23,896 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:23,897 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:23,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-02-08 14:30:23,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:23,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:23,904 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:23,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-02-08 14:30:23,905 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:23,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:23,914 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:23,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:23,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:23,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:23,915 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:23,915 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:23,916 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:23,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-02-08 14:30:23,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:23,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:23,923 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:23,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-02-08 14:30:23,925 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:23,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:23,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:23,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:23,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:23,939 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:30:23,939 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:30:23,942 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:23,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2025-02-08 14:30:23,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:23,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:23,949 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:23,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-02-08 14:30:23,950 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:23,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:23,960 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:23,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:23,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:23,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:23,960 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:23,960 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:23,961 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:23,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2025-02-08 14:30:23,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:23,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:23,968 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:23,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-02-08 14:30:23,970 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:23,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:23,979 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:23,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:23,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:23,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:23,980 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:23,980 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:23,980 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:23,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-02-08 14:30:23,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:23,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:23,988 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:23,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-02-08 14:30:23,990 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:23,999 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:23,999 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:23,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:23,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:23,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:23,999 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:23,999 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:24,000 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:24,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-02-08 14:30:24,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:24,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:24,007 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:24,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-02-08 14:30:24,009 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:24,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:24,019 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:24,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:24,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:24,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:24,019 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:24,019 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:24,020 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:24,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-02-08 14:30:24,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:24,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:24,030 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:24,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-02-08 14:30:24,032 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:24,043 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:24,043 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:24,043 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:24,043 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:24,055 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:30:24,056 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:30:24,069 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:30:24,105 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2025-02-08 14:30:24,105 INFO L444 ModelExtractionUtils]: 8 out of 34 variables were initially zero. Simplification set additionally 22 variables to zero. [2025-02-08 14:30:24,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:24,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:24,107 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:24,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-02-08 14:30:24,110 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:30:24,121 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-02-08 14:30:24,121 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:30:24,121 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_lis_~best~0#1.base)_2, ULTIMATE.start_lis_~i~0#1) = 1*v_rep(select #length ULTIMATE.start_lis_~best~0#1.base)_2 - 4*ULTIMATE.start_lis_~i~0#1 Supporting invariants [1*ULTIMATE.start_lis_~best~0#1.offset >= 0] [2025-02-08 14:30:24,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2025-02-08 14:30:24,165 INFO L156 tatePredicateManager]: 18 out of 19 supporting invariants were superfluous and have been removed [2025-02-08 14:30:24,167 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-02-08 14:30:24,168 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-02-08 14:30:24,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:30:24,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:30:24,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:30:24,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:24,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:30:24,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:30:24,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:30:24,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:30:24,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:30:24,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:24,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:30:24,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:30:24,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:30:24,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:30:24,219 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2025-02-08 14:30:24,220 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 45 transitions. cyclomatic complexity: 24 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-02-08 14:30:24,235 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 45 transitions. cyclomatic complexity: 24. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 29 states and 50 transitions. Complement of second has 4 states. [2025-02-08 14:30:24,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2025-02-08 14:30:24,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-02-08 14:30:24,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2025-02-08 14:30:24,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 7 letters. Loop has 1 letters. [2025-02-08 14:30:24,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:30:24,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 1 letters. [2025-02-08 14:30:24,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:30:24,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 7 letters. Loop has 2 letters. [2025-02-08 14:30:24,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:30:24,237 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 50 transitions. [2025-02-08 14:30:24,237 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2025-02-08 14:30:24,238 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 50 transitions. [2025-02-08 14:30:24,238 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2025-02-08 14:30:24,238 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2025-02-08 14:30:24,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 50 transitions. [2025-02-08 14:30:24,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:30:24,238 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 50 transitions. [2025-02-08 14:30:24,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 50 transitions. [2025-02-08 14:30:24,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2025-02-08 14:30:24,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 27 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-02-08 14:30:24,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 47 transitions. [2025-02-08 14:30:24,239 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 47 transitions. [2025-02-08 14:30:24,239 INFO L432 stractBuchiCegarLoop]: Abstraction has 28 states and 47 transitions. [2025-02-08 14:30:24,239 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-08 14:30:24,239 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 47 transitions. [2025-02-08 14:30:24,239 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2025-02-08 14:30:24,239 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:30:24,239 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:30:24,240 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:30:24,240 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-02-08 14:30:24,240 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~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet18#1, main_#t~post19#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1;main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0;" "assume lis_~i~0#1 < lis_~N#1;call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume !(lis_~i~0#1 < lis_~N#1);lis_~i~0#1 := 1;" "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" [2025-02-08 14:30:24,240 INFO L754 eck$LassoCheckResult]: Loop: "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1;" "assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume !(lis_~j~0#1 < lis_~i~0#1);lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1;" "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" [2025-02-08 14:30:24,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:30:24,241 INFO L85 PathProgramCache]: Analyzing trace with hash 313060381, now seen corresponding path program 1 times [2025-02-08 14:30:24,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:30:24,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904911413] [2025-02-08 14:30:24,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:30:24,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:30:24,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:30:24,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:30:24,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:24,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:30:24,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:30:24,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:30:24,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904911413] [2025-02-08 14:30:24,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904911413] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:30:24,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946803622] [2025-02-08 14:30:24,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:30:24,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:30:24,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:24,312 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:30:24,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2025-02-08 14:30:24,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:30:24,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:30:24,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:24,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:30:24,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 14:30:24,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:30:24,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:30:24,380 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:30:24,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:30:24,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946803622] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:30:24,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:30:24,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-02-08 14:30:24,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033530944] [2025-02-08 14:30:24,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:30:24,409 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:30:24,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:30:24,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1418034693, now seen corresponding path program 1 times [2025-02-08 14:30:24,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:30:24,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122846646] [2025-02-08 14:30:24,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:30:24,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:30:24,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:30:24,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:30:24,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:24,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:24,421 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:30:24,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:30:24,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:30:24,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:24,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:24,427 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:30:24,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:30:24,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 14:30:24,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-08 14:30:24,636 INFO L87 Difference]: Start difference. First operand 28 states and 47 transitions. cyclomatic complexity: 25 Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:30:24,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:30:24,676 INFO L93 Difference]: Finished difference Result 31 states and 49 transitions. [2025-02-08 14:30:24,677 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 49 transitions. [2025-02-08 14:30:24,677 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-02-08 14:30:24,677 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 49 transitions. [2025-02-08 14:30:24,677 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2025-02-08 14:30:24,677 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2025-02-08 14:30:24,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 49 transitions. [2025-02-08 14:30:24,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:30:24,677 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 49 transitions. [2025-02-08 14:30:24,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 49 transitions. [2025-02-08 14:30:24,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2025-02-08 14:30:24,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 27 states have internal predecessors, (45), 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-02-08 14:30:24,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 45 transitions. [2025-02-08 14:30:24,679 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 45 transitions. [2025-02-08 14:30:24,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:30:24,682 INFO L432 stractBuchiCegarLoop]: Abstraction has 28 states and 45 transitions. [2025-02-08 14:30:24,682 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-08 14:30:24,682 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 45 transitions. [2025-02-08 14:30:24,683 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2025-02-08 14:30:24,683 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:30:24,683 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:30:24,683 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:30:24,683 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-08 14:30:24,683 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~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet18#1, main_#t~post19#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1;main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0;" "assume lis_~i~0#1 < lis_~N#1;call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume !(lis_~i~0#1 < lis_~N#1);lis_~i~0#1 := 1;" "assume !(lis_~i~0#1 < lis_~N#1);lis_~i~0#1 := 0;" [2025-02-08 14:30:24,683 INFO L754 eck$LassoCheckResult]: Loop: "assume lis_~i~0#1 < lis_~N#1;call lis_#t~mem13#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);" "assume lis_~max~0#1 < lis_#t~mem13#1;havoc lis_#t~mem13#1;call lis_#t~mem14#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);lis_~max~0#1 := lis_#t~mem14#1;" "lis_#t~post15#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post15#1;havoc lis_#t~post15#1;" [2025-02-08 14:30:24,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:30:24,683 INFO L85 PathProgramCache]: Analyzing trace with hash 313060373, now seen corresponding path program 1 times [2025-02-08 14:30:24,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:30:24,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702132456] [2025-02-08 14:30:24,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:30:24,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:30:24,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2025-02-08 14:30:24,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:30:24,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:30:24,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:24,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:24,711 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:30:24,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:30:24,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:30:24,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:24,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:24,718 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:30:24,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:30:24,719 INFO L85 PathProgramCache]: Analyzing trace with hash 39656, now seen corresponding path program 1 times [2025-02-08 14:30:24,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:30:24,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438314061] [2025-02-08 14:30:24,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:30:24,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:30:24,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:30:24,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:30:24,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:24,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:24,723 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:30:24,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:30:24,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:30:24,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:24,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:24,725 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:30:24,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:30:24,725 INFO L85 PathProgramCache]: Analyzing trace with hash 2007582292, now seen corresponding path program 1 times [2025-02-08 14:30:24,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:30:24,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007723269] [2025-02-08 14:30:24,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:30:24,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:30:24,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:30:24,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:30:24,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:24,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:24,743 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:30:24,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:30:24,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:30:24,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:24,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:24,757 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:30:25,148 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:30:25,148 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:30:25,148 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:30:25,148 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:30:25,148 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:30:25,148 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:25,148 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:30:25,148 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:30:25,148 INFO L132 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration7_Lasso [2025-02-08 14:30:25,148 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:30:25,148 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:30:25,150 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:25,155 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:25,157 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:25,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:25,159 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:25,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:25,161 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:25,162 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:25,164 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:25,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:25,167 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:25,168 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:25,173 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:25,316 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:25,317 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:25,320 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:25,321 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:25,322 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:25,323 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:25,324 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:25,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:25,329 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:25,330 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:25,332 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:25,333 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:25,335 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:25,336 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:25,338 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:25,339 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:25,340 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:25,558 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:30:25,559 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:30:25,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:25,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:25,561 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:25,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-02-08 14:30:25,562 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:25,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:25,572 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:25,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:25,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:25,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:25,573 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:25,573 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:25,574 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:25,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2025-02-08 14:30:25,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:25,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:25,581 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:25,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-02-08 14:30:25,583 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:25,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:25,592 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:25,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:25,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:25,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:25,593 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:25,593 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:25,594 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:25,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2025-02-08 14:30:25,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:25,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:25,601 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:25,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-02-08 14:30:25,602 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:25,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:25,612 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:25,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:25,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:25,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:25,612 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:25,612 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:25,613 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:25,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-02-08 14:30:25,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:25,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:25,620 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:25,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-02-08 14:30:25,621 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:25,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:25,631 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:25,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:25,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:25,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:25,632 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:25,632 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:25,632 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:25,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2025-02-08 14:30:25,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:25,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:25,640 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:25,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-02-08 14:30:25,641 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:25,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:25,651 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:25,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:25,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:25,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:25,651 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:25,651 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:25,652 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:25,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-02-08 14:30:25,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:25,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:25,660 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:25,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-02-08 14:30:25,663 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:25,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:25,673 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:25,673 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:25,673 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:25,673 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:25,674 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:25,674 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:25,674 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:25,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2025-02-08 14:30:25,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:25,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:25,683 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:25,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-02-08 14:30:25,685 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:25,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:25,694 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:25,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:25,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:25,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:25,694 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:25,694 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:25,695 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:25,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-02-08 14:30:25,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:25,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:25,702 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:25,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-02-08 14:30:25,703 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:25,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:25,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:25,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:25,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:25,714 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:30:25,714 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:30:25,716 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:25,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-02-08 14:30:25,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:25,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:25,723 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:25,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-02-08 14:30:25,725 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:25,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:25,734 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:25,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:25,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:25,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:25,735 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:25,735 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:25,736 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:25,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2025-02-08 14:30:25,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:25,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:25,743 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:25,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-02-08 14:30:25,744 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:25,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:25,754 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:25,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:25,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:25,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:25,754 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:25,754 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:25,755 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:25,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2025-02-08 14:30:25,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:25,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:25,762 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:25,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-02-08 14:30:25,763 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:25,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:25,773 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:25,773 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:25,773 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:25,773 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:25,773 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:25,773 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:25,774 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:25,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2025-02-08 14:30:25,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:25,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:25,781 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:25,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-02-08 14:30:25,783 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:25,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:25,792 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:25,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:25,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:25,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:25,792 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:25,793 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:25,793 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:25,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2025-02-08 14:30:25,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:25,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:25,800 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:25,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-02-08 14:30:25,802 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:25,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:25,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:25,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:25,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:25,817 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:30:25,817 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:30:25,820 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:25,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2025-02-08 14:30:25,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:25,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:25,828 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:25,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-02-08 14:30:25,830 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:25,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:25,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:25,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:25,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:25,841 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:30:25,841 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:30:25,844 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:25,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2025-02-08 14:30:25,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:25,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:25,852 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:25,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-02-08 14:30:25,854 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:25,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:25,863 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:25,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:25,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:25,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:25,864 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:25,864 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:25,865 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:25,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2025-02-08 14:30:25,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:25,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:25,873 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:25,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-02-08 14:30:25,876 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:25,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:25,885 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:25,885 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:25,885 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:25,886 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:30:25,886 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:30:25,889 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:25,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2025-02-08 14:30:25,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:25,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:25,896 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:25,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-02-08 14:30:25,899 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:25,908 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:25,909 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:25,909 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:25,909 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:25,911 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:30:25,911 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:30:25,915 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:25,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2025-02-08 14:30:25,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:25,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:25,923 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:25,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-02-08 14:30:25,925 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:25,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:25,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:25,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:25,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:25,939 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:30:25,939 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:30:25,946 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:30:25,960 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2025-02-08 14:30:25,961 INFO L444 ModelExtractionUtils]: 6 out of 19 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-02-08 14:30:25,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:25,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:25,962 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:25,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-02-08 14:30:25,964 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:30:25,974 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-02-08 14:30:25,974 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:30:25,974 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0#1) = -4*ULTIMATE.start_lis_~i~0#1 + 1 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_lis_#t~malloc2#1.base)_3 + 1*ULTIMATE.start_lis_~best~0#1.offset + 4 >= 0] [2025-02-08 14:30:25,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2025-02-08 14:30:25,998 INFO L156 tatePredicateManager]: 9 out of 11 supporting invariants were superfluous and have been removed [2025-02-08 14:30:26,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:30:26,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:30:26,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:30:26,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:26,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:30:26,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-08 14:30:26,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:30:26,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-02-08 14:30:26,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 14:30:26,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-08 14:30:26,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:30:26,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:30:26,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:26,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:30:26,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 14:30:26,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:30:26,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:30:26,166 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2025-02-08 14:30:26,166 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 45 transitions. cyclomatic complexity: 23 Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:30:26,239 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 45 transitions. cyclomatic complexity: 23. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 36 states and 57 transitions. Complement of second has 10 states. [2025-02-08 14:30:26,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 5 stem states 1 non-accepting loop states 2 accepting loop states [2025-02-08 14:30:26,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:30:26,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 27 transitions. [2025-02-08 14:30:26,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 27 transitions. Stem has 8 letters. Loop has 3 letters. [2025-02-08 14:30:26,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:30:26,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 27 transitions. Stem has 11 letters. Loop has 3 letters. [2025-02-08 14:30:26,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:30:26,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 27 transitions. Stem has 8 letters. Loop has 6 letters. [2025-02-08 14:30:26,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:30:26,241 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 57 transitions. [2025-02-08 14:30:26,241 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2025-02-08 14:30:26,242 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 27 states and 43 transitions. [2025-02-08 14:30:26,242 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2025-02-08 14:30:26,242 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2025-02-08 14:30:26,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 43 transitions. [2025-02-08 14:30:26,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:30:26,242 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 43 transitions. [2025-02-08 14:30:26,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 43 transitions. [2025-02-08 14:30:26,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2025-02-08 14:30:26,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.6) internal successors, (40), 24 states have internal predecessors, (40), 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-02-08 14:30:26,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 40 transitions. [2025-02-08 14:30:26,243 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 40 transitions. [2025-02-08 14:30:26,243 INFO L432 stractBuchiCegarLoop]: Abstraction has 25 states and 40 transitions. [2025-02-08 14:30:26,243 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-02-08 14:30:26,243 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 40 transitions. [2025-02-08 14:30:26,243 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2025-02-08 14:30:26,243 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:30:26,243 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:30:26,246 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:30:26,246 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-02-08 14:30:26,246 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~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet18#1, main_#t~post19#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1;main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1;main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0;" "assume lis_~i~0#1 < lis_~N#1;call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume !(lis_~i~0#1 < lis_~N#1);lis_~i~0#1 := 1;" "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" [2025-02-08 14:30:26,246 INFO L754 eck$LassoCheckResult]: Loop: "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1;" "assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume !(lis_~j~0#1 < lis_~i~0#1);lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1;" "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" [2025-02-08 14:30:26,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:30:26,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1115891542, now seen corresponding path program 2 times [2025-02-08 14:30:26,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:30:26,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015389825] [2025-02-08 14:30:26,247 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:30:26,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:30:26,253 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-02-08 14:30:26,267 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 14:30:26,267 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:30:26,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:30:26,323 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:30:26,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:30:26,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015389825] [2025-02-08 14:30:26,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015389825] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:30:26,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057005980] [2025-02-08 14:30:26,323 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:30:26,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:30:26,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:26,325 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:30:26,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2025-02-08 14:30:26,367 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-02-08 14:30:26,381 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 14:30:26,381 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:30:26,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:30:26,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:30:26,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:30:26,398 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:30:26,399 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:30:26,419 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:30:26,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057005980] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:30:26,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:30:26,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 14:30:26,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440362155] [2025-02-08 14:30:26,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:30:26,420 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:30:26,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:30:26,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1418034693, now seen corresponding path program 2 times [2025-02-08 14:30:26,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:30:26,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89951201] [2025-02-08 14:30:26,420 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:30:26,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:30:26,424 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 2 equivalence classes. [2025-02-08 14:30:26,427 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:30:26,427 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:30:26,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:26,427 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:30:26,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:30:26,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:30:26,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:26,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:26,433 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:30:26,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:30:26,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 14:30:26,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-08 14:30:26,657 INFO L87 Difference]: Start difference. First operand 25 states and 40 transitions. cyclomatic complexity: 20 Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:30:26,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:30:26,706 INFO L93 Difference]: Finished difference Result 43 states and 69 transitions. [2025-02-08 14:30:26,706 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 69 transitions. [2025-02-08 14:30:26,706 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2025-02-08 14:30:26,707 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 69 transitions. [2025-02-08 14:30:26,707 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2025-02-08 14:30:26,707 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2025-02-08 14:30:26,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 69 transitions. [2025-02-08 14:30:26,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:30:26,707 INFO L218 hiAutomatonCegarLoop]: Abstraction has 43 states and 69 transitions. [2025-02-08 14:30:26,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 69 transitions. [2025-02-08 14:30:26,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 26. [2025-02-08 14:30:26,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 25 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:30:26,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 41 transitions. [2025-02-08 14:30:26,708 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 41 transitions. [2025-02-08 14:30:26,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:30:26,709 INFO L432 stractBuchiCegarLoop]: Abstraction has 26 states and 41 transitions. [2025-02-08 14:30:26,709 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-02-08 14:30:26,709 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 41 transitions. [2025-02-08 14:30:26,711 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2025-02-08 14:30:26,711 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:30:26,711 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:30:26,711 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:30:26,711 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-08 14:30:26,711 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet18#1, main_#t~post19#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1;main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1;main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0;" "assume lis_~i~0#1 < lis_~N#1;call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume !(lis_~i~0#1 < lis_~N#1);lis_~i~0#1 := 1;" "assume !(lis_~i~0#1 < lis_~N#1);lis_~i~0#1 := 0;" [2025-02-08 14:30:26,711 INFO L754 eck$LassoCheckResult]: Loop: "assume lis_~i~0#1 < lis_~N#1;call lis_#t~mem13#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);" "assume lis_~max~0#1 < lis_#t~mem13#1;havoc lis_#t~mem13#1;call lis_#t~mem14#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);lis_~max~0#1 := lis_#t~mem14#1;" "lis_#t~post15#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post15#1;havoc lis_#t~post15#1;" [2025-02-08 14:30:26,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:30:26,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1115891534, now seen corresponding path program 2 times [2025-02-08 14:30:26,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:30:26,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235357712] [2025-02-08 14:30:26,711 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:30:26,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:30:26,720 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-02-08 14:30:26,727 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 14:30:26,727 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:30:26,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:30:26,786 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:30:26,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:30:26,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235357712] [2025-02-08 14:30:26,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235357712] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:30:26,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822709788] [2025-02-08 14:30:26,787 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:30:26,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:30:26,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:26,789 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:30:26,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2025-02-08 14:30:26,837 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-02-08 14:30:26,849 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 14:30:26,849 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:30:26,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:30:26,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 14:30:26,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:30:26,870 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:30:26,870 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:30:26,897 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:30:26,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822709788] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:30:26,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:30:26,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-02-08 14:30:26,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283700381] [2025-02-08 14:30:26,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:30:26,898 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:30:26,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:30:26,898 INFO L85 PathProgramCache]: Analyzing trace with hash 39656, now seen corresponding path program 2 times [2025-02-08 14:30:26,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:30:26,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830978175] [2025-02-08 14:30:26,898 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:30:26,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:30:26,903 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:30:26,904 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:30:26,904 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:30:26,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:26,904 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:30:26,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:30:26,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:30:26,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:26,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:26,906 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:30:26,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:30:26,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 14:30:26,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-08 14:30:26,947 INFO L87 Difference]: Start difference. First operand 26 states and 41 transitions. cyclomatic complexity: 20 Second operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:30:27,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2025-02-08 14:30:27,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:30:27,039 INFO L93 Difference]: Finished difference Result 40 states and 63 transitions. [2025-02-08 14:30:27,039 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 63 transitions. [2025-02-08 14:30:27,039 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2025-02-08 14:30:27,040 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 39 states and 62 transitions. [2025-02-08 14:30:27,040 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2025-02-08 14:30:27,040 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2025-02-08 14:30:27,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 62 transitions. [2025-02-08 14:30:27,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:30:27,040 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 62 transitions. [2025-02-08 14:30:27,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 62 transitions. [2025-02-08 14:30:27,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 26. [2025-02-08 14:30:27,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 25 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:30:27,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 41 transitions. [2025-02-08 14:30:27,041 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 41 transitions. [2025-02-08 14:30:27,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 14:30:27,044 INFO L432 stractBuchiCegarLoop]: Abstraction has 26 states and 41 transitions. [2025-02-08 14:30:27,044 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-02-08 14:30:27,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 41 transitions. [2025-02-08 14:30:27,044 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2025-02-08 14:30:27,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:30:27,044 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:30:27,044 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 14:30:27,045 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-02-08 14:30:27,045 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~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet18#1, main_#t~post19#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1;main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1;main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0;" "assume lis_~i~0#1 < lis_~N#1;call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume lis_~i~0#1 < lis_~N#1;call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume !(lis_~i~0#1 < lis_~N#1);lis_~i~0#1 := 1;" "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" [2025-02-08 14:30:27,045 INFO L754 eck$LassoCheckResult]: Loop: "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1;" "assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume !(lis_~j~0#1 < lis_~i~0#1);lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1;" "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" [2025-02-08 14:30:27,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:30:27,045 INFO L85 PathProgramCache]: Analyzing trace with hash 232900445, now seen corresponding path program 3 times [2025-02-08 14:30:27,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:30:27,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608008575] [2025-02-08 14:30:27,045 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:30:27,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:30:27,053 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 10 statements into 2 equivalence classes. [2025-02-08 14:30:27,062 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:30:27,062 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 14:30:27,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:27,062 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:30:27,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:30:27,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:30:27,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:27,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:27,070 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:30:27,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:30:27,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1418034693, now seen corresponding path program 3 times [2025-02-08 14:30:27,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:30:27,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700430948] [2025-02-08 14:30:27,070 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:30:27,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:30:27,074 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 6 statements into 2 equivalence classes. [2025-02-08 14:30:27,076 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:30:27,079 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 14:30:27,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:27,079 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:30:27,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:30:27,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:30:27,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:27,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:27,083 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:30:27,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:30:27,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1334620063, now seen corresponding path program 1 times [2025-02-08 14:30:27,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:30:27,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266404299] [2025-02-08 14:30:27,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:30:27,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:30:27,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 14:30:27,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 14:30:27,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:27,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:30:27,190 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 14:30:27,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:30:27,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266404299] [2025-02-08 14:30:27,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266404299] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:30:27,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535514638] [2025-02-08 14:30:27,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:30:27,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:30:27,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:27,192 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:30:27,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2025-02-08 14:30:27,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 14:30:27,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 14:30:27,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:27,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:30:27,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 14:30:27,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:30:27,302 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 14:30:27,302 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:30:27,348 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 14:30:27,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535514638] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:30:27,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:30:27,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-02-08 14:30:27,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288234226] [2025-02-08 14:30:27,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:30:27,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:30:27,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 14:30:27,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-02-08 14:30:27,540 INFO L87 Difference]: Start difference. First operand 26 states and 41 transitions. cyclomatic complexity: 20 Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:30:27,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:30:27,606 INFO L93 Difference]: Finished difference Result 47 states and 72 transitions. [2025-02-08 14:30:27,606 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 72 transitions. [2025-02-08 14:30:27,606 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2025-02-08 14:30:27,607 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 42 states and 64 transitions. [2025-02-08 14:30:27,607 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2025-02-08 14:30:27,607 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2025-02-08 14:30:27,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 64 transitions. [2025-02-08 14:30:27,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:30:27,607 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 64 transitions. [2025-02-08 14:30:27,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 64 transitions. [2025-02-08 14:30:27,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2025-02-08 14:30:27,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 37 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:30:27,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 59 transitions. [2025-02-08 14:30:27,609 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 59 transitions. [2025-02-08 14:30:27,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 14:30:27,610 INFO L432 stractBuchiCegarLoop]: Abstraction has 38 states and 59 transitions. [2025-02-08 14:30:27,610 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-02-08 14:30:27,610 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 59 transitions. [2025-02-08 14:30:27,610 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2025-02-08 14:30:27,610 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:30:27,610 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:30:27,611 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:30:27,611 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-08 14:30:27,611 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~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet18#1, main_#t~post19#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1;main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1;main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0;" "assume lis_~i~0#1 < lis_~N#1;call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume lis_~i~0#1 < lis_~N#1;call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume !(lis_~i~0#1 < lis_~N#1);lis_~i~0#1 := 1;" "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" [2025-02-08 14:30:27,611 INFO L754 eck$LassoCheckResult]: Loop: "assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1;" "assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" [2025-02-08 14:30:27,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:30:27,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1370020779, now seen corresponding path program 1 times [2025-02-08 14:30:27,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:30:27,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181954103] [2025-02-08 14:30:27,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:30:27,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:30:27,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:30:27,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:30:27,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:27,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:27,634 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:30:27,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:30:27,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:30:27,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:27,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:27,651 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:30:27,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:30:27,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1414052, now seen corresponding path program 1 times [2025-02-08 14:30:27,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:30:27,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277325542] [2025-02-08 14:30:27,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:30:27,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:30:27,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:30:27,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:30:27,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:27,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:27,663 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:30:27,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:30:27,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:30:27,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:27,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:27,668 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:30:27,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:30:27,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1428525576, now seen corresponding path program 1 times [2025-02-08 14:30:27,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:30:27,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679435860] [2025-02-08 14:30:27,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:30:27,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:30:27,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 14:30:27,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 14:30:27,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:27,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:30:27,731 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 14:30:27,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:30:27,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679435860] [2025-02-08 14:30:27,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679435860] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:30:27,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50106363] [2025-02-08 14:30:27,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:30:27,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:30:27,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:27,735 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:30:27,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2025-02-08 14:30:27,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 14:30:27,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 14:30:27,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:27,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:30:27,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:30:27,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:30:27,834 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 14:30:27,835 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 14:30:27,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50106363] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:30:27,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 14:30:27,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-02-08 14:30:27,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854316712] [2025-02-08 14:30:27,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:30:28,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:30:28,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:30:28,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-02-08 14:30:28,044 INFO L87 Difference]: Start difference. First operand 38 states and 59 transitions. cyclomatic complexity: 28 Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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-02-08 14:30:28,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:30:28,080 INFO L93 Difference]: Finished difference Result 51 states and 77 transitions. [2025-02-08 14:30:28,080 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 77 transitions. [2025-02-08 14:30:28,081 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2025-02-08 14:30:28,081 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 77 transitions. [2025-02-08 14:30:28,081 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2025-02-08 14:30:28,081 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2025-02-08 14:30:28,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 77 transitions. [2025-02-08 14:30:28,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:30:28,081 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 77 transitions. [2025-02-08 14:30:28,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 77 transitions. [2025-02-08 14:30:28,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2025-02-08 14:30:28,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.5319148936170213) internal successors, (72), 46 states have internal predecessors, (72), 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-02-08 14:30:28,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 72 transitions. [2025-02-08 14:30:28,083 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47 states and 72 transitions. [2025-02-08 14:30:28,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:30:28,084 INFO L432 stractBuchiCegarLoop]: Abstraction has 47 states and 72 transitions. [2025-02-08 14:30:28,084 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-02-08 14:30:28,084 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 72 transitions. [2025-02-08 14:30:28,084 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2025-02-08 14:30:28,084 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:30:28,084 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:30:28,085 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:30:28,085 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-08 14:30:28,085 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~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet18#1, main_#t~post19#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1;main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1;main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0;" "assume lis_~i~0#1 < lis_~N#1;call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume lis_~i~0#1 < lis_~N#1;call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume !(lis_~i~0#1 < lis_~N#1);lis_~i~0#1 := 1;" "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" "assume !(lis_~j~0#1 < lis_~i~0#1);lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1;" "assume !(lis_~i~0#1 < lis_~N#1);lis_~i~0#1 := 0;" [2025-02-08 14:30:28,085 INFO L754 eck$LassoCheckResult]: Loop: "assume lis_~i~0#1 < lis_~N#1;call lis_#t~mem13#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);" "assume lis_~max~0#1 < lis_#t~mem13#1;havoc lis_#t~mem13#1;call lis_#t~mem14#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);lis_~max~0#1 := lis_#t~mem14#1;" "lis_#t~post15#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post15#1;havoc lis_#t~post15#1;" [2025-02-08 14:30:28,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:30:28,085 INFO L85 PathProgramCache]: Analyzing trace with hash 479028636, now seen corresponding path program 1 times [2025-02-08 14:30:28,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:30:28,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418593369] [2025-02-08 14:30:28,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:30:28,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:30:28,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 14:30:28,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 14:30:28,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:28,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:30:28,126 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 14:30:28,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:30:28,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418593369] [2025-02-08 14:30:28,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418593369] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:30:28,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:30:28,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:30:28,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038297589] [2025-02-08 14:30:28,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:30:28,127 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:30:28,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:30:28,127 INFO L85 PathProgramCache]: Analyzing trace with hash 39656, now seen corresponding path program 3 times [2025-02-08 14:30:28,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:30:28,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64657785] [2025-02-08 14:30:28,127 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:30:28,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:30:28,129 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:30:28,130 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:30:28,130 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 14:30:28,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:28,130 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:30:28,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:30:28,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:30:28,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:28,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:28,132 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:30:28,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:30:28,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:30:28,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:30:28,164 INFO L87 Difference]: Start difference. First operand 47 states and 72 transitions. cyclomatic complexity: 31 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:30:28,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:30:28,183 INFO L93 Difference]: Finished difference Result 48 states and 71 transitions. [2025-02-08 14:30:28,183 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 71 transitions. [2025-02-08 14:30:28,184 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2025-02-08 14:30:28,185 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 47 states and 70 transitions. [2025-02-08 14:30:28,185 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2025-02-08 14:30:28,185 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2025-02-08 14:30:28,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 70 transitions. [2025-02-08 14:30:28,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:30:28,185 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47 states and 70 transitions. [2025-02-08 14:30:28,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 70 transitions. [2025-02-08 14:30:28,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-02-08 14:30:28,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 46 states have internal predecessors, (70), 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-02-08 14:30:28,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 70 transitions. [2025-02-08 14:30:28,186 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47 states and 70 transitions. [2025-02-08 14:30:28,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:30:28,188 INFO L432 stractBuchiCegarLoop]: Abstraction has 47 states and 70 transitions. [2025-02-08 14:30:28,188 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-02-08 14:30:28,188 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 70 transitions. [2025-02-08 14:30:28,188 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2025-02-08 14:30:28,188 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:30:28,188 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:30:28,189 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:30:28,189 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-08 14:30:28,189 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~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet18#1, main_#t~post19#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1;main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1;main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0;" "assume lis_~i~0#1 < lis_~N#1;call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume lis_~i~0#1 < lis_~N#1;call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume !(lis_~i~0#1 < lis_~N#1);lis_~i~0#1 := 1;" "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume !lis_#t~short9#1;" "assume !lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume !(lis_~j~0#1 < lis_~i~0#1);lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1;" "assume !(lis_~i~0#1 < lis_~N#1);lis_~i~0#1 := 0;" [2025-02-08 14:30:28,189 INFO L754 eck$LassoCheckResult]: Loop: "assume lis_~i~0#1 < lis_~N#1;call lis_#t~mem13#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);" "assume lis_~max~0#1 < lis_#t~mem13#1;havoc lis_#t~mem13#1;call lis_#t~mem14#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);lis_~max~0#1 := lis_#t~mem14#1;" "lis_#t~post15#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post15#1;havoc lis_#t~post15#1;" [2025-02-08 14:30:28,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:30:28,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1333666759, now seen corresponding path program 1 times [2025-02-08 14:30:28,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:30:28,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474791125] [2025-02-08 14:30:28,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:30:28,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:30:28,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 14:30:28,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 14:30:28,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:28,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:28,205 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:30:28,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 14:30:28,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 14:30:28,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:28,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:28,216 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:30:28,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:30:28,218 INFO L85 PathProgramCache]: Analyzing trace with hash 39656, now seen corresponding path program 4 times [2025-02-08 14:30:28,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:30:28,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606732040] [2025-02-08 14:30:28,218 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:30:28,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:30:28,221 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-02-08 14:30:28,222 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:30:28,222 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 14:30:28,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:28,222 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:30:28,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:30:28,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:30:28,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:28,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:28,224 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:30:28,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:30:28,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1476047792, now seen corresponding path program 1 times [2025-02-08 14:30:28,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:30:28,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959938511] [2025-02-08 14:30:28,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:30:28,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:30:28,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 14:30:28,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 14:30:28,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:28,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:28,254 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:30:28,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 14:30:28,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 14:30:28,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:28,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:28,281 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:30:30,454 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:30:30,454 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:30:30,458 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:30:30,458 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:30:30,458 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:30:30,458 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:30,459 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:30:30,459 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:30:30,459 INFO L132 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration13_Lasso [2025-02-08 14:30:30,459 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:30:30,459 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:30:30,460 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:30,469 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:30,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:30,471 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:30,472 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:30,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:30,475 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:30,476 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:30,477 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:30,478 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:30,480 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:30,481 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:30,482 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:30,483 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:30,485 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:30,486 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:30,487 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:30,495 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:30,499 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:30,500 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:30,501 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:30,502 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:30,830 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:30,831 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:30,832 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:30,833 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:30,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:30,836 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:30:31,066 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:30:31,066 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:30:31,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:31,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:31,069 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:31,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2025-02-08 14:30:31,074 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:31,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:31,084 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:31,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:31,084 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:31,084 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:31,084 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:31,084 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:31,085 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:31,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2025-02-08 14:30:31,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:31,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:31,092 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:31,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2025-02-08 14:30:31,094 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:31,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:31,104 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:31,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:31,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:31,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:31,104 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:31,104 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:31,105 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:31,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2025-02-08 14:30:31,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:31,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:31,112 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:31,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2025-02-08 14:30:31,113 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:31,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:31,123 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:31,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:31,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:31,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:31,124 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:31,124 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:31,124 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:31,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2025-02-08 14:30:31,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:31,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:31,132 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:31,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2025-02-08 14:30:31,134 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:31,144 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:31,144 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:31,144 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:31,144 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:31,144 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:31,144 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:31,144 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:31,145 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:31,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2025-02-08 14:30:31,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:31,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:31,152 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:31,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2025-02-08 14:30:31,154 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:31,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:31,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:31,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:31,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:31,164 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:30:31,164 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:30:31,167 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:31,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2025-02-08 14:30:31,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:31,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:31,174 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:31,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2025-02-08 14:30:31,175 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:31,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:31,185 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:31,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:31,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:31,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:31,185 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:31,185 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:31,186 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:31,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2025-02-08 14:30:31,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:31,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:31,193 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:31,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2025-02-08 14:30:31,194 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:31,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:31,204 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:31,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:31,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:31,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:31,205 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:31,205 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:31,206 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:31,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2025-02-08 14:30:31,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:31,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:31,213 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:31,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2025-02-08 14:30:31,214 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:31,224 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:31,224 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:31,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:31,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:31,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:31,225 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:31,225 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:31,225 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:31,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2025-02-08 14:30:31,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:31,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:31,232 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:31,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2025-02-08 14:30:31,234 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:31,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:31,243 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:31,243 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:31,243 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:31,243 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:31,243 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:31,243 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:31,244 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:31,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2025-02-08 14:30:31,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:31,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:31,251 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:31,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2025-02-08 14:30:31,253 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:31,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:31,263 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:31,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:31,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:31,263 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:31,263 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:31,263 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:31,264 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:31,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2025-02-08 14:30:31,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:31,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:31,271 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:31,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2025-02-08 14:30:31,272 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:31,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:31,282 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:31,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:31,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:31,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:31,282 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:31,282 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:31,283 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:31,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2025-02-08 14:30:31,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:31,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:31,290 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:31,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2025-02-08 14:30:31,291 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:31,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:31,300 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:31,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:31,300 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:31,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:31,301 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:31,301 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:31,302 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:31,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2025-02-08 14:30:31,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:31,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:31,308 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:31,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2025-02-08 14:30:31,310 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:31,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:31,319 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:31,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:31,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:31,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:31,319 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:31,319 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:31,320 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:31,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2025-02-08 14:30:31,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:31,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:31,327 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:31,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2025-02-08 14:30:31,328 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:31,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:31,337 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:31,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:31,338 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:31,338 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:31,338 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:31,338 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:31,339 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:31,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0 [2025-02-08 14:30:31,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:31,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:31,346 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:31,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2025-02-08 14:30:31,348 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:31,357 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:31,357 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:31,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:31,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:31,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:31,357 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:31,357 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:31,358 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:31,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2025-02-08 14:30:31,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:31,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:31,365 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:31,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2025-02-08 14:30:31,366 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:31,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:31,376 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:31,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:31,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:31,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:31,376 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:31,376 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:31,377 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:31,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2025-02-08 14:30:31,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:31,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:31,383 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:31,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2025-02-08 14:30:31,385 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:31,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:31,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:31,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:31,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:31,395 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:30:31,396 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:30:31,400 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:31,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2025-02-08 14:30:31,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:31,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:31,408 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:31,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2025-02-08 14:30:31,412 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:31,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:31,421 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:31,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:31,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:31,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:31,422 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:31,422 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:31,423 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:31,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Forceful destruction successful, exit code 0 [2025-02-08 14:30:31,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:31,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:31,432 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:31,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2025-02-08 14:30:31,434 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:31,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:31,444 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:31,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:31,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:31,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:31,445 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:31,445 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:31,446 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:31,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Forceful destruction successful, exit code 0 [2025-02-08 14:30:31,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:31,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:31,454 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:31,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2025-02-08 14:30:31,459 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:31,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:31,469 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:31,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:31,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:31,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:31,469 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:31,469 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:31,470 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:31,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Forceful destruction successful, exit code 0 [2025-02-08 14:30:31,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:31,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:31,478 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:31,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2025-02-08 14:30:31,480 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:31,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:31,489 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:30:31,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:31,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:31,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:31,489 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:30:31,489 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:30:31,490 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:31,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2025-02-08 14:30:31,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:31,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:31,498 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:31,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2025-02-08 14:30:31,499 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:31,508 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:31,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:31,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:31,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:31,510 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:30:31,510 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:30:31,513 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:31,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2025-02-08 14:30:31,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:31,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:31,523 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:31,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2025-02-08 14:30:31,524 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:31,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:31,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:31,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:31,534 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:31,534 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:30:31,534 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:30:31,537 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:31,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2025-02-08 14:30:31,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:31,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:31,545 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:31,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2025-02-08 14:30:31,546 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:31,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:31,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:31,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:31,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:31,556 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:30:31,556 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:30:31,558 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:31,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2025-02-08 14:30:31,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:31,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:31,565 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:31,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2025-02-08 14:30:31,567 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:31,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:31,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:31,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:31,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:31,579 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:30:31,579 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:30:31,585 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:31,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2025-02-08 14:30:31,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:31,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:31,593 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:31,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2025-02-08 14:30:31,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-02-08 14:30:31,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:31,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:31,606 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:31,606 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:31,607 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:30:31,607 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:30:31,610 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:31,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Ended with exit code 0 [2025-02-08 14:30:31,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:31,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:31,618 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:31,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2025-02-08 14:30:31,619 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:31,628 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:31,628 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:31,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:31,629 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:31,629 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:30:31,629 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:30:31,631 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:31,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2025-02-08 14:30:31,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:31,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:31,638 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:31,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2025-02-08 14:30:31,640 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:31,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:31,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:31,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:31,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:31,650 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:30:31,650 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:30:31,652 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:31,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2025-02-08 14:30:31,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:31,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:31,659 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:31,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2025-02-08 14:30:31,661 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:31,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:31,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:31,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:31,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:31,672 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:30:31,672 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:30:31,677 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:31,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2025-02-08 14:30:31,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:31,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:31,684 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:31,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2025-02-08 14:30:31,685 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:31,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:31,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:31,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:31,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:31,696 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:30:31,696 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:30:31,698 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:31,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Forceful destruction successful, exit code 0 [2025-02-08 14:30:31,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:31,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:31,706 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:31,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2025-02-08 14:30:31,707 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:31,717 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:31,717 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:31,717 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:31,717 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:31,718 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:30:31,718 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:30:31,722 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:31,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2025-02-08 14:30:31,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:31,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:31,730 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:31,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2025-02-08 14:30:31,731 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:31,741 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:31,741 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:31,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:31,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:31,742 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:30:31,742 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:30:31,744 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:31,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Forceful destruction successful, exit code 0 [2025-02-08 14:30:31,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:31,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:31,752 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:31,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2025-02-08 14:30:31,753 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:31,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:31,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:31,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:31,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:31,764 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:30:31,764 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:30:31,766 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:31,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0 [2025-02-08 14:30:31,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:31,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:31,773 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:31,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2025-02-08 14:30:31,775 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:31,784 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:31,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:31,785 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:31,785 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:31,785 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:30:31,785 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:30:31,787 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:31,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Ended with exit code 0 [2025-02-08 14:30:31,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:31,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:31,795 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:31,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2025-02-08 14:30:31,797 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:31,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:31,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:31,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:31,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:31,807 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:30:31,807 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:30:31,810 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:30:31,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Ended with exit code 0 [2025-02-08 14:30:31,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:31,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:31,817 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:31,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2025-02-08 14:30:31,819 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:30:31,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:30:31,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:30:31,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:30:31,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:30:31,831 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:30:31,831 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:30:31,838 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:30:31,847 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-02-08 14:30:31,848 INFO L444 ModelExtractionUtils]: 3 out of 19 variables were initially zero. Simplification set additionally 13 variables to zero. [2025-02-08 14:30:31,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:30:31,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:31,850 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:30:31,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2025-02-08 14:30:31,851 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:30:31,861 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-08 14:30:31,861 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:30:31,861 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0#1, ULTIMATE.start_lis_~N#1) = -1*ULTIMATE.start_lis_~i~0#1 + 1*ULTIMATE.start_lis_~N#1 Supporting invariants [] [2025-02-08 14:30:31,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0 [2025-02-08 14:30:31,898 INFO L156 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2025-02-08 14:30:31,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:30:31,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 14:30:31,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 14:30:31,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:31,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:30:31,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:30:31,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:30:31,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:30:31,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:30:31,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:31,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:30:31,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:30:31,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:30:31,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:30:31,954 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-08 14:30:31,954 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47 states and 70 transitions. cyclomatic complexity: 29 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-02-08 14:30:31,966 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 47 states and 70 transitions. cyclomatic complexity: 29. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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) Result 50 states and 75 transitions. Complement of second has 4 states. [2025-02-08 14:30:31,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-02-08 14:30:31,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-02-08 14:30:31,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2025-02-08 14:30:31,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 16 letters. Loop has 3 letters. [2025-02-08 14:30:31,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:30:31,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 19 letters. Loop has 3 letters. [2025-02-08 14:30:31,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:30:31,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 16 letters. Loop has 6 letters. [2025-02-08 14:30:31,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:30:31,967 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 75 transitions. [2025-02-08 14:30:31,968 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-02-08 14:30:31,968 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 34 states and 50 transitions. [2025-02-08 14:30:31,968 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2025-02-08 14:30:31,968 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2025-02-08 14:30:31,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 50 transitions. [2025-02-08 14:30:31,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:30:31,969 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 50 transitions. [2025-02-08 14:30:31,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 50 transitions. [2025-02-08 14:30:31,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-02-08 14:30:31,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 33 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:30:31,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 50 transitions. [2025-02-08 14:30:31,970 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 50 transitions. [2025-02-08 14:30:31,970 INFO L432 stractBuchiCegarLoop]: Abstraction has 34 states and 50 transitions. [2025-02-08 14:30:31,970 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-02-08 14:30:31,970 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 50 transitions. [2025-02-08 14:30:31,970 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-02-08 14:30:31,970 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:30:31,970 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:30:31,971 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:30:31,971 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-02-08 14:30:31,971 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~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet18#1, main_#t~post19#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1;main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1;main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1;main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0;" "assume lis_~i~0#1 < lis_~N#1;call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume lis_~i~0#1 < lis_~N#1;call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume !(lis_~i~0#1 < lis_~N#1);lis_~i~0#1 := 1;" "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume !lis_#t~short9#1;" "assume !lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume !(lis_~j~0#1 < lis_~i~0#1);lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1;" [2025-02-08 14:30:31,971 INFO L754 eck$LassoCheckResult]: Loop: "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1;" "assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume !(lis_~j~0#1 < lis_~i~0#1);lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1;" [2025-02-08 14:30:31,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:30:31,971 INFO L85 PathProgramCache]: Analyzing trace with hash -667203399, now seen corresponding path program 1 times [2025-02-08 14:30:31,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:30:31,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656408506] [2025-02-08 14:30:31,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:30:31,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:30:31,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 14:30:31,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 14:30:31,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:31,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:30:32,057 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:30:32,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:30:32,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656408506] [2025-02-08 14:30:32,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656408506] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:30:32,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648700835] [2025-02-08 14:30:32,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:30:32,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:30:32,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:32,060 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:30:32,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Waiting until timeout for monitored process [2025-02-08 14:30:32,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 14:30:32,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 14:30:32,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:32,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:30:32,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 14:30:32,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:30:32,178 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:30:32,178 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:30:32,219 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:30:32,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648700835] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:30:32,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:30:32,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2025-02-08 14:30:32,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007607778] [2025-02-08 14:30:32,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:30:32,220 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:30:32,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:30:32,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1448571453, now seen corresponding path program 4 times [2025-02-08 14:30:32,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:30:32,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928511339] [2025-02-08 14:30:32,220 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:30:32,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:30:32,225 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 6 statements into 2 equivalence classes. [2025-02-08 14:30:32,228 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:30:32,228 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 14:30:32,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:32,228 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:30:32,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:30:32,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:30:32,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:32,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:32,233 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:30:32,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:30:32,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 14:30:32,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-02-08 14:30:32,414 INFO L87 Difference]: Start difference. First operand 34 states and 50 transitions. cyclomatic complexity: 20 Second operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:30:32,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:30:32,457 INFO L93 Difference]: Finished difference Result 35 states and 51 transitions. [2025-02-08 14:30:32,457 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 51 transitions. [2025-02-08 14:30:32,457 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-02-08 14:30:32,458 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 51 transitions. [2025-02-08 14:30:32,458 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2025-02-08 14:30:32,458 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2025-02-08 14:30:32,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 51 transitions. [2025-02-08 14:30:32,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:30:32,458 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 51 transitions. [2025-02-08 14:30:32,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 51 transitions. [2025-02-08 14:30:32,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-02-08 14:30:32,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.457142857142857) internal successors, (51), 34 states have internal predecessors, (51), 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-02-08 14:30:32,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 51 transitions. [2025-02-08 14:30:32,459 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35 states and 51 transitions. [2025-02-08 14:30:32,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 14:30:32,461 INFO L432 stractBuchiCegarLoop]: Abstraction has 35 states and 51 transitions. [2025-02-08 14:30:32,461 INFO L338 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2025-02-08 14:30:32,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 51 transitions. [2025-02-08 14:30:32,461 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-02-08 14:30:32,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:30:32,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:30:32,461 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:30:32,461 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-02-08 14:30:32,461 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~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet18#1, main_#t~post19#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1;main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1;main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1;main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0;" "assume lis_~i~0#1 < lis_~N#1;call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume lis_~i~0#1 < lis_~N#1;call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume lis_~i~0#1 < lis_~N#1;call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume !(lis_~i~0#1 < lis_~N#1);lis_~i~0#1 := 1;" "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume !lis_#t~short9#1;" "assume !lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume !(lis_~j~0#1 < lis_~i~0#1);lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1;" [2025-02-08 14:30:32,461 INFO L754 eck$LassoCheckResult]: Loop: "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1;" "assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume !(lis_~j~0#1 < lis_~i~0#1);lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1;" [2025-02-08 14:30:32,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:30:32,462 INFO L85 PathProgramCache]: Analyzing trace with hash -843507950, now seen corresponding path program 2 times [2025-02-08 14:30:32,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:30:32,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781478856] [2025-02-08 14:30:32,462 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:30:32,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:30:32,467 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-02-08 14:30:32,477 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 14:30:32,477 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:30:32,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:32,478 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:30:32,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 14:30:32,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 14:30:32,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:32,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:32,493 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:30:32,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:30:32,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1448571453, now seen corresponding path program 5 times [2025-02-08 14:30:32,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:30:32,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277496209] [2025-02-08 14:30:32,494 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 14:30:32,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:30:32,499 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 6 statements into 2 equivalence classes. [2025-02-08 14:30:32,501 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:30:32,503 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:30:32,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:32,504 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:30:32,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:30:32,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:30:32,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:32,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:32,508 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:30:32,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:30:32,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1743599758, now seen corresponding path program 1 times [2025-02-08 14:30:32,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:30:32,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785588994] [2025-02-08 14:30:32,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:30:32,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:30:32,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 14:30:32,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 14:30:32,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:32,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:30:32,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2025-02-08 14:30:32,600 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-08 14:30:32,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:30:32,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785588994] [2025-02-08 14:30:32,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785588994] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:30:32,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330554046] [2025-02-08 14:30:32,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:30:32,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:30:32,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:32,606 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:30:32,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Waiting until timeout for monitored process [2025-02-08 14:30:32,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 14:30:32,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 14:30:32,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:32,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:30:32,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:30:32,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:30:32,724 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-08 14:30:32,725 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:30:32,750 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-08 14:30:32,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330554046] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:30:32,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:30:32,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-02-08 14:30:32,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649151527] [2025-02-08 14:30:32,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:30:32,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:30:32,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 14:30:32,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-02-08 14:30:32,929 INFO L87 Difference]: Start difference. First operand 35 states and 51 transitions. cyclomatic complexity: 20 Second operand has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 10 states have internal predecessors, (37), 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-02-08 14:30:32,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:30:32,976 INFO L93 Difference]: Finished difference Result 48 states and 70 transitions. [2025-02-08 14:30:32,976 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 70 transitions. [2025-02-08 14:30:32,976 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-02-08 14:30:32,977 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 30 states and 42 transitions. [2025-02-08 14:30:32,977 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2025-02-08 14:30:32,977 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2025-02-08 14:30:32,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 42 transitions. [2025-02-08 14:30:32,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:30:32,977 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 42 transitions. [2025-02-08 14:30:32,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 42 transitions. [2025-02-08 14:30:32,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2025-02-08 14:30:32,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 26 states have internal predecessors, (37), 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-02-08 14:30:32,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2025-02-08 14:30:32,979 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 37 transitions. [2025-02-08 14:30:32,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 14:30:32,984 INFO L432 stractBuchiCegarLoop]: Abstraction has 27 states and 37 transitions. [2025-02-08 14:30:32,984 INFO L338 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2025-02-08 14:30:32,984 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 37 transitions. [2025-02-08 14:30:32,984 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2025-02-08 14:30:32,984 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:30:32,984 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:30:32,985 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:30:32,985 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1] [2025-02-08 14:30:32,985 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~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet18#1, main_#t~post19#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1;main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1;main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1;main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0;" "assume lis_~i~0#1 < lis_~N#1;call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume lis_~i~0#1 < lis_~N#1;call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume lis_~i~0#1 < lis_~N#1;call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume !(lis_~i~0#1 < lis_~N#1);lis_~i~0#1 := 1;" "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume !lis_#t~short9#1;" "assume !lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume !(lis_~j~0#1 < lis_~i~0#1);lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1;" [2025-02-08 14:30:32,985 INFO L754 eck$LassoCheckResult]: Loop: "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1;" "assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1;" "assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume !(lis_~j~0#1 < lis_~i~0#1);lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1;" [2025-02-08 14:30:32,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:30:32,987 INFO L85 PathProgramCache]: Analyzing trace with hash -843507950, now seen corresponding path program 3 times [2025-02-08 14:30:32,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:30:32,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41925936] [2025-02-08 14:30:32,987 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:30:32,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:30:32,993 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 3 equivalence classes. [2025-02-08 14:30:33,006 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 14:30:33,007 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-08 14:30:33,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:33,007 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:30:33,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 14:30:33,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 14:30:33,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:33,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:33,018 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:30:33,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:30:33,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1660545824, now seen corresponding path program 6 times [2025-02-08 14:30:33,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:30:33,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290640071] [2025-02-08 14:30:33,018 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 14:30:33,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:30:33,023 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 10 statements into 3 equivalence classes. [2025-02-08 14:30:33,026 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:30:33,026 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-02-08 14:30:33,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:33,026 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:30:33,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:30:33,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:30:33,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:30:33,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:30:33,031 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:30:33,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:30:33,032 INFO L85 PathProgramCache]: Analyzing trace with hash -960607567, now seen corresponding path program 2 times [2025-02-08 14:30:33,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:30:33,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000119838] [2025-02-08 14:30:33,032 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:30:33,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:30:33,040 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-02-08 14:30:33,061 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 14:30:33,061 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:30:33,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:30:33,896 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 14:30:33,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:30:33,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000119838] [2025-02-08 14:30:33,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000119838] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:30:33,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201187124] [2025-02-08 14:30:33,897 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:30:33,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:30:33,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:30:33,899 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:30:33,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Waiting until timeout for monitored process [2025-02-08 14:30:33,966 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-02-08 14:30:33,992 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 14:30:33,992 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:30:33,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:30:33,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-02-08 14:30:33,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:30:34,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 14:30:34,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-08 14:30:34,048 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:30:34,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-02-08 14:30:34,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 14:30:34,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 14:30:34,230 INFO L349 Elim1Store]: treesize reduction 19, result has 36.7 percent of original size [2025-02-08 14:30:34,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 35 [2025-02-08 14:30:34,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 14:30:34,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 14:30:34,334 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:30:34,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 28 [2025-02-08 14:30:34,357 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 14:30:34,357 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:30:34,744 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 61 treesize of output 57 [2025-02-08 14:30:34,752 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:30:34,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 468 treesize of output 420 [2025-02-08 14:30:34,792 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 14:30:34,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201187124] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:30:34,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:30:34,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 12] total 35 [2025-02-08 14:30:34,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126962272] [2025-02-08 14:30:34,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:30:35,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:30:35,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-08 14:30:35,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1012, Unknown=0, NotChecked=0, Total=1190 [2025-02-08 14:30:35,182 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. cyclomatic complexity: 13 Second operand has 35 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 35 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:31:28,483 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (* 4 |c_ULTIMATE.start_lis_~i~0#1|))) (let ((.cse11 (* |c_ULTIMATE.start_lis_~j~0#1| 4)) (.cse0 (select |c_#memory_int#1| |c_ULTIMATE.start_lis_~best~0#1.base|)) (.cse6 (+ .cse3 |c_ULTIMATE.start_lis_~best~0#1.offset|))) (let ((.cse2 (select .cse0 .cse6)) (.cse8 (+ 4 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (.cse5 (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (.cse1 (+ 4 .cse11 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (.cse4 (select .cse0 (+ .cse11 |c_ULTIMATE.start_lis_~best~0#1.offset|)))) (and (< (select .cse0 .cse1) .cse2) (<= 2 (select .cse0 .cse3)) (< .cse4 .cse2) (= 0 |c_ULTIMATE.start_lis_~best~0#1.offset|) (forall ((|v_ULTIMATE.start_lis_#t~mem10#1_42| Int)) (or (< |v_ULTIMATE.start_lis_#t~mem10#1_42| .cse5) (let ((.cse7 (+ |v_ULTIMATE.start_lis_#t~mem10#1_42| 1))) (< (select (store .cse0 .cse6 .cse7) .cse8) .cse7)))) (forall ((|v_ULTIMATE.start_lis_~i~0#1_196| Int)) (or (forall ((|v_ULTIMATE.start_lis_#t~mem10#1_42| Int)) (or (let ((.cse9 (+ |v_ULTIMATE.start_lis_#t~mem10#1_42| 1))) (< (select (store .cse0 (+ (* 4 |v_ULTIMATE.start_lis_~i~0#1_196|) |c_ULTIMATE.start_lis_~best~0#1.offset|) .cse9) .cse8) .cse9)) (< |v_ULTIMATE.start_lis_#t~mem10#1_42| .cse5))) (< |v_ULTIMATE.start_lis_~i~0#1_196| (+ |c_ULTIMATE.start_lis_~i~0#1| 1)))) (= |c_ULTIMATE.start_lis_~j~0#1| 0) (<= 2 |c_ULTIMATE.start_lis_~i~0#1|) (= (select .cse0 0) 1) (forall ((|v_ULTIMATE.start_lis_#t~mem10#1_42| Int)) (or (let ((.cse10 (+ |v_ULTIMATE.start_lis_#t~mem10#1_42| 1))) (< (select (store .cse0 .cse6 .cse10) .cse1) .cse10)) (< |v_ULTIMATE.start_lis_#t~mem10#1_42| .cse4))) (= 1 (select .cse0 4)) (or (< 2 |c_ULTIMATE.start_lis_~i~0#1|) (= (select .cse0 (+ .cse3 (- 4))) 1)))))) is different from false [2025-02-08 14:31:43,063 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 101 [2025-02-08 14:31:43,063 WARN L249 Executor]: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-02-08 14:31:43,065 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:912) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:283) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:246) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:210) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.BuchiAutomatonCegarLoop.refineFinite(BuchiAutomatonCegarLoop.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.BuchiAutomatonCegarLoop.refineFinite(BuchiAutomatonCegarLoop.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.refineFiniteInternal(AbstractBuchiCegarLoop.java:476) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:405) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.runCegarLoops(BuchiAutomizerObserver.java:151) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:364) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 42 more [2025-02-08 14:31:43,069 INFO L158 Benchmark]: Toolchain (without parser) took 84876.29ms. Allocated memory was 167.8MB in the beginning and 478.2MB in the end (delta: 310.4MB). Free memory was 121.5MB in the beginning and 232.7MB in the end (delta: -111.2MB). Peak memory consumption was 203.7MB. Max. memory is 16.1GB. [2025-02-08 14:31:43,070 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:31:43,070 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.03ms. Allocated memory is still 167.8MB. Free memory was 121.5MB in the beginning and 104.8MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 14:31:43,070 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.04ms. Allocated memory is still 167.8MB. Free memory was 104.8MB in the beginning and 102.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:31:43,070 INFO L158 Benchmark]: Boogie Preprocessor took 30.76ms. Allocated memory is still 167.8MB. Free memory was 102.9MB in the beginning and 101.3MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:31:43,070 INFO L158 Benchmark]: IcfgBuilder took 258.93ms. Allocated memory is still 167.8MB. Free memory was 101.3MB in the beginning and 85.5MB in the end (delta: 15.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:31:43,071 INFO L158 Benchmark]: BuchiAutomizer took 84299.18ms. Allocated memory was 167.8MB in the beginning and 478.2MB in the end (delta: 310.4MB). Free memory was 85.5MB in the beginning and 232.7MB in the end (delta: -147.2MB). Peak memory consumption was 170.2MB. Max. memory is 16.1GB. [2025-02-08 14:31:43,072 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 257.03ms. Allocated memory is still 167.8MB. Free memory was 121.5MB in the beginning and 104.8MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.04ms. Allocated memory is still 167.8MB. Free memory was 104.8MB in the beginning and 102.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.76ms. Allocated memory is still 167.8MB. Free memory was 102.9MB in the beginning and 101.3MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 258.93ms. Allocated memory is still 167.8MB. Free memory was 101.3MB in the beginning and 85.5MB in the end (delta: 15.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 84299.18ms. Allocated memory was 167.8MB in the beginning and 478.2MB in the end (delta: 310.4MB). Free memory was 85.5MB in the beginning and 232.7MB in the end (delta: -147.2MB). Peak memory consumption was 170.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: SMTLIBException: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2025-02-08 14:31:43,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Forceful destruction successful, exit code 0 [2025-02-08 14:31:43,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Forceful destruction successful, exit code 0 [2025-02-08 14:31:43,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Ended with exit code 0 [2025-02-08 14:31:43,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Ended with exit code 0 [2025-02-08 14:31:43,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Forceful destruction successful, exit code 0 [2025-02-08 14:31:44,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Ended with exit code 0 [2025-02-08 14:31:44,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Ended with exit code 0 [2025-02-08 14:31:44,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory")