./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loops/invert_string-3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loops/invert_string-3.c -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 ca98535e808a51f7cfa7d21c9d33f259821212a6554e27f29c2bddd9197c0249 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 07:32:20,073 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 07:32:20,129 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-01-10 07:32:20,135 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 07:32:20,135 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 07:32:20,153 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 07:32:20,154 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 07:32:20,154 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 07:32:20,154 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 07:32:20,154 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 07:32:20,154 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 07:32:20,155 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 07:32:20,155 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 07:32:20,155 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-01-10 07:32:20,158 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-01-10 07:32:20,158 INFO L153 SettingsManager]: * Use old map elimination=false [2025-01-10 07:32:20,158 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-01-10 07:32:20,158 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-01-10 07:32:20,158 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-01-10 07:32:20,158 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 07:32:20,158 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-01-10 07:32:20,158 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 07:32:20,158 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 07:32:20,158 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 07:32:20,158 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 07:32:20,158 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-01-10 07:32:20,158 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-01-10 07:32:20,158 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-01-10 07:32:20,158 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 07:32:20,159 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 07:32:20,159 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 07:32:20,159 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-01-10 07:32:20,159 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 07:32:20,159 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 07:32:20,159 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 07:32:20,159 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 07:32:20,159 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 07:32:20,159 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 07:32:20,159 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-01-10 07:32:20,159 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 -> ca98535e808a51f7cfa7d21c9d33f259821212a6554e27f29c2bddd9197c0249 [2025-01-10 07:32:20,386 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 07:32:20,391 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 07:32:20,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 07:32:20,393 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 07:32:20,394 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 07:32:20,395 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/invert_string-3.c [2025-01-10 07:32:21,564 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/42e79916f/f50514ca642d453f91294dd6e38bc55a/FLAGa86c914b1 [2025-01-10 07:32:21,782 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 07:32:21,783 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loops/invert_string-3.c [2025-01-10 07:32:21,791 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/42e79916f/f50514ca642d453f91294dd6e38bc55a/FLAGa86c914b1 [2025-01-10 07:32:21,809 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/42e79916f/f50514ca642d453f91294dd6e38bc55a [2025-01-10 07:32:21,812 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 07:32:21,813 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 07:32:21,814 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 07:32:21,814 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 07:32:21,817 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 07:32:21,818 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:32:21" (1/1) ... [2025-01-10 07:32:21,819 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14c2a408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:32:21, skipping insertion in model container [2025-01-10 07:32:21,819 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:32:21" (1/1) ... [2025-01-10 07:32:21,830 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 07:32:21,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:32:21,954 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 07:32:21,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:32:21,979 INFO L204 MainTranslator]: Completed translation [2025-01-10 07:32:21,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:32:21 WrapperNode [2025-01-10 07:32:21,981 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 07:32:21,982 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 07:32:21,983 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 07:32:21,983 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 07:32:21,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:32:21" (1/1) ... [2025-01-10 07:32:21,992 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:32:21" (1/1) ... [2025-01-10 07:32:22,007 INFO L138 Inliner]: procedures = 14, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 60 [2025-01-10 07:32:22,008 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 07:32:22,009 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 07:32:22,009 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 07:32:22,010 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 07:32:22,017 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:32:21" (1/1) ... [2025-01-10 07:32:22,017 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:32:21" (1/1) ... [2025-01-10 07:32:22,021 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:32:21" (1/1) ... [2025-01-10 07:32:22,029 INFO L175 MemorySlicer]: Split 8 memory accesses to 3 slices as follows [2, 4, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 2, 1]. [2025-01-10 07:32:22,030 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:32:21" (1/1) ... [2025-01-10 07:32:22,030 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:32:21" (1/1) ... [2025-01-10 07:32:22,033 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:32:21" (1/1) ... [2025-01-10 07:32:22,035 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:32:21" (1/1) ... [2025-01-10 07:32:22,037 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:32:21" (1/1) ... [2025-01-10 07:32:22,038 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:32:21" (1/1) ... [2025-01-10 07:32:22,038 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:32:21" (1/1) ... [2025-01-10 07:32:22,040 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 07:32:22,041 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 07:32:22,041 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 07:32:22,041 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 07:32:22,042 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:32:21" (1/1) ... [2025-01-10 07:32:22,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:32:22,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:32:22,065 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:32:22,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-01-10 07:32:22,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 07:32:22,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 07:32:22,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 07:32:22,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 07:32:22,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 07:32:22,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 07:32:22,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 07:32:22,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 07:32:22,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 07:32:22,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 07:32:22,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 07:32:22,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 07:32:22,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 07:32:22,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 07:32:22,141 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 07:32:22,143 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 07:32:22,265 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-01-10 07:32:22,265 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 07:32:22,276 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 07:32:22,276 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 07:32:22,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:32:22 BoogieIcfgContainer [2025-01-10 07:32:22,277 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 07:32:22,278 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-01-10 07:32:22,278 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-01-10 07:32:22,283 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-01-10 07:32:22,284 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:32:22,284 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.01 07:32:21" (1/3) ... [2025-01-10 07:32:22,285 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d528994 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:32:22, skipping insertion in model container [2025-01-10 07:32:22,287 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:32:22,287 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:32:21" (2/3) ... [2025-01-10 07:32:22,287 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d528994 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:32:22, skipping insertion in model container [2025-01-10 07:32:22,287 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:32:22,287 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:32:22" (3/3) ... [2025-01-10 07:32:22,288 INFO L363 chiAutomizerObserver]: Analyzing ICFG invert_string-3.c [2025-01-10 07:32:22,339 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-01-10 07:32:22,339 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-01-10 07:32:22,339 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-01-10 07:32:22,339 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-01-10 07:32:22,339 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-01-10 07:32:22,340 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-01-10 07:32:22,340 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-01-10 07:32:22,340 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-01-10 07:32:22,344 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 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-01-10 07:32:22,359 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2025-01-10 07:32:22,360 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:32:22,360 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:32:22,363 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:32:22,363 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-01-10 07:32:22,364 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-01-10 07:32:22,364 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 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-01-10 07:32:22,366 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2025-01-10 07:32:22,366 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:32:22,366 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:32:22,367 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:32:22,367 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-01-10 07:32:22,373 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~post12#1, main_~max~0#1, main_~#str1~0#1.base, main_~#str1~0#1.offset, main_~#str2~0#1.base, main_~#str2~0#1.offset, main_~i~0#1, main_~j~0#1;main_~max~0#1 := 5;call main_~#str1~0#1.base, main_~#str1~0#1.offset := #Ultimate.allocOnStack(main_~max~0#1 % 4294967296);call main_~#str2~0#1.base, main_~#str2~0#1.offset := #Ultimate.allocOnStack(main_~max~0#1 % 4294967296);havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0;" [2025-01-10 07:32:22,373 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet4#1;main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" [2025-01-10 07:32:22,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:32:22,378 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2025-01-10 07:32:22,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:32:22,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258828030] [2025-01-10 07:32:22,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:32:22,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:32:22,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:32:22,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:32:22,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:32:22,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:32:22,464 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:32:22,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:32:22,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:32:22,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:32:22,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:32:22,490 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:32:22,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:32:22,494 INFO L85 PathProgramCache]: Analyzing trace with hash 37, now seen corresponding path program 1 times [2025-01-10 07:32:22,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:32:22,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53357335] [2025-01-10 07:32:22,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:32:22,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:32:22,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:32:22,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:32:22,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:32:22,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:32:22,517 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:32:22,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:32:22,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:32:22,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:32:22,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:32:22,527 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:32:22,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:32:22,531 INFO L85 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 1 times [2025-01-10 07:32:22,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:32:22,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057340477] [2025-01-10 07:32:22,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:32:22,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:32:22,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:32:22,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:32:22,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:32:22,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:32:22,572 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:32:22,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:32:22,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:32:22,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:32:22,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:32:22,591 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:32:22,952 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:32:22,953 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:32:22,954 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:32:22,954 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:32:22,954 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:32:22,954 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:32:22,954 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:32:22,954 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:32:22,954 INFO L132 ssoRankerPreferences]: Filename of dumped script: invert_string-3.c_Iteration1_Lasso [2025-01-10 07:32:22,955 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:32:22,955 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:32:22,968 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:32:22,975 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:32:23,226 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:32:23,229 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:32:23,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:32:23,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:32:23,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:32:23,247 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:32:23,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:32:23,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:32:23,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:32:23,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:32:23,258 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:32:23,260 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:32:23,529 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:32:23,532 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:32:23,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:32:23,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:32:23,535 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:32:23,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-01-10 07:32:23,539 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:32:23,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:32:23,550 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:32:23,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:32:23,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:32:23,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:32:23,554 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:32:23,554 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:32:23,556 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:32:23,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-01-10 07:32:23,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:32:23,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:32:23,565 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:32:23,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-01-10 07:32:23,568 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:32:23,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:32:23,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:32:23,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:32:23,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:32:23,582 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:32:23,582 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:32:23,585 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:32:23,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-01-10 07:32:23,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:32:23,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:32:23,595 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:32:23,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-01-10 07:32:23,598 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:32:23,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:32:23,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:32:23,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:32:23,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:32:23,612 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:32:23,613 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:32:23,615 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:32:23,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-01-10 07:32:23,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:32:23,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:32:23,624 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:32:23,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-01-10 07:32:23,627 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:32:23,637 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:32:23,637 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:32:23,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:32:23,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:32:23,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:32:23,638 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:32:23,638 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:32:23,639 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:32:23,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-01-10 07:32:23,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:32:23,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:32:23,647 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:32:23,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-01-10 07:32:23,650 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:32:23,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:32:23,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:32:23,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:32:23,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:32:23,662 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:32:23,662 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:32:23,665 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:32:23,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-01-10 07:32:23,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:32:23,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:32:23,673 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:32:23,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-01-10 07:32:23,675 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:32:23,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:32:23,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:32:23,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:32:23,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:32:23,692 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:32:23,692 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:32:23,700 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:32:23,720 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-01-10 07:32:23,722 INFO L444 ModelExtractionUtils]: 1 out of 16 variables were initially zero. Simplification set additionally 11 variables to zero. [2025-01-10 07:32:23,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:32:23,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:32:23,728 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:32:23,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-01-10 07:32:23,733 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:32:23,747 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-01-10 07:32:23,748 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:32:23,748 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, v_rep(select #length ULTIMATE.start_main_~#str1~0#1.base)_1, ULTIMATE.start_main_~#str1~0#1.offset) = -1*ULTIMATE.start_main_~i~0#1 + 1*v_rep(select #length ULTIMATE.start_main_~#str1~0#1.base)_1 - 1*ULTIMATE.start_main_~#str1~0#1.offset Supporting invariants [] [2025-01-10 07:32:23,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-01-10 07:32:23,780 INFO L156 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2025-01-10 07:32:23,786 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#str1~0!offset [2025-01-10 07:32:23,788 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-01-10 07:32:23,788 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-01-10 07:32:23,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:32:23,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:32:23,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:32:23,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:32:23,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:32:23,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:32:23,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:32:23,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:32:23,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:32:23,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:32:23,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:32:23,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:32:23,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:32:23,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:32:23,872 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-01-10 07:32:23,874 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 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) Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:32:23,899 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 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). Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 14 states and 19 transitions. Complement of second has 3 states. [2025-01-10 07:32:23,902 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-01-10 07:32:23,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:32:23,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3 transitions. [2025-01-10 07:32:23,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 2 letters. Loop has 1 letters. [2025-01-10 07:32:23,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:32:23,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 3 letters. Loop has 1 letters. [2025-01-10 07:32:23,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:32:23,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 2 letters. Loop has 2 letters. [2025-01-10 07:32:23,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:32:23,914 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2025-01-10 07:32:23,915 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-01-10 07:32:23,917 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 11 states and 16 transitions. [2025-01-10 07:32:23,918 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-01-10 07:32:23,918 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-01-10 07:32:23,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2025-01-10 07:32:23,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:32:23,919 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 16 transitions. [2025-01-10 07:32:23,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2025-01-10 07:32:23,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2025-01-10 07:32:23,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.4) 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-01-10 07:32:23,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2025-01-10 07:32:23,938 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 14 transitions. [2025-01-10 07:32:23,938 INFO L432 stractBuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2025-01-10 07:32:23,938 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-01-10 07:32:23,939 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 14 transitions. [2025-01-10 07:32:23,939 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-01-10 07:32:23,939 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:32:23,940 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:32:23,940 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-01-10 07:32:23,940 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-01-10 07:32:23,940 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~post12#1, main_~max~0#1, main_~#str1~0#1.base, main_~#str1~0#1.offset, main_~#str2~0#1.base, main_~#str2~0#1.offset, main_~i~0#1, main_~j~0#1;main_~max~0#1 := 5;call main_~#str1~0#1.base, main_~#str1~0#1.offset := #Ultimate.allocOnStack(main_~max~0#1 % 4294967296);call main_~#str2~0#1.base, main_~#str2~0#1.offset := #Ultimate.allocOnStack(main_~max~0#1 % 4294967296);havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0;" "assume !(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int#1(0, main_~#str1~0#1.base, main_~#str1~0#1.offset + (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0#1 := 0;main_~i~0#1 := (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296);" [2025-01-10 07:32:23,940 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 >= 0;call main_#t~mem6#1 := read~int#1(main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);call write~int#2(main_#t~mem6#1, main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);havoc main_#t~mem6#1;main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := main_#t~post8#1 - 1;havoc main_#t~post8#1;" [2025-01-10 07:32:23,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:32:23,942 INFO L85 PathProgramCache]: Analyzing trace with hash 29861, now seen corresponding path program 1 times [2025-01-10 07:32:23,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:32:23,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554027536] [2025-01-10 07:32:23,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:32:23,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:32:23,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:32:23,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:32:23,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:32:23,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:32:24,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-01-10 07:32:24,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:32:24,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:32:24,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554027536] [2025-01-10 07:32:24,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554027536] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:32:24,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:32:24,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 07:32:24,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146794091] [2025-01-10 07:32:24,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:32:24,258 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:32:24,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:32:24,258 INFO L85 PathProgramCache]: Analyzing trace with hash 43, now seen corresponding path program 1 times [2025-01-10 07:32:24,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:32:24,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414194394] [2025-01-10 07:32:24,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:32:24,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:32:24,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:32:24,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:32:24,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:32:24,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:32:24,268 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:32:24,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:32:24,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:32:24,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:32:24,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:32:24,273 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:32:24,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:32:24,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 07:32:24,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 07:32:24,335 INFO L87 Difference]: Start difference. First operand 10 states and 14 transitions. cyclomatic complexity: 7 Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:32:24,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:32:24,346 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2025-01-10 07:32:24,346 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. [2025-01-10 07:32:24,347 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-01-10 07:32:24,347 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 8 states and 10 transitions. [2025-01-10 07:32:24,348 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-01-10 07:32:24,348 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-01-10 07:32:24,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2025-01-10 07:32:24,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:32:24,348 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 10 transitions. [2025-01-10 07:32:24,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2025-01-10 07:32:24,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2025-01-10 07:32:24,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:32:24,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2025-01-10 07:32:24,349 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 10 transitions. [2025-01-10 07:32:24,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 07:32:24,350 INFO L432 stractBuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2025-01-10 07:32:24,350 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-01-10 07:32:24,350 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2025-01-10 07:32:24,351 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-01-10 07:32:24,351 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:32:24,351 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:32:24,351 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-01-10 07:32:24,351 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-01-10 07:32:24,352 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~post12#1, main_~max~0#1, main_~#str1~0#1.base, main_~#str1~0#1.offset, main_~#str2~0#1.base, main_~#str2~0#1.offset, main_~i~0#1, main_~j~0#1;main_~max~0#1 := 5;call main_~#str1~0#1.base, main_~#str1~0#1.offset := #Ultimate.allocOnStack(main_~max~0#1 % 4294967296);call main_~#str2~0#1.base, main_~#str2~0#1.offset := #Ultimate.allocOnStack(main_~max~0#1 % 4294967296);havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0;" "assume main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet4#1;main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int#1(0, main_~#str1~0#1.base, main_~#str1~0#1.offset + (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0#1 := 0;main_~i~0#1 := (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296);" [2025-01-10 07:32:24,352 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 >= 0;call main_#t~mem6#1 := read~int#1(main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);call write~int#2(main_#t~mem6#1, main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);havoc main_#t~mem6#1;main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := main_#t~post8#1 - 1;havoc main_#t~post8#1;" [2025-01-10 07:32:24,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:32:24,352 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2025-01-10 07:32:24,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:32:24,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650228983] [2025-01-10 07:32:24,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:32:24,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:32:24,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:32:24,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:32:24,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:32:24,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:32:24,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:32:24,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:32:24,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650228983] [2025-01-10 07:32:24,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650228983] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:32:24,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103374217] [2025-01-10 07:32:24,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:32:24,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:32:24,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:32:24,457 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:32:24,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 07:32:24,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:32:24,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:32:24,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:32:24,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:32:24,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 07:32:24,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:32:24,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:32:24,517 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:32:24,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:32:24,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103374217] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:32:24,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:32:24,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-01-10 07:32:24,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250580594] [2025-01-10 07:32:24,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:32:24,537 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:32:24,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:32:24,537 INFO L85 PathProgramCache]: Analyzing trace with hash 43, now seen corresponding path program 2 times [2025-01-10 07:32:24,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:32:24,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381556403] [2025-01-10 07:32:24,537 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:32:24,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:32:24,540 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:32:24,541 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:32:24,541 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:32:24,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:32:24,542 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:32:24,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:32:24,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:32:24,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:32:24,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:32:24,544 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:32:24,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:32:24,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 07:32:24,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-01-10 07:32:24,604 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. cyclomatic complexity: 5 Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:32:24,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:32:24,695 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2025-01-10 07:32:24,695 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2025-01-10 07:32:24,696 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-01-10 07:32:24,696 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 13 transitions. [2025-01-10 07:32:24,696 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-01-10 07:32:24,696 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-01-10 07:32:24,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2025-01-10 07:32:24,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:32:24,696 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 13 transitions. [2025-01-10 07:32:24,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2025-01-10 07:32:24,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-01-10 07:32:24,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:32:24,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2025-01-10 07:32:24,697 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 13 transitions. [2025-01-10 07:32:24,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 07:32:24,699 INFO L432 stractBuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2025-01-10 07:32:24,699 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-01-10 07:32:24,699 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2025-01-10 07:32:24,699 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-01-10 07:32:24,699 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:32:24,699 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:32:24,699 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 1, 1, 1] [2025-01-10 07:32:24,699 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-01-10 07:32:24,699 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~post12#1, main_~max~0#1, main_~#str1~0#1.base, main_~#str1~0#1.offset, main_~#str2~0#1.base, main_~#str2~0#1.offset, main_~i~0#1, main_~j~0#1;main_~max~0#1 := 5;call main_~#str1~0#1.base, main_~#str1~0#1.offset := #Ultimate.allocOnStack(main_~max~0#1 % 4294967296);call main_~#str2~0#1.base, main_~#str2~0#1.offset := #Ultimate.allocOnStack(main_~max~0#1 % 4294967296);havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0;" "assume main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet4#1;main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet4#1;main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet4#1;main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet4#1;main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int#1(0, main_~#str1~0#1.base, main_~#str1~0#1.offset + (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0#1 := 0;main_~i~0#1 := (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296);" [2025-01-10 07:32:24,700 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 >= 0;call main_#t~mem6#1 := read~int#1(main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);call write~int#2(main_#t~mem6#1, main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);havoc main_#t~mem6#1;main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := main_#t~post8#1 - 1;havoc main_#t~post8#1;" [2025-01-10 07:32:24,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:32:24,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1805794469, now seen corresponding path program 2 times [2025-01-10 07:32:24,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:32:24,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534957710] [2025-01-10 07:32:24,700 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:32:24,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:32:24,709 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 2 equivalence classes. [2025-01-10 07:32:24,723 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:32:24,724 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:32:24,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:32:25,062 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:32:25,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:32:25,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534957710] [2025-01-10 07:32:25,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534957710] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:32:25,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353622860] [2025-01-10 07:32:25,063 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:32:25,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:32:25,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:32:25,065 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:32:25,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 07:32:25,099 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 2 equivalence classes. [2025-01-10 07:32:25,118 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:32:25,118 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:32:25,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:32:25,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-10 07:32:25,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:32:25,149 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-01-10 07:32:25,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 07:32:25,155 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-01-10 07:32:25,257 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:32:25,258 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:32:25,626 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:32:25,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353622860] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:32:25,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:32:25,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2025-01-10 07:32:25,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516339730] [2025-01-10 07:32:25,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:32:25,627 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:32:25,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:32:25,627 INFO L85 PathProgramCache]: Analyzing trace with hash 43, now seen corresponding path program 3 times [2025-01-10 07:32:25,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:32:25,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764350659] [2025-01-10 07:32:25,627 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:32:25,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:32:25,630 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:32:25,632 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:32:25,632 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 07:32:25,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:32:25,632 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:32:25,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:32:25,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:32:25,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:32:25,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:32:25,637 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:32:25,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:32:25,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-10 07:32:25,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2025-01-10 07:32:25,696 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. cyclomatic complexity: 5 Second operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:32:25,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:32:25,795 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2025-01-10 07:32:25,796 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2025-01-10 07:32:25,796 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-01-10 07:32:25,796 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 14 transitions. [2025-01-10 07:32:25,796 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-01-10 07:32:25,796 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-01-10 07:32:25,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 14 transitions. [2025-01-10 07:32:25,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:32:25,797 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 14 transitions. [2025-01-10 07:32:25,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 14 transitions. [2025-01-10 07:32:25,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-01-10 07:32:25,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 11 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-01-10 07:32:25,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2025-01-10 07:32:25,798 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 14 transitions. [2025-01-10 07:32:25,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 07:32:25,799 INFO L432 stractBuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2025-01-10 07:32:25,799 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-01-10 07:32:25,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 14 transitions. [2025-01-10 07:32:25,799 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-01-10 07:32:25,799 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:32:25,799 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:32:25,799 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 1, 1, 1] [2025-01-10 07:32:25,799 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-01-10 07:32:25,800 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~post12#1, main_~max~0#1, main_~#str1~0#1.base, main_~#str1~0#1.offset, main_~#str2~0#1.base, main_~#str2~0#1.offset, main_~i~0#1, main_~j~0#1;main_~max~0#1 := 5;call main_~#str1~0#1.base, main_~#str1~0#1.offset := #Ultimate.allocOnStack(main_~max~0#1 % 4294967296);call main_~#str2~0#1.base, main_~#str2~0#1.offset := #Ultimate.allocOnStack(main_~max~0#1 % 4294967296);havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0;" "assume main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet4#1;main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet4#1;main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet4#1;main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet4#1;main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet4#1;main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int#1(0, main_~#str1~0#1.base, main_~#str1~0#1.offset + (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0#1 := 0;main_~i~0#1 := (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296);" [2025-01-10 07:32:25,800 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 >= 0;call main_#t~mem6#1 := read~int#1(main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);call write~int#2(main_#t~mem6#1, main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);havoc main_#t~mem6#1;main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := main_#t~post8#1 - 1;havoc main_#t~post8#1;" [2025-01-10 07:32:25,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:32:25,800 INFO L85 PathProgramCache]: Analyzing trace with hash 145053637, now seen corresponding path program 3 times [2025-01-10 07:32:25,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:32:25,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410866590] [2025-01-10 07:32:25,800 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:32:25,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:32:25,805 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 8 statements into 4 equivalence classes. [2025-01-10 07:32:25,824 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:32:25,825 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-10 07:32:25,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:32:25,825 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:32:25,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:32:25,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:32:25,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:32:25,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:32:25,839 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:32:25,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:32:25,839 INFO L85 PathProgramCache]: Analyzing trace with hash 43, now seen corresponding path program 4 times [2025-01-10 07:32:25,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:32:25,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637285476] [2025-01-10 07:32:25,839 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:32:25,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:32:25,842 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1 statements into 2 equivalence classes. [2025-01-10 07:32:25,843 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:32:25,844 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:32:25,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:32:25,844 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:32:25,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:32:25,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:32:25,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:32:25,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:32:25,847 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:32:25,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:32:25,847 INFO L85 PathProgramCache]: Analyzing trace with hash 201695463, now seen corresponding path program 1 times [2025-01-10 07:32:25,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:32:25,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156861053] [2025-01-10 07:32:25,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:32:25,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:32:25,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 07:32:25,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 07:32:25,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:32:25,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:32:25,861 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:32:25,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 07:32:25,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 07:32:25,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:32:25,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:32:25,878 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:32:27,178 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:32:27,178 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:32:27,178 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:32:27,178 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:32:27,178 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:32:27,178 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:32:27,178 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:32:27,178 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:32:27,178 INFO L132 ssoRankerPreferences]: Filename of dumped script: invert_string-3.c_Iteration5_Lasso [2025-01-10 07:32:27,178 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:32:27,178 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:32:27,180 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:32:27,182 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:32:27,188 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:32:27,190 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:32:27,192 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:32:27,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:32:27,434 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:32:27,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:32:27,442 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:32:27,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:32:27,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:32:27,446 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:32:27,447 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:32:27,641 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:32:27,642 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:32:27,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:32:27,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:32:27,644 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:32:27,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-01-10 07:32:27,647 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:32:27,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:32:27,658 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:32:27,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:32:27,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:32:27,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:32:27,659 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:32:27,659 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:32:27,660 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:32:27,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-01-10 07:32:27,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:32:27,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:32:27,669 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:32:27,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-01-10 07:32:27,670 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:32:27,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:32:27,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:32:27,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:32:27,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:32:27,682 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:32:27,682 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:32:27,685 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:32:27,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-01-10 07:32:27,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:32:27,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:32:27,692 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:32:27,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-01-10 07:32:27,694 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:32:27,704 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:32:27,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:32:27,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:32:27,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:32:27,706 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:32:27,706 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:32:27,708 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:32:27,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-01-10 07:32:27,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:32:27,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:32:27,715 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:32:27,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-01-10 07:32:27,717 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:32:27,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:32:27,726 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:32:27,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:32:27,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:32:27,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:32:27,727 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:32:27,727 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:32:27,728 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:32:27,733 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-01-10 07:32:27,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:32:27,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:32:27,735 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:32:27,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-01-10 07:32:27,738 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:32:27,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:32:27,748 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:32:27,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:32:27,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:32:27,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:32:27,748 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:32:27,748 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:32:27,749 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:32:27,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-01-10 07:32:27,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:32:27,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:32:27,758 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:32:27,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-01-10 07:32:27,760 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:32:27,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:32:27,770 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:32:27,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:32:27,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:32:27,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:32:27,770 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:32:27,770 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:32:27,771 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:32:27,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-01-10 07:32:27,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:32:27,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:32:27,778 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:32:27,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-01-10 07:32:27,780 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:32:27,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:32:27,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:32:27,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:32:27,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:32:27,791 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:32:27,791 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:32:27,793 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:32:27,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-01-10 07:32:27,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:32:27,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:32:27,801 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:32:27,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-01-10 07:32:27,803 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:32:27,812 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:32:27,813 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:32:27,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:32:27,813 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:32:27,813 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:32:27,813 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:32:27,813 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:32:27,817 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:32:27,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-01-10 07:32:27,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:32:27,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:32:27,829 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:32:27,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-01-10 07:32:27,830 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:32:27,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:32:27,842 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:32:27,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:32:27,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:32:27,846 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:32:27,846 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:32:27,849 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:32:27,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-01-10 07:32:27,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:32:27,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:32:27,857 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:32:27,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-01-10 07:32:27,858 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:32:27,869 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:32:27,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:32:27,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:32:27,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:32:27,871 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:32:27,871 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:32:27,874 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:32:27,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-01-10 07:32:27,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:32:27,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:32:27,882 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:32:27,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-01-10 07:32:27,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-01-10 07:32:27,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:32:27,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:32:27,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:32:27,896 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:32:27,898 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:32:27,898 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:32:27,901 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:32:27,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-01-10 07:32:27,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:32:27,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:32:27,909 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:32:27,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-01-10 07:32:27,913 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:32:27,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:32:27,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:32:27,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:32:27,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:32:27,924 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:32:27,924 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:32:27,926 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:32:27,933 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-01-10 07:32:27,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:32:27,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:32:27,935 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:32:27,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-01-10 07:32:27,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-01-10 07:32:27,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:32:27,947 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:32:27,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:32:27,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:32:27,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:32:27,948 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:32:27,948 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:32:27,949 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:32:27,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-01-10 07:32:27,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:32:27,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:32:27,956 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:32:27,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-01-10 07:32:27,957 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:32:27,967 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:32:27,967 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:32:27,967 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:32:27,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:32:27,967 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:32:27,967 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:32:27,967 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:32:27,968 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:32:27,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-01-10 07:32:27,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:32:27,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:32:27,975 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:32:27,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-01-10 07:32:27,977 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:32:27,986 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:32:27,986 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:32:27,986 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:32:27,986 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:32:27,986 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:32:27,987 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:32:27,987 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:32:27,988 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:32:27,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-01-10 07:32:27,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:32:27,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:32:27,995 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:32:27,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-01-10 07:32:27,997 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:32:28,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:32:28,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:32:28,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:32:28,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:32:28,008 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:32:28,008 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:32:28,011 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:32:28,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-01-10 07:32:28,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:32:28,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:32:28,018 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:32:28,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-01-10 07:32:28,020 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:32:28,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:32:28,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:32:28,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:32:28,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:32:28,031 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:32:28,031 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:32:28,033 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:32:28,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-01-10 07:32:28,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:32:28,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:32:28,041 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:32:28,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-01-10 07:32:28,043 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:32:28,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:32:28,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:32:28,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:32:28,053 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:32:28,057 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:32:28,057 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:32:28,060 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:32:28,066 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-01-10 07:32:28,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:32:28,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:32:28,068 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:32:28,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-01-10 07:32:28,069 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:32:28,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:32:28,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:32:28,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:32:28,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:32:28,080 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:32:28,080 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:32:28,083 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:32:28,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-01-10 07:32:28,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:32:28,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:32:28,096 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:32:28,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-01-10 07:32:28,099 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:32:28,110 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:32:28,110 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:32:28,110 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:32:28,110 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:32:28,116 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:32:28,117 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:32:28,123 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:32:28,129 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-01-10 07:32:28,129 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-01-10 07:32:28,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:32:28,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:32:28,131 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:32:28,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-01-10 07:32:28,133 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:32:28,143 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-01-10 07:32:28,144 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:32:28,144 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1, v_rep(select #length ULTIMATE.start_main_~#str2~0#1.base)_2, ULTIMATE.start_main_~#str2~0#1.offset) = -1*ULTIMATE.start_main_~j~0#1 + 1*v_rep(select #length ULTIMATE.start_main_~#str2~0#1.base)_2 - 1*ULTIMATE.start_main_~#str2~0#1.offset Supporting invariants [] [2025-01-10 07:32:28,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-01-10 07:32:28,173 INFO L156 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2025-01-10 07:32:28,175 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-01-10 07:32:28,175 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-01-10 07:32:28,175 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#str2~0!offset [2025-01-10 07:32:28,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:32:28,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:32:28,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:32:28,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:32:28,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:32:28,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:32:28,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:32:28,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:32:28,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:32:28,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:32:28,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:32:28,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:32:28,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:32:28,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:32:28,215 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-01-10 07:32:28,215 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 14 transitions. cyclomatic complexity: 5 Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:32:28,220 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 14 transitions. cyclomatic complexity: 5. Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 14 states and 17 transitions. Complement of second has 3 states. [2025-01-10 07:32:28,220 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-01-10 07:32:28,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:32:28,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 5 transitions. [2025-01-10 07:32:28,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 5 transitions. Stem has 8 letters. Loop has 1 letters. [2025-01-10 07:32:28,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:32:28,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 5 transitions. Stem has 9 letters. Loop has 1 letters. [2025-01-10 07:32:28,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:32:28,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 5 transitions. Stem has 8 letters. Loop has 2 letters. [2025-01-10 07:32:28,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:32:28,222 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2025-01-10 07:32:28,222 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:32:28,222 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 17 transitions. [2025-01-10 07:32:28,222 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-01-10 07:32:28,222 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-01-10 07:32:28,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2025-01-10 07:32:28,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:32:28,222 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 17 transitions. [2025-01-10 07:32:28,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2025-01-10 07:32:28,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2025-01-10 07:32:28,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:32:28,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2025-01-10 07:32:28,223 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 16 transitions. [2025-01-10 07:32:28,223 INFO L432 stractBuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2025-01-10 07:32:28,223 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-01-10 07:32:28,223 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2025-01-10 07:32:28,224 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:32:28,224 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:32:28,224 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:32:28,224 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 1, 1, 1, 1] [2025-01-10 07:32:28,224 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:32:28,224 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~post12#1, main_~max~0#1, main_~#str1~0#1.base, main_~#str1~0#1.offset, main_~#str2~0#1.base, main_~#str2~0#1.offset, main_~i~0#1, main_~j~0#1;main_~max~0#1 := 5;call main_~#str1~0#1.base, main_~#str1~0#1.offset := #Ultimate.allocOnStack(main_~max~0#1 % 4294967296);call main_~#str2~0#1.base, main_~#str2~0#1.offset := #Ultimate.allocOnStack(main_~max~0#1 % 4294967296);havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0;" "assume main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet4#1;main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet4#1;main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet4#1;main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet4#1;main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet4#1;main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int#1(0, main_~#str1~0#1.base, main_~#str1~0#1.offset + (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0#1 := 0;main_~i~0#1 := (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296);" "assume !(main_~i~0#1 >= 0);main_~j~0#1 := (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296);main_~i~0#1 := 0;" [2025-01-10 07:32:28,224 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296;call main_#t~mem9#1 := read~int#1(main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);call main_#t~mem10#1 := read~int#2(main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem9#1 == main_#t~mem10#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem9#1;havoc main_#t~mem10#1;main_#t~post11#1 := main_~j~0#1;main_~j~0#1 := main_#t~post11#1 - 1;havoc main_#t~post11#1;main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1;" [2025-01-10 07:32:28,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:32:28,224 INFO L85 PathProgramCache]: Analyzing trace with hash 201695465, now seen corresponding path program 1 times [2025-01-10 07:32:28,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:32:28,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978863086] [2025-01-10 07:32:28,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:32:28,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:32:28,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 07:32:28,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 07:32:28,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:32:28,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:32:28,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-01-10 07:32:28,289 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 07:32:28,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:32:28,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978863086] [2025-01-10 07:32:28,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978863086] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:32:28,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:32:28,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 07:32:28,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541847067] [2025-01-10 07:32:28,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:32:28,290 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:32:28,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:32:28,291 INFO L85 PathProgramCache]: Analyzing trace with hash 47956, now seen corresponding path program 1 times [2025-01-10 07:32:28,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:32:28,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199123472] [2025-01-10 07:32:28,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:32:28,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:32:28,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:32:28,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:32:28,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:32:28,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:32:28,296 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:32:28,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:32:28,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:32:28,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:32:28,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:32:28,301 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:32:28,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:32:28,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 07:32:28,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 07:32:28,365 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. cyclomatic complexity: 6 Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:32:28,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:32:28,377 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2025-01-10 07:32:28,377 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2025-01-10 07:32:28,378 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:32:28,378 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 15 transitions. [2025-01-10 07:32:28,378 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-01-10 07:32:28,378 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-01-10 07:32:28,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 15 transitions. [2025-01-10 07:32:28,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:32:28,378 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 15 transitions. [2025-01-10 07:32:28,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 15 transitions. [2025-01-10 07:32:28,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-01-10 07:32:28,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 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-01-10 07:32:28,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2025-01-10 07:32:28,382 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 15 transitions. [2025-01-10 07:32:28,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 07:32:28,383 INFO L432 stractBuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2025-01-10 07:32:28,383 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-01-10 07:32:28,383 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2025-01-10 07:32:28,384 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:32:28,384 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:32:28,384 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:32:28,384 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 1, 1, 1, 1, 1] [2025-01-10 07:32:28,384 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:32:28,384 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~post12#1, main_~max~0#1, main_~#str1~0#1.base, main_~#str1~0#1.offset, main_~#str2~0#1.base, main_~#str2~0#1.offset, main_~i~0#1, main_~j~0#1;main_~max~0#1 := 5;call main_~#str1~0#1.base, main_~#str1~0#1.offset := #Ultimate.allocOnStack(main_~max~0#1 % 4294967296);call main_~#str2~0#1.base, main_~#str2~0#1.offset := #Ultimate.allocOnStack(main_~max~0#1 % 4294967296);havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0;" "assume main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet4#1;main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet4#1;main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet4#1;main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet4#1;main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet4#1;main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int#1(0, main_~#str1~0#1.base, main_~#str1~0#1.offset + (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0#1 := 0;main_~i~0#1 := (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296);" "assume main_~i~0#1 >= 0;call main_#t~mem6#1 := read~int#1(main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);call write~int#2(main_#t~mem6#1, main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);havoc main_#t~mem6#1;main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := main_#t~post8#1 - 1;havoc main_#t~post8#1;" "assume !(main_~i~0#1 >= 0);main_~j~0#1 := (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296);main_~i~0#1 := 0;" [2025-01-10 07:32:28,384 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296;call main_#t~mem9#1 := read~int#1(main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);call main_#t~mem10#1 := read~int#2(main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem9#1 == main_#t~mem10#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem9#1;havoc main_#t~mem10#1;main_#t~post11#1 := main_~j~0#1;main_~j~0#1 := main_#t~post11#1 - 1;havoc main_#t~post11#1;main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1;" [2025-01-10 07:32:28,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:32:28,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1957592071, now seen corresponding path program 1 times [2025-01-10 07:32:28,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:32:28,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313309409] [2025-01-10 07:32:28,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:32:28,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:32:28,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 07:32:28,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 07:32:28,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:32:28,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:32:28,507 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 07:32:28,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:32:28,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313309409] [2025-01-10 07:32:28,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313309409] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:32:28,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190136274] [2025-01-10 07:32:28,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:32:28,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:32:28,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:32:28,510 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:32:28,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-01-10 07:32:28,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 07:32:28,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 07:32:28,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:32:28,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:32:28,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 07:32:28,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:32:28,586 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 07:32:28,587 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:32:28,617 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 07:32:28,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190136274] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:32:28,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:32:28,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-01-10 07:32:28,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450594182] [2025-01-10 07:32:28,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:32:28,618 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:32:28,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:32:28,618 INFO L85 PathProgramCache]: Analyzing trace with hash 47956, now seen corresponding path program 2 times [2025-01-10 07:32:28,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:32:28,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31439909] [2025-01-10 07:32:28,618 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:32:28,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:32:28,624 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:32:28,627 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:32:28,627 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:32:28,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:32:28,627 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:32:28,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:32:28,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:32:28,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:32:28,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:32:28,632 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:32:28,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:32:28,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 07:32:28,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-10 07:32:28,697 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. cyclomatic complexity: 5 Second operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:32:28,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:32:28,768 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2025-01-10 07:32:28,768 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2025-01-10 07:32:28,768 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:32:28,768 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 21 transitions. [2025-01-10 07:32:28,768 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-01-10 07:32:28,768 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-01-10 07:32:28,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 21 transitions. [2025-01-10 07:32:28,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:32:28,769 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 21 transitions. [2025-01-10 07:32:28,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 21 transitions. [2025-01-10 07:32:28,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2025-01-10 07:32:28,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.125) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:32:28,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2025-01-10 07:32:28,770 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 18 transitions. [2025-01-10 07:32:28,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 07:32:28,771 INFO L432 stractBuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2025-01-10 07:32:28,771 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-01-10 07:32:28,771 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 18 transitions. [2025-01-10 07:32:28,772 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:32:28,772 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:32:28,772 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:32:28,772 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 1, 1, 1, 1] [2025-01-10 07:32:28,772 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:32:28,772 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~post12#1, main_~max~0#1, main_~#str1~0#1.base, main_~#str1~0#1.offset, main_~#str2~0#1.base, main_~#str2~0#1.offset, main_~i~0#1, main_~j~0#1;main_~max~0#1 := 5;call main_~#str1~0#1.base, main_~#str1~0#1.offset := #Ultimate.allocOnStack(main_~max~0#1 % 4294967296);call main_~#str2~0#1.base, main_~#str2~0#1.offset := #Ultimate.allocOnStack(main_~max~0#1 % 4294967296);havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0;" "assume main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet4#1;main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet4#1;main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet4#1;main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet4#1;main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet4#1;main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int#1(0, main_~#str1~0#1.base, main_~#str1~0#1.offset + (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0#1 := 0;main_~i~0#1 := (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296);" "assume main_~i~0#1 >= 0;call main_#t~mem6#1 := read~int#1(main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);call write~int#2(main_#t~mem6#1, main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);havoc main_#t~mem6#1;main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := main_#t~post8#1 - 1;havoc main_#t~post8#1;" "assume main_~i~0#1 >= 0;call main_#t~mem6#1 := read~int#1(main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);call write~int#2(main_#t~mem6#1, main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);havoc main_#t~mem6#1;main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := main_#t~post8#1 - 1;havoc main_#t~post8#1;" "assume main_~i~0#1 >= 0;call main_#t~mem6#1 := read~int#1(main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);call write~int#2(main_#t~mem6#1, main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);havoc main_#t~mem6#1;main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := main_#t~post8#1 - 1;havoc main_#t~post8#1;" "assume main_~i~0#1 >= 0;call main_#t~mem6#1 := read~int#1(main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);call write~int#2(main_#t~mem6#1, main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);havoc main_#t~mem6#1;main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := main_#t~post8#1 - 1;havoc main_#t~post8#1;" "assume !(main_~i~0#1 >= 0);main_~j~0#1 := (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296);main_~i~0#1 := 0;" [2025-01-10 07:32:28,772 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296;call main_#t~mem9#1 := read~int#1(main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);call main_#t~mem10#1 := read~int#2(main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem9#1 == main_#t~mem10#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem9#1;havoc main_#t~mem10#1;main_#t~post11#1 := main_~j~0#1;main_~j~0#1 := main_#t~post11#1 - 1;havoc main_#t~post11#1;main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1;" [2025-01-10 07:32:28,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:32:28,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1559394409, now seen corresponding path program 2 times [2025-01-10 07:32:28,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:32:28,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250174563] [2025-01-10 07:32:28,773 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:32:28,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:32:28,785 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-01-10 07:32:28,792 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 07:32:28,792 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:32:28,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:32:28,996 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 07:32:28,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:32:28,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250174563] [2025-01-10 07:32:28,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250174563] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:32:28,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182336201] [2025-01-10 07:32:28,996 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:32:28,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:32:28,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:32:28,998 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:32:29,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-01-10 07:32:29,039 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-01-10 07:32:29,060 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 07:32:29,060 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:32:29,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:32:29,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-10 07:32:29,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:32:29,150 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 07:32:29,150 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:32:29,236 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 07:32:29,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182336201] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:32:29,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:32:29,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 19 [2025-01-10 07:32:29,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676499638] [2025-01-10 07:32:29,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:32:29,237 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:32:29,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:32:29,238 INFO L85 PathProgramCache]: Analyzing trace with hash 47956, now seen corresponding path program 3 times [2025-01-10 07:32:29,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:32:29,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618461543] [2025-01-10 07:32:29,238 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:32:29,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:32:29,240 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:32:29,246 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:32:29,246 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 07:32:29,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:32:29,246 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:32:29,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:32:29,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:32:29,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:32:29,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:32:29,251 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:32:29,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:32:29,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-10 07:32:29,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2025-01-10 07:32:29,318 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. cyclomatic complexity: 5 Second operand has 20 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 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-01-10 07:32:29,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:32:29,574 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2025-01-10 07:32:29,574 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 40 transitions. [2025-01-10 07:32:29,575 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:32:29,575 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 40 transitions. [2025-01-10 07:32:29,575 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2025-01-10 07:32:29,576 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2025-01-10 07:32:29,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 40 transitions. [2025-01-10 07:32:29,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:32:29,576 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 40 transitions. [2025-01-10 07:32:29,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 40 transitions. [2025-01-10 07:32:29,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 22. [2025-01-10 07:32:29,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 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-01-10 07:32:29,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2025-01-10 07:32:29,577 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 25 transitions. [2025-01-10 07:32:29,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 07:32:29,578 INFO L432 stractBuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2025-01-10 07:32:29,578 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-01-10 07:32:29,578 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 25 transitions. [2025-01-10 07:32:29,578 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:32:29,578 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:32:29,578 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:32:29,578 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2025-01-10 07:32:29,579 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:32:29,579 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~post12#1, main_~max~0#1, main_~#str1~0#1.base, main_~#str1~0#1.offset, main_~#str2~0#1.base, main_~#str2~0#1.offset, main_~i~0#1, main_~j~0#1;main_~max~0#1 := 5;call main_~#str1~0#1.base, main_~#str1~0#1.offset := #Ultimate.allocOnStack(main_~max~0#1 % 4294967296);call main_~#str2~0#1.base, main_~#str2~0#1.offset := #Ultimate.allocOnStack(main_~max~0#1 % 4294967296);havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0;" "assume main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet4#1;main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet4#1;main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet4#1;main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet4#1;main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet4#1;main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int#1(0, main_~#str1~0#1.base, main_~#str1~0#1.offset + (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0#1 := 0;main_~i~0#1 := (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296);" "assume main_~i~0#1 >= 0;call main_#t~mem6#1 := read~int#1(main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);call write~int#2(main_#t~mem6#1, main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);havoc main_#t~mem6#1;main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := main_#t~post8#1 - 1;havoc main_#t~post8#1;" "assume main_~i~0#1 >= 0;call main_#t~mem6#1 := read~int#1(main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);call write~int#2(main_#t~mem6#1, main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);havoc main_#t~mem6#1;main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := main_#t~post8#1 - 1;havoc main_#t~post8#1;" "assume main_~i~0#1 >= 0;call main_#t~mem6#1 := read~int#1(main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);call write~int#2(main_#t~mem6#1, main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);havoc main_#t~mem6#1;main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := main_#t~post8#1 - 1;havoc main_#t~post8#1;" "assume main_~i~0#1 >= 0;call main_#t~mem6#1 := read~int#1(main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);call write~int#2(main_#t~mem6#1, main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);havoc main_#t~mem6#1;main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := main_#t~post8#1 - 1;havoc main_#t~post8#1;" "assume main_~i~0#1 >= 0;call main_#t~mem6#1 := read~int#1(main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);call write~int#2(main_#t~mem6#1, main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);havoc main_#t~mem6#1;main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := main_#t~post8#1 - 1;havoc main_#t~post8#1;" "assume !(main_~i~0#1 >= 0);main_~j~0#1 := (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296);main_~i~0#1 := 0;" [2025-01-10 07:32:29,579 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296;call main_#t~mem9#1 := read~int#1(main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);call main_#t~mem10#1 := read~int#2(main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem9#1 == main_#t~mem10#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem9#1;havoc main_#t~mem10#1;main_#t~post11#1 := main_~j~0#1;main_~j~0#1 := main_#t~post11#1 - 1;havoc main_#t~post11#1;main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1;" [2025-01-10 07:32:29,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:32:29,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1096586375, now seen corresponding path program 3 times [2025-01-10 07:32:29,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:32:29,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70984272] [2025-01-10 07:32:29,579 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:32:29,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:32:29,585 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 4 equivalence classes. [2025-01-10 07:32:29,618 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 07:32:29,619 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-10 07:32:29,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:32:29,620 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:32:29,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 07:32:29,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 07:32:29,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:32:29,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:32:29,656 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:32:29,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:32:29,656 INFO L85 PathProgramCache]: Analyzing trace with hash 47956, now seen corresponding path program 4 times [2025-01-10 07:32:29,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:32:29,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323181964] [2025-01-10 07:32:29,657 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:32:29,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:32:29,661 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-01-10 07:32:29,662 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:32:29,662 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:32:29,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:32:29,662 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:32:29,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:32:29,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:32:29,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:32:29,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:32:29,666 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:32:29,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:32:29,666 INFO L85 PathProgramCache]: Analyzing trace with hash 883462414, now seen corresponding path program 1 times [2025-01-10 07:32:29,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:32:29,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595590794] [2025-01-10 07:32:29,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:32:29,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:32:29,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 07:32:29,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 07:32:29,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:32:29,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:32:29,703 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:32:29,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 07:32:29,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 07:32:29,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:32:29,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:32:29,729 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:32:37,303 WARN L286 SmtUtils]: Spent 7.51s on a formula simplification. DAG size of input: 280 DAG size of output: 212 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-01-10 07:32:38,191 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:32:38,191 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:32:38,191 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:32:38,191 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:32:38,191 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:32:38,191 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:32:38,191 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:32:38,191 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:32:38,191 INFO L132 ssoRankerPreferences]: Filename of dumped script: invert_string-3.c_Iteration9_Lasso [2025-01-10 07:32:38,191 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:32:38,191 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:32:38,192 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:32:38,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:32:38,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:32:38,201 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:32:38,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:32:38,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:32:38,213 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:32:38,692 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:32:38,693 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:32:38,695 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:32:38,696 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:32:38,697 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:32:38,699 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:32:38,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:32:38,949 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:32:38,949 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:32:38,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:32:38,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:32:38,951 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:32:38,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-01-10 07:32:38,954 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:32:38,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:32:38,964 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:32:38,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:32:38,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:32:38,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:32:38,964 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:32:38,964 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:32:38,965 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:32:38,971 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-01-10 07:32:38,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:32:38,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:32:38,973 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:32:38,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-01-10 07:32:38,975 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:32:38,984 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:32:38,985 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:32:38,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:32:38,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:32:38,985 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:32:38,989 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:32:38,989 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:32:38,990 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:32:38,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-01-10 07:32:38,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:32:38,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:32:38,999 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:32:38,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-01-10 07:32:39,001 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:32:39,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:32:39,011 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:32:39,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:32:39,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:32:39,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:32:39,011 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:32:39,011 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:32:39,012 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:32:39,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-01-10 07:32:39,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:32:39,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:32:39,021 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-01-10 07:32:39,022 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-01-10 07:32:39,023 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:32:39,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:32:39,032 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:32:39,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:32:39,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:32:39,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:32:39,033 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:32:39,034 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:32:39,035 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:32:39,040 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-01-10 07:32:39,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:32:39,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:32:39,042 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-01-10 07:32:39,043 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-01-10 07:32:39,044 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:32:39,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:32:39,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:32:39,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:32:39,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:32:39,055 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:32:39,055 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:32:39,057 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:32:39,063 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-01-10 07:32:39,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:32:39,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:32:39,065 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-01-10 07:32:39,066 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-01-10 07:32:39,067 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:32:39,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:32:39,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:32:39,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:32:39,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:32:39,078 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:32:39,078 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:32:39,080 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:32:39,086 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-01-10 07:32:39,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:32:39,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:32:39,088 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-01-10 07:32:39,089 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-01-10 07:32:39,090 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:32:39,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:32:39,101 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:32:39,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:32:39,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:32:39,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:32:39,102 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:32:39,102 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:32:39,104 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:32:39,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2025-01-10 07:32:39,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:32:39,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:32:39,113 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-01-10 07:32:39,114 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-01-10 07:32:39,114 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:32:39,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:32:39,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:32:39,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:32:39,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:32:39,125 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:32:39,125 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:32:39,128 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:32:39,133 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-01-10 07:32:39,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:32:39,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:32:39,136 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-01-10 07:32:39,137 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-01-10 07:32:39,137 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:32:39,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:32:39,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:32:39,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:32:39,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:32:39,149 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:32:39,149 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:32:39,151 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:32:39,157 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-01-10 07:32:39,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:32:39,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:32:39,159 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-01-10 07:32:39,160 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-01-10 07:32:39,161 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:32:39,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:32:39,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:32:39,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:32:39,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:32:39,172 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:32:39,172 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:32:39,174 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:32:39,180 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-01-10 07:32:39,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:32:39,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:32:39,182 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-01-10 07:32:39,182 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-01-10 07:32:39,185 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:32:39,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:32:39,195 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:32:39,195 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:32:39,195 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:32:39,196 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:32:39,196 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:32:39,198 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:32:39,204 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-01-10 07:32:39,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:32:39,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:32:39,206 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-01-10 07:32:39,207 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-01-10 07:32:39,208 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:32:39,218 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:32:39,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:32:39,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:32:39,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:32:39,221 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:32:39,221 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:32:39,229 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:32:39,236 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-01-10 07:32:39,236 INFO L444 ModelExtractionUtils]: 9 out of 16 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-01-10 07:32:39,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:32:39,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:32:39,239 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:32:39,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-01-10 07:32:39,240 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:32:39,251 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-01-10 07:32:39,251 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:32:39,251 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~#str1~0#1.offset, v_rep(select #length ULTIMATE.start_main_~#str1~0#1.base)_3, ULTIMATE.start_main_~i~0#1) = -1*ULTIMATE.start_main_~#str1~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_~#str1~0#1.base)_3 - 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2025-01-10 07:32:39,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-01-10 07:32:39,281 INFO L156 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2025-01-10 07:32:39,282 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#str1~0!offset [2025-01-10 07:32:39,283 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-01-10 07:32:39,283 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-01-10 07:32:39,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:32:39,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 07:32:39,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 07:32:39,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:32:39,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:32:39,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:32:39,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:32:39,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:32:39,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:32:39,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:32:39,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:32:39,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:32:39,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:32:39,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:32:39,359 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-01-10 07:32:39,359 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:32:39,374 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 25 states and 29 transitions. Complement of second has 4 states. [2025-01-10 07:32:39,375 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-01-10 07:32:39,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:32:39,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2025-01-10 07:32:39,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 14 letters. Loop has 3 letters. [2025-01-10 07:32:39,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:32:39,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 17 letters. Loop has 3 letters. [2025-01-10 07:32:39,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:32:39,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 14 letters. Loop has 6 letters. [2025-01-10 07:32:39,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:32:39,376 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 29 transitions. [2025-01-10 07:32:39,376 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-01-10 07:32:39,376 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 0 states and 0 transitions. [2025-01-10 07:32:39,376 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-01-10 07:32:39,376 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-01-10 07:32:39,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-01-10 07:32:39,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:32:39,376 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 07:32:39,376 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 07:32:39,376 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 07:32:39,376 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-01-10 07:32:39,376 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-01-10 07:32:39,376 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-01-10 07:32:39,376 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-01-10 07:32:39,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.01 07:32:39 BoogieIcfgContainer [2025-01-10 07:32:39,382 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-01-10 07:32:39,382 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 07:32:39,382 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 07:32:39,382 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 07:32:39,383 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:32:22" (3/4) ... [2025-01-10 07:32:39,384 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 07:32:39,385 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 07:32:39,385 INFO L158 Benchmark]: Toolchain (without parser) took 17572.31ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 129.7MB in the beginning and 118.1MB in the end (delta: 11.6MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2025-01-10 07:32:39,385 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 192.9MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:32:39,386 INFO L158 Benchmark]: CACSL2BoogieTranslator took 167.70ms. Allocated memory is still 167.8MB. Free memory was 129.4MB in the beginning and 118.8MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 07:32:39,386 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.83ms. Allocated memory is still 167.8MB. Free memory was 118.8MB in the beginning and 117.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:32:39,386 INFO L158 Benchmark]: Boogie Preprocessor took 31.43ms. Allocated memory is still 167.8MB. Free memory was 117.4MB in the beginning and 115.8MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 07:32:39,386 INFO L158 Benchmark]: RCFGBuilder took 236.15ms. Allocated memory is still 167.8MB. Free memory was 115.8MB in the beginning and 104.4MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 07:32:39,386 INFO L158 Benchmark]: BuchiAutomizer took 17104.12ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 104.1MB in the beginning and 118.1MB in the end (delta: -14.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2025-01-10 07:32:39,391 INFO L158 Benchmark]: Witness Printer took 2.51ms. Allocated memory is still 201.3MB. Free memory was 118.1MB in the beginning and 118.1MB in the end (delta: 39.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:32:39,392 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 192.9MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 167.70ms. Allocated memory is still 167.8MB. Free memory was 129.4MB in the beginning and 118.8MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.83ms. Allocated memory is still 167.8MB. Free memory was 118.8MB in the beginning and 117.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.43ms. Allocated memory is still 167.8MB. Free memory was 117.4MB in the beginning and 115.8MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 236.15ms. Allocated memory is still 167.8MB. Free memory was 115.8MB in the beginning and 104.4MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 17104.12ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 104.1MB in the beginning and 118.1MB in the end (delta: -14.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Witness Printer took 2.51ms. Allocated memory is still 201.3MB. Free memory was 118.1MB in the beginning and 118.1MB in the end (delta: 39.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#str1~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#str2~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#str1~0!offset - 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.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (6 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 2 locations. One deterministic module has affine ranking function null and consists of 2 locations. One deterministic module has affine ranking function null and consists of 3 locations. 6 modules have a trivial ranking function, the largest among these consists of 20 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 17.0s and 10 iterations. TraceHistogramMax:5. Analysis of lassos took 16.1s. Construction of modules took 0.3s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 9. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 20 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 139 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 136 mSDsluCounter, 108 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 56 mSDsCounter, 138 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 290 IncrementalHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 138 mSolverCounterUnsat, 52 mSDtfsCounter, 290 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU6 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital230 mio100 ax100 hnf100 lsp92 ukn64 mio100 lsp28 div226 bol100 ite100 ukn100 eq151 hnf93 smp69 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms VariablesStem: 2 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-01-10 07:32:39,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2025-01-10 07:32:39,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2025-01-10 07:32:39,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2025-01-10 07:32:40,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-10 07:32:40,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-10 07:32:40,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE