./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7e6a17b7d4143542ba439290f9741c160a8cb32cc90a0cc2a238a67702990ba0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:59:23,697 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:59:23,740 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-01-10 06:59:23,743 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:59:23,743 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:59:23,758 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:59:23,759 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:59:23,759 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:59:23,759 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:59:23,759 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:59:23,760 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:59:23,760 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:59:23,760 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:59:23,760 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-01-10 06:59:23,760 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-01-10 06:59:23,760 INFO L153 SettingsManager]: * Use old map elimination=false [2025-01-10 06:59:23,760 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-01-10 06:59:23,760 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-01-10 06:59:23,760 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-01-10 06:59:23,761 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:59:23,761 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-01-10 06:59:23,761 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:59:23,761 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:59:23,761 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-01-10 06:59:23,761 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-01-10 06:59:23,761 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-01-10 06:59:23,761 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:59:23,761 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:59:23,761 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-01-10 06:59:23,761 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:59:23,761 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:59:23,761 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:59:23,761 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:59:23,761 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:59:23,761 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:59:23,762 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-01-10 06:59:23,762 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7e6a17b7d4143542ba439290f9741c160a8cb32cc90a0cc2a238a67702990ba0 [2025-01-10 06:59:24,003 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:59:24,013 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:59:24,014 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:59:24,016 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:59:24,016 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:59:24,017 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2025-01-10 06:59:25,208 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b82082537/b03544b68dfe4e27b00dc5861874e094/FLAGe0d139fa4 [2025-01-10 06:59:25,469 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:59:25,484 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2025-01-10 06:59:25,503 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b82082537/b03544b68dfe4e27b00dc5861874e094/FLAGe0d139fa4 [2025-01-10 06:59:25,796 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b82082537/b03544b68dfe4e27b00dc5861874e094 [2025-01-10 06:59:25,798 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:59:25,800 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:59:25,804 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:59:25,804 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:59:25,808 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:59:25,808 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:59:25" (1/1) ... [2025-01-10 06:59:25,810 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@147af7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:25, skipping insertion in model container [2025-01-10 06:59:25,810 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:59:25" (1/1) ... [2025-01-10 06:59:25,819 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:59:25,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:59:25,939 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:59:25,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:59:25,959 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:59:25,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:25 WrapperNode [2025-01-10 06:59:25,961 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:59:25,962 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:59:25,962 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:59:25,962 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:59:25,966 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:25" (1/1) ... [2025-01-10 06:59:25,972 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:25" (1/1) ... [2025-01-10 06:59:25,984 INFO L138 Inliner]: procedures = 7, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 59 [2025-01-10 06:59:25,985 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:59:25,986 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:59:25,986 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:59:25,986 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:59:25,992 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:25" (1/1) ... [2025-01-10 06:59:25,992 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:25" (1/1) ... [2025-01-10 06:59:25,997 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:25" (1/1) ... [2025-01-10 06:59:26,012 INFO L175 MemorySlicer]: Split 15 memory accesses to 4 slices as follows [4, 4, 4, 3]. 27 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0, 0]. The 11 writes are split as follows [3, 3, 3, 2]. [2025-01-10 06:59:26,013 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:25" (1/1) ... [2025-01-10 06:59:26,014 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:25" (1/1) ... [2025-01-10 06:59:26,016 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:25" (1/1) ... [2025-01-10 06:59:26,017 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:25" (1/1) ... [2025-01-10 06:59:26,021 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:25" (1/1) ... [2025-01-10 06:59:26,021 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:25" (1/1) ... [2025-01-10 06:59:26,022 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:25" (1/1) ... [2025-01-10 06:59:26,027 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:59:26,027 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:59:26,027 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:59:26,027 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:59:26,028 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:25" (1/1) ... [2025-01-10 06:59:26,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:26,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:26,060 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 06:59:26,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 06:59:26,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:59:26,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:59:26,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 06:59:26,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 06:59:26,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:59:26,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:59:26,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:59:26,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:59:26,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 06:59:26,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 06:59:26,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 06:59:26,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 06:59:26,154 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:59:26,155 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:59:26,255 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-01-10 06:59:26,255 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:59:26,261 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:59:26,261 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-10 06:59:26,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:59:26 BoogieIcfgContainer [2025-01-10 06:59:26,261 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:59:26,262 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-01-10 06:59:26,262 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-01-10 06:59:26,266 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-01-10 06:59:26,266 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 06:59:26,266 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.01 06:59:25" (1/3) ... [2025-01-10 06:59:26,267 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@387e93c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 06:59:26, skipping insertion in model container [2025-01-10 06:59:26,267 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 06:59:26,267 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:25" (2/3) ... [2025-01-10 06:59:26,267 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@387e93c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 06:59:26, skipping insertion in model container [2025-01-10 06:59:26,267 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 06:59:26,267 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:59:26" (3/3) ... [2025-01-10 06:59:26,268 INFO L363 chiAutomizerObserver]: Analyzing ICFG 4BitCounterPointer.c [2025-01-10 06:59:26,304 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-01-10 06:59:26,306 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-01-10 06:59:26,306 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-01-10 06:59:26,306 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-01-10 06:59:26,307 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-01-10 06:59:26,307 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-01-10 06:59:26,307 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-01-10 06:59:26,307 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-01-10 06:59:26,312 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 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 06:59:26,324 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-01-10 06:59:26,324 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 06:59:26,324 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 06:59:26,328 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 06:59:26,328 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-01-10 06:59:26,328 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-01-10 06:59:26,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 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 06:59:26,329 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-01-10 06:59:26,329 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 06:59:26,329 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 06:59:26,329 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 06:59:26,330 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-01-10 06:59:26,335 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#2(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" [2025-01-10 06:59:26,335 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;" "call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" [2025-01-10 06:59:26,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:26,341 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2025-01-10 06:59:26,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:26,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872613925] [2025-01-10 06:59:26,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:59:26,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:26,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 06:59:26,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 06:59:26,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:26,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:26,482 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:26,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 06:59:26,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 06:59:26,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:26,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:26,543 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:26,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:26,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1111335, now seen corresponding path program 1 times [2025-01-10 06:59:26,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:26,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441766614] [2025-01-10 06:59:26,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:59:26,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:26,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:59:26,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:59:26,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:26,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:26,562 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:26,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:59:26,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:59:26,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:26,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:26,574 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:26,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:26,575 INFO L85 PathProgramCache]: Analyzing trace with hash 889538537, now seen corresponding path program 1 times [2025-01-10 06:59:26,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:26,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324402073] [2025-01-10 06:59:26,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:59:26,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:26,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:59:26,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:59:26,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:26,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:26,634 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:26,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:59:26,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:59:26,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:26,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:26,665 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:27,829 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 06:59:27,830 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 06:59:27,830 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 06:59:27,830 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 06:59:27,830 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 06:59:27,830 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:27,830 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 06:59:27,830 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 06:59:27,831 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration1_Lasso [2025-01-10 06:59:27,831 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 06:59:27,831 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 06:59:27,840 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:28,267 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:28,269 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:28,270 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:28,273 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:28,275 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:28,582 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 06:59:28,585 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 06:59:28,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:28,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:28,590 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 06:59:28,591 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 06:59:28,596 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 06:59:28,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:28,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:28,608 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:28,608 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:28,617 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:28,617 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 06:59:28,623 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:28,632 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 06:59:28,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:28,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:28,636 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 06:59:28,637 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 06:59:28,638 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 06:59:28,648 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:28,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:28,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:28,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:28,653 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:28,653 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 06:59:28,657 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:28,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-01-10 06:59:28,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:28,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:28,670 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 06:59:28,671 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 06:59:28,671 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 06:59:28,682 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:28,682 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:28,682 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:28,682 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:28,687 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:28,687 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 06:59:28,691 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:28,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-01-10 06:59:28,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:28,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:28,706 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 06:59:28,707 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 06:59:28,708 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 06:59:28,719 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:28,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:28,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:28,719 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:28,722 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:28,722 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 06:59:28,728 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:28,737 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 06:59:28,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:28,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:28,743 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 06:59:28,743 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 06:59:28,744 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 06:59:28,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:28,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:28,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:28,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:28,756 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:28,756 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 06:59:28,760 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:28,766 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 06:59:28,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:28,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:28,768 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 06:59:28,769 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 06:59:28,770 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 06:59:28,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:28,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:28,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:28,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:28,783 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:28,783 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 06:59:28,785 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:28,793 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 06:59:28,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:28,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:28,795 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 06:59:28,798 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 06:59:28,799 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 06:59:28,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:28,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:28,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:28,809 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:28,811 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:28,811 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 06:59:28,814 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:28,821 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 06:59:28,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:28,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:28,827 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:28,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-01-10 06:59:28,829 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 06:59:28,839 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:28,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:28,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:28,839 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:28,840 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:28,840 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 06:59:28,843 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:28,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:28,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:28,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:28,859 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:28,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-01-10 06:59:28,861 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 06:59:28,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:28,872 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:28,872 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:28,872 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:28,878 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:28,878 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 06:59:28,886 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:28,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-01-10 06:59:28,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:28,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:28,899 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 06:59:28,899 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 06:59:28,900 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 06:59:28,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:28,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:28,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:28,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:28,914 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:28,914 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 06:59:28,918 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:28,927 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 06:59:28,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:28,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:28,931 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 06:59:28,932 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 06:59:28,933 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 06:59:28,943 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:28,943 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:28,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:28,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:28,946 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:28,946 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 06:59:28,949 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:28,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-01-10 06:59:28,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:28,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:28,958 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 06:59:28,960 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 06:59:28,960 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 06:59:28,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:28,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:28,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:28,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:28,978 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:28,978 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 06:59:28,981 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:28,990 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 06:59:28,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:28,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:28,996 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 06:59:29,001 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 06:59:29,002 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 06:59:29,012 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:29,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:29,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:29,012 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:29,015 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:29,015 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 06:59:29,019 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:29,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:29,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:29,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:29,033 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 06:59:29,040 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 06:59:29,041 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 06:59:29,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:29,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:29,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:29,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:29,053 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:29,054 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 06:59:29,056 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:29,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-01-10 06:59:29,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:29,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:29,067 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 06:59:29,068 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 06:59:29,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 06:59:29,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:29,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:29,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:29,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:29,082 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:29,082 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 06:59:29,085 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 06:59:29,095 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-01-10 06:59:29,096 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2025-01-10 06:59:29,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:29,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:29,102 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 06:59:29,109 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 06:59:29,109 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 06:59:29,124 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-01-10 06:59:29,125 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 06:59:29,125 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~x0~0#1.base) ULTIMATE.start_main_~x0~0#1.offset)_1) = -2*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~x0~0#1.base) ULTIMATE.start_main_~x0~0#1.offset)_1 + 1 Supporting invariants [] [2025-01-10 06:59:29,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:29,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:29,231 INFO L156 tatePredicateManager]: 34 out of 34 supporting invariants were superfluous and have been removed [2025-01-10 06:59:29,237 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-01-10 06:59:29,237 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-01-10 06:59:29,237 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x0~0!base,]]] [2025-01-10 06:59:29,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:29,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 06:59:29,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 06:59:29,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:29,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:29,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:59:29,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:29,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:59:29,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:59:29,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:29,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:29,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:59:29,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:29,303 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 06:59:29,320 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 06:59:29,322 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 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) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:29,354 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 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). Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 28 states and 36 transitions. Complement of second has 8 states. [2025-01-10 06:59:29,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-01-10 06:59:29,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:29,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2025-01-10 06:59:29,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 2 letters. Loop has 4 letters. [2025-01-10 06:59:29,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:29,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 6 letters. Loop has 4 letters. [2025-01-10 06:59:29,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:29,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 2 letters. Loop has 8 letters. [2025-01-10 06:59:29,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:29,363 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 36 transitions. [2025-01-10 06:59:29,364 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-01-10 06:59:29,366 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 16 states and 21 transitions. [2025-01-10 06:59:29,366 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-01-10 06:59:29,367 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2025-01-10 06:59:29,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2025-01-10 06:59:29,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 06:59:29,367 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 21 transitions. [2025-01-10 06:59:29,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2025-01-10 06:59:29,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-01-10 06:59:29,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:29,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2025-01-10 06:59:29,383 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 21 transitions. [2025-01-10 06:59:29,383 INFO L432 stractBuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2025-01-10 06:59:29,383 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-01-10 06:59:29,383 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2025-01-10 06:59:29,383 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-01-10 06:59:29,383 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 06:59:29,384 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 06:59:29,384 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-01-10 06:59:29,384 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-01-10 06:59:29,384 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#2(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;" "call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" [2025-01-10 06:59:29,384 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#1(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;" "call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" [2025-01-10 06:59:29,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:29,385 INFO L85 PathProgramCache]: Analyzing trace with hash 889538539, now seen corresponding path program 1 times [2025-01-10 06:59:29,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:29,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932448424] [2025-01-10 06:59:29,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:59:29,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:29,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:59:29,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:59:29,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:29,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:29,484 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 06:59:29,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:59:29,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932448424] [2025-01-10 06:59:29,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932448424] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:59:29,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:59:29,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:59:29,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672055769] [2025-01-10 06:59:29,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:59:29,487 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 06:59:29,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:29,487 INFO L85 PathProgramCache]: Analyzing trace with hash 48210908, now seen corresponding path program 1 times [2025-01-10 06:59:29,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:29,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031933622] [2025-01-10 06:59:29,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:59:29,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:29,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:59:29,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:59:29,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:29,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:29,493 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:29,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:59:29,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:59:29,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:29,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:29,498 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:29,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:59:29,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:59:29,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:59:29,598 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. cyclomatic complexity: 7 Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:29,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:59:29,617 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2025-01-10 06:59:29,617 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 30 transitions. [2025-01-10 06:59:29,617 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2025-01-10 06:59:29,618 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 23 states and 27 transitions. [2025-01-10 06:59:29,618 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2025-01-10 06:59:29,618 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2025-01-10 06:59:29,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 27 transitions. [2025-01-10 06:59:29,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 06:59:29,618 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 27 transitions. [2025-01-10 06:59:29,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 27 transitions. [2025-01-10 06:59:29,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2025-01-10 06:59:29,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:29,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2025-01-10 06:59:29,620 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 24 transitions. [2025-01-10 06:59:29,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:59:29,620 INFO L432 stractBuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2025-01-10 06:59:29,620 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-01-10 06:59:29,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 24 transitions. [2025-01-10 06:59:29,621 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2025-01-10 06:59:29,621 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 06:59:29,621 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 06:59:29,621 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1] [2025-01-10 06:59:29,621 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1] [2025-01-10 06:59:29,621 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#2(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;" "call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;" "call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" [2025-01-10 06:59:29,622 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#1(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;" "call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;" "call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" [2025-01-10 06:59:29,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:29,622 INFO L85 PathProgramCache]: Analyzing trace with hash 534776081, now seen corresponding path program 1 times [2025-01-10 06:59:29,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:29,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412869246] [2025-01-10 06:59:29,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:59:29,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:29,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:59:29,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:59:29,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:29,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:29,647 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:29,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:59:29,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:59:29,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:29,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:29,660 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:29,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:29,660 INFO L85 PathProgramCache]: Analyzing trace with hash -2141649790, now seen corresponding path program 1 times [2025-01-10 06:59:29,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:29,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983556975] [2025-01-10 06:59:29,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:59:29,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:29,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:59:29,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:59:29,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:29,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:29,666 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:29,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:59:29,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:59:29,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:29,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:29,671 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:29,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:29,672 INFO L85 PathProgramCache]: Analyzing trace with hash 369765746, now seen corresponding path program 1 times [2025-01-10 06:59:29,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:29,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331378143] [2025-01-10 06:59:29,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:59:29,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:29,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 06:59:29,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 06:59:29,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:29,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:29,692 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:29,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 06:59:29,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 06:59:29,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:29,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:29,708 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:30,502 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 06:59:30,502 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 06:59:30,502 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 06:59:30,502 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 06:59:30,502 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 06:59:30,502 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:30,502 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 06:59:30,502 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 06:59:30,502 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration3_Lasso [2025-01-10 06:59:30,502 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 06:59:30,502 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 06:59:30,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:30,511 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:30,512 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:31,055 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:31,060 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:31,348 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 06:59:31,348 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 06:59:31,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:31,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:31,352 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 06:59:31,352 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 06:59:31,354 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 06:59:31,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:31,364 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 06:59:31,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:31,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:31,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:31,365 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 06:59:31,365 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 06:59:31,366 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:31,371 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 06:59:31,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:31,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:31,373 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 06:59:31,374 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 06:59:31,376 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 06:59:31,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:31,386 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 06:59:31,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:31,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:31,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:31,387 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 06:59:31,387 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 06:59:31,388 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:31,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:31,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:31,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:31,396 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 06:59:31,397 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 06:59:31,398 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 06:59:31,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:31,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:31,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:31,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:31,409 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:31,409 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 06:59:31,412 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:31,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:31,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:31,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:31,419 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 06:59:31,421 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 06:59:31,429 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 06:59:31,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:31,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:31,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:31,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:31,442 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:31,442 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 06:59:31,448 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:31,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:31,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:31,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:31,457 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 06:59:31,458 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 06:59:31,459 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 06:59:31,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:31,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:31,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:31,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:31,474 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:31,474 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 06:59:31,481 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:31,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:31,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:31,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:31,493 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 06:59:31,494 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 06:59:31,496 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 06:59:31,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:31,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:31,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:31,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:31,508 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:31,508 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 06:59:31,511 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:31,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:31,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:31,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:31,520 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 06:59:31,524 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 06:59:31,524 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 06:59:31,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:31,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:31,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:31,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:31,538 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:31,538 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 06:59:31,543 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:31,549 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 06:59:31,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:31,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:31,553 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 06:59:31,556 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 06:59:31,556 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 06:59:31,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:31,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:31,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:31,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:31,573 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:31,573 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 06:59:31,578 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:31,583 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 06:59:31,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:31,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:31,585 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 06:59:31,587 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 06:59:31,588 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 06:59:31,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:31,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:31,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:31,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:31,601 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:31,601 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 06:59:31,604 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:31,611 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 06:59:31,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:31,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:31,613 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 06:59:31,614 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 06:59:31,615 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 06:59:31,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:31,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:31,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:31,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:31,628 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:31,628 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 06:59:31,633 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:31,639 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 06:59:31,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:31,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:31,642 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 06:59:31,642 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 06:59:31,643 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 06:59:31,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:31,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:31,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:31,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:31,659 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:31,659 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 06:59:31,663 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 06:59:31,672 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-01-10 06:59:31,672 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-01-10 06:59:31,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:31,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:31,676 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 06:59:31,677 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 06:59:31,677 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 06:59:31,688 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-01-10 06:59:31,688 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 06:59:31,688 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~mem6#1) = -2*ULTIMATE.start_main_#t~mem6#1 + 1 Supporting invariants [] [2025-01-10 06:59:31,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:31,815 INFO L156 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2025-01-10 06:59:31,821 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~mem6 [2025-01-10 06:59:31,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:31,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:59:31,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:59:31,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:31,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:31,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:59:31,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:31,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:59:31,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:59:31,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:31,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:31,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:59:31,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:31,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-10 06:59:31,932 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:59:31,933 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 06:59:31,933 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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 06:59:31,944 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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) Result 39 states and 49 transitions. Complement of second has 5 states. [2025-01-10 06:59:31,945 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 06:59:31,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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 06:59:31,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2025-01-10 06:59:31,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 10 letters. Loop has 9 letters. [2025-01-10 06:59:31,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:31,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 19 letters. Loop has 9 letters. [2025-01-10 06:59:31,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:31,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 10 letters. Loop has 18 letters. [2025-01-10 06:59:31,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:31,947 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 49 transitions. [2025-01-10 06:59:31,948 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2025-01-10 06:59:31,950 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 49 transitions. [2025-01-10 06:59:31,950 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2025-01-10 06:59:31,950 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2025-01-10 06:59:31,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 49 transitions. [2025-01-10 06:59:31,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 06:59:31,951 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 49 transitions. [2025-01-10 06:59:31,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 49 transitions. [2025-01-10 06:59:31,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2025-01-10 06:59:31,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 33 states have internal predecessors, (43), 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 06:59:31,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2025-01-10 06:59:31,955 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 43 transitions. [2025-01-10 06:59:31,955 INFO L432 stractBuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2025-01-10 06:59:31,955 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-01-10 06:59:31,955 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 43 transitions. [2025-01-10 06:59:31,955 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2025-01-10 06:59:31,955 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 06:59:31,955 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 06:59:31,955 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 06:59:31,955 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-01-10 06:59:31,955 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#2(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;" "call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;" "call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#1(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);" [2025-01-10 06:59:31,955 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;" "call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" [2025-01-10 06:59:31,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:31,956 INFO L85 PathProgramCache]: Analyzing trace with hash -601810652, now seen corresponding path program 2 times [2025-01-10 06:59:31,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:31,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659702323] [2025-01-10 06:59:31,956 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:59:31,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:31,966 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-01-10 06:59:31,993 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:59:31,995 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:59:31,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:31,995 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:31,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:59:32,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:59:32,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:32,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:32,013 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:32,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:32,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1111335, now seen corresponding path program 2 times [2025-01-10 06:59:32,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:32,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14954487] [2025-01-10 06:59:32,014 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:59:32,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:32,018 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:59:32,019 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:59:32,019 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:59:32,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:32,019 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:32,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:59:32,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:59:32,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:32,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:32,024 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:32,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:32,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1173013706, now seen corresponding path program 3 times [2025-01-10 06:59:32,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:32,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179512981] [2025-01-10 06:59:32,025 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:59:32,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:32,032 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 3 equivalence classes. [2025-01-10 06:59:32,052 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 06:59:32,052 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-10 06:59:32,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:32,052 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:32,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 06:59:32,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 06:59:32,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:32,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:32,074 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:32,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-01-10 06:59:33,447 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 06:59:33,447 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 06:59:33,447 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 06:59:33,447 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 06:59:33,447 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 06:59:33,447 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:33,447 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 06:59:33,447 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 06:59:33,447 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration4_Lasso [2025-01-10 06:59:33,447 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 06:59:33,447 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 06:59:33,448 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:33,452 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:33,453 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:33,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:33,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:33,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:34,111 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 06:59:34,111 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 06:59:34,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:34,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:34,117 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 06:59:34,121 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 06:59:34,122 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 06:59:34,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:34,132 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 06:59:34,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:34,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:34,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:34,132 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 06:59:34,133 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 06:59:34,134 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:34,139 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 06:59:34,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:34,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:34,141 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 06:59:34,142 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 06:59:34,143 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 06:59:34,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:34,153 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 06:59:34,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:34,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:34,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:34,154 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 06:59:34,154 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 06:59:34,155 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:34,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:34,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:34,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:34,163 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:34,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-01-10 06:59:34,166 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 06:59:34,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:34,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:34,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:34,176 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:34,177 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:34,177 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 06:59:34,179 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:34,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-01-10 06:59:34,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:34,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:34,187 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:34,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-01-10 06:59:34,190 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 06:59:34,200 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:34,200 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:34,200 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:34,200 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:34,201 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:34,202 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 06:59:34,204 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:34,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-01-10 06:59:34,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:34,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:34,212 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 06:59:34,213 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 06:59:34,214 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 06:59:34,224 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:34,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:34,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:34,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:34,225 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:34,225 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 06:59:34,228 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:34,234 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 06:59:34,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:34,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:34,237 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 06:59:34,238 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 06:59:34,239 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 06:59:34,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:34,249 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:34,249 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:34,249 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:34,250 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:34,250 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 06:59:34,254 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:34,260 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 06:59:34,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:34,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:34,263 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 06:59:34,264 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 06:59:34,265 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 06:59:34,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:34,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:34,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:34,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:34,276 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:34,276 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 06:59:34,279 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:34,285 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 06:59:34,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:34,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:34,288 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 06:59:34,290 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 06:59:34,291 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 06:59:34,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:34,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:34,310 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:34,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:34,311 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:34,311 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 06:59:34,313 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:34,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:34,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:34,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:34,322 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 06:59:34,323 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 06:59:34,324 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 06:59:34,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:34,335 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:34,335 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:34,335 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:34,340 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:34,340 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 06:59:34,347 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:34,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:34,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:34,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:34,359 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 06:59:34,360 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 06:59:34,361 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 06:59:34,372 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:34,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:34,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:34,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:34,375 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:34,375 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 06:59:34,377 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:34,383 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 06:59:34,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:34,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:34,385 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 06:59:34,386 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 06:59:34,388 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 06:59:34,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:34,398 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:34,398 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:34,398 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:34,400 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:34,400 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 06:59:34,402 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:34,407 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 06:59:34,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:34,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:34,412 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 06:59:34,414 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 06:59:34,414 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 06:59:34,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:34,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:34,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:34,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:34,427 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:34,427 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 06:59:34,431 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:34,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:34,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:34,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:34,440 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 06:59:34,451 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 06:59:34,452 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 06:59:34,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:34,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:34,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:34,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:34,466 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:34,466 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 06:59:34,473 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:34,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:34,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:34,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:34,481 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 06:59:34,482 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 06:59:34,483 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 06:59:34,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:34,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:34,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:34,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:34,494 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:34,494 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 06:59:34,496 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:34,501 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 06:59:34,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:34,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:34,504 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 06:59:34,506 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 06:59:34,507 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 06:59:34,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:34,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:34,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:34,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:34,518 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:34,518 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 06:59:34,521 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:34,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:34,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:34,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:34,529 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 06:59:34,529 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 06:59:34,530 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 06:59:34,540 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:34,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:34,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:34,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:34,541 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:34,542 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 06:59:34,544 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:34,549 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 06:59:34,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:34,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:34,551 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 06:59:34,552 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 06:59:34,554 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 06:59:34,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:34,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:34,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:34,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:34,571 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:34,571 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 06:59:34,578 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:34,589 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 06:59:34,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:34,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:34,590 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:34,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-01-10 06:59:34,593 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 06:59:34,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:34,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:34,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:34,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:34,605 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:34,605 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 06:59:34,609 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 06:59:34,618 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-01-10 06:59:34,618 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-01-10 06:59:34,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:34,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:34,623 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:34,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-01-10 06:59:34,626 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 06:59:34,637 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-01-10 06:59:34,637 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 06:59:34,637 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~x0~0#1.base) 0)_2) = -2*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~x0~0#1.base) 0)_2 + 1 Supporting invariants [] [2025-01-10 06:59:34,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:34,717 INFO L156 tatePredicateManager]: 34 out of 35 supporting invariants were superfluous and have been removed [2025-01-10 06:59:34,718 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-01-10 06:59:34,718 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-01-10 06:59:34,718 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x0~0!base,]]] [2025-01-10 06:59:34,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:34,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:59:34,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:59:34,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:34,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:34,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:59:34,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:34,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:59:34,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:59:34,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:34,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:34,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 06:59:34,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:34,811 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 06:59:34,812 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2025-01-10 06:59:34,812 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 43 transitions. cyclomatic complexity: 13 Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 06:59:34,849 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 43 transitions. cyclomatic complexity: 13. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 80 states and 95 transitions. Complement of second has 8 states. [2025-01-10 06:59:34,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2025-01-10 06:59:34,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 06:59:34,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2025-01-10 06:59:34,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 11 letters. Loop has 4 letters. [2025-01-10 06:59:34,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:34,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 15 letters. Loop has 4 letters. [2025-01-10 06:59:34,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:34,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 11 letters. Loop has 8 letters. [2025-01-10 06:59:34,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:34,853 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 95 transitions. [2025-01-10 06:59:34,854 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 24 [2025-01-10 06:59:34,854 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 66 states and 79 transitions. [2025-01-10 06:59:34,854 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2025-01-10 06:59:34,854 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2025-01-10 06:59:34,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 79 transitions. [2025-01-10 06:59:34,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 06:59:34,854 INFO L218 hiAutomatonCegarLoop]: Abstraction has 66 states and 79 transitions. [2025-01-10 06:59:34,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 79 transitions. [2025-01-10 06:59:34,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2025-01-10 06:59:34,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 1.2166666666666666) internal successors, (73), 59 states have internal predecessors, (73), 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 06:59:34,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 73 transitions. [2025-01-10 06:59:34,857 INFO L240 hiAutomatonCegarLoop]: Abstraction has 60 states and 73 transitions. [2025-01-10 06:59:34,857 INFO L432 stractBuchiCegarLoop]: Abstraction has 60 states and 73 transitions. [2025-01-10 06:59:34,857 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-01-10 06:59:34,857 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 73 transitions. [2025-01-10 06:59:34,857 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 24 [2025-01-10 06:59:34,857 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 06:59:34,857 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 06:59:34,858 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 06:59:34,858 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1] [2025-01-10 06:59:34,858 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#2(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;" "call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;" "call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" [2025-01-10 06:59:34,858 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 == main_#t~mem7#1;havoc main_#t~mem7#1;call write~int#2(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;" "call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;" "call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" [2025-01-10 06:59:34,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:34,858 INFO L85 PathProgramCache]: Analyzing trace with hash -601810650, now seen corresponding path program 1 times [2025-01-10 06:59:34,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:34,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791971119] [2025-01-10 06:59:34,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:59:34,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:34,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:59:34,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:59:34,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:34,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:34,922 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:59:34,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:59:34,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791971119] [2025-01-10 06:59:34,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791971119] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:59:34,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:59:34,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:59:34,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062724777] [2025-01-10 06:59:34,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:59:34,922 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 06:59:34,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:34,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1345765744, now seen corresponding path program 1 times [2025-01-10 06:59:34,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:34,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140240730] [2025-01-10 06:59:34,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:59:34,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:34,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:59:34,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:59:34,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:34,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:34,929 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:34,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:59:34,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:59:34,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:34,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:34,936 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:35,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2025-01-10 06:59:35,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:59:35,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:59:35,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:59:35,250 INFO L87 Difference]: Start difference. First operand 60 states and 73 transitions. cyclomatic complexity: 20 Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:35,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:59:35,267 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2025-01-10 06:59:35,267 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 60 transitions. [2025-01-10 06:59:35,268 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2025-01-10 06:59:35,268 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 60 transitions. [2025-01-10 06:59:35,268 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2025-01-10 06:59:35,268 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2025-01-10 06:59:35,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 60 transitions. [2025-01-10 06:59:35,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 06:59:35,269 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 60 transitions. [2025-01-10 06:59:35,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 60 transitions. [2025-01-10 06:59:35,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-01-10 06:59:35,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 50 states have internal predecessors, (60), 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 06:59:35,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2025-01-10 06:59:35,270 INFO L240 hiAutomatonCegarLoop]: Abstraction has 51 states and 60 transitions. [2025-01-10 06:59:35,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:59:35,271 INFO L432 stractBuchiCegarLoop]: Abstraction has 51 states and 60 transitions. [2025-01-10 06:59:35,271 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-01-10 06:59:35,271 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 60 transitions. [2025-01-10 06:59:35,272 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2025-01-10 06:59:35,272 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 06:59:35,272 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 06:59:35,272 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 2, 2, 2, 1, 1] [2025-01-10 06:59:35,272 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-01-10 06:59:35,272 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#2(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;" "call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;" "call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#1(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;" "call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;" "call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#1(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);" [2025-01-10 06:59:35,272 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;" "call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" [2025-01-10 06:59:35,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:35,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1422163741, now seen corresponding path program 4 times [2025-01-10 06:59:35,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:35,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093474472] [2025-01-10 06:59:35,274 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 06:59:35,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:35,283 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-01-10 06:59:35,289 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 06:59:35,289 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-10 06:59:35,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:35,548 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:59:35,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:59:35,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093474472] [2025-01-10 06:59:35,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093474472] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:59:35,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150135948] [2025-01-10 06:59:35,549 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 06:59:35,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:59:35,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:35,552 INFO L229 MonitoredProcess]: Starting monitored process 49 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 06:59:35,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2025-01-10 06:59:35,609 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-01-10 06:59:35,645 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 06:59:35,646 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-10 06:59:35,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:35,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:59:35,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:35,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-10 06:59:35,687 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 06:59:35,687 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:59:35,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150135948] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:59:35,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:59:35,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-01-10 06:59:35,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943034964] [2025-01-10 06:59:35,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:59:35,688 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 06:59:35,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:35,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1111335, now seen corresponding path program 3 times [2025-01-10 06:59:35,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:35,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658187724] [2025-01-10 06:59:35,690 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:59:35,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:35,697 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:59:35,698 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:59:35,698 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 06:59:35,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:35,698 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:35,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:59:35,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:59:35,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:35,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:35,705 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:35,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:59:35,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:59:35,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:59:35,757 INFO L87 Difference]: Start difference. First operand 51 states and 60 transitions. cyclomatic complexity: 14 Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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 06:59:35,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:59:35,776 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2025-01-10 06:59:35,776 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 44 transitions. [2025-01-10 06:59:35,777 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2025-01-10 06:59:35,781 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 44 transitions. [2025-01-10 06:59:35,781 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2025-01-10 06:59:35,781 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2025-01-10 06:59:35,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 44 transitions. [2025-01-10 06:59:35,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 06:59:35,781 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 44 transitions. [2025-01-10 06:59:35,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 44 transitions. [2025-01-10 06:59:35,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2025-01-10 06:59:35,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.131578947368421) internal successors, (43), 37 states have internal predecessors, (43), 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 06:59:35,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2025-01-10 06:59:35,787 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 43 transitions. [2025-01-10 06:59:35,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:59:35,788 INFO L432 stractBuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2025-01-10 06:59:35,788 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-01-10 06:59:35,788 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 43 transitions. [2025-01-10 06:59:35,788 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2025-01-10 06:59:35,788 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 06:59:35,788 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 06:59:35,789 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 2, 2, 1, 1, 1] [2025-01-10 06:59:35,789 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 4, 2, 2, 1, 1, 1] [2025-01-10 06:59:35,789 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#2(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;" "call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;" "call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#1(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;" "call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;" "call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" [2025-01-10 06:59:35,789 INFO L754 eck$LassoCheckResult]: Loop: "assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume 0 == main_#t~mem7#1;havoc main_#t~mem7#1;call write~int#2(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;" "call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;" "call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#1(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;" "call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;" "call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" [2025-01-10 06:59:35,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:35,789 INFO L85 PathProgramCache]: Analyzing trace with hash 369765746, now seen corresponding path program 5 times [2025-01-10 06:59:35,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:35,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038196513] [2025-01-10 06:59:35,789 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 06:59:35,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:35,803 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 4 equivalence classes. [2025-01-10 06:59:35,830 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 06:59:35,830 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-01-10 06:59:35,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:35,831 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:35,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 06:59:35,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 06:59:35,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:35,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:35,852 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:35,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:35,853 INFO L85 PathProgramCache]: Analyzing trace with hash -33150799, now seen corresponding path program 1 times [2025-01-10 06:59:35,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:35,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699024135] [2025-01-10 06:59:35,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:59:35,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:35,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 06:59:35,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 06:59:35,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:35,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:35,865 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:35,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 06:59:35,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 06:59:35,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:35,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:35,871 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:35,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:35,872 INFO L85 PathProgramCache]: Analyzing trace with hash 953842592, now seen corresponding path program 1 times [2025-01-10 06:59:35,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:35,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421840600] [2025-01-10 06:59:35,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:59:35,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:35,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-10 06:59:35,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 06:59:35,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:35,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:35,905 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:35,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-10 06:59:35,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 06:59:35,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:35,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:35,921 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:37,635 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 06:59:37,636 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 06:59:37,636 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 06:59:37,636 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 06:59:37,636 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 06:59:37,636 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:37,636 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 06:59:37,636 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 06:59:37,636 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration7_Lasso [2025-01-10 06:59:37,636 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 06:59:37,636 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 06:59:37,637 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:37,639 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:37,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:37,643 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:38,106 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:38,397 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 06:59:38,397 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 06:59:38,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:38,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:38,400 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:38,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-01-10 06:59:38,402 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 06:59:38,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:38,412 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 06:59:38,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:38,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:38,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:38,413 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 06:59:38,413 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 06:59:38,414 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:38,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:38,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:38,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:38,422 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:38,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-01-10 06:59:38,424 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 06:59:38,433 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:38,433 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 06:59:38,433 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:38,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:38,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:38,437 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 06:59:38,437 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 06:59:38,438 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:38,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:38,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:38,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:38,448 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:38,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-01-10 06:59:38,450 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 06:59:38,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:38,459 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 06:59:38,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:38,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:38,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:38,459 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 06:59:38,460 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 06:59:38,461 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:38,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2025-01-10 06:59:38,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:38,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:38,480 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:38,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-01-10 06:59:38,485 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 06:59:38,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:38,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:38,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:38,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:38,508 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:38,508 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 06:59:38,515 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:38,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:38,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:38,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:38,526 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:38,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-01-10 06:59:38,529 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 06:59:38,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:38,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:38,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:38,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:38,540 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:38,540 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 06:59:38,543 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 06:59:38,549 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-01-10 06:59:38,549 INFO L444 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-01-10 06:59:38,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:38,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:38,551 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:38,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-01-10 06:59:38,553 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 06:59:38,563 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-01-10 06:59:38,564 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 06:59:38,564 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#2 ULTIMATE.start_main_~x2~0#1.base) ULTIMATE.start_main_~x2~0#1.offset)_4) = -2*v_rep(select (select #memory_int#2 ULTIMATE.start_main_~x2~0#1.base) ULTIMATE.start_main_~x2~0#1.offset)_4 + 1 Supporting invariants [] [2025-01-10 06:59:38,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-01-10 06:59:38,654 INFO L156 tatePredicateManager]: 38 out of 38 supporting invariants were superfluous and have been removed [2025-01-10 06:59:38,655 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-01-10 06:59:38,656 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-01-10 06:59:38,656 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~x2~0!base,]]] [2025-01-10 06:59:38,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:38,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 06:59:38,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 06:59:38,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:38,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:38,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:59:38,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:38,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 06:59:38,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 06:59:38,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:38,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:38,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:59:38,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:38,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2025-01-10 06:59:38,838 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:59:38,839 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-01-10 06:59:38,839 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 43 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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 06:59:38,855 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 43 transitions. cyclomatic complexity: 8. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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) Result 83 states and 95 transitions. Complement of second has 7 states. [2025-01-10 06:59:38,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-01-10 06:59:38,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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 06:59:38,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2025-01-10 06:59:38,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 19 letters. Loop has 19 letters. [2025-01-10 06:59:38,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:38,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 38 letters. Loop has 19 letters. [2025-01-10 06:59:38,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:38,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 19 letters. Loop has 38 letters. [2025-01-10 06:59:38,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:38,861 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 95 transitions. [2025-01-10 06:59:38,862 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 27 [2025-01-10 06:59:38,862 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 83 states and 95 transitions. [2025-01-10 06:59:38,862 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2025-01-10 06:59:38,863 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2025-01-10 06:59:38,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 95 transitions. [2025-01-10 06:59:38,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 06:59:38,863 INFO L218 hiAutomatonCegarLoop]: Abstraction has 83 states and 95 transitions. [2025-01-10 06:59:38,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 95 transitions. [2025-01-10 06:59:38,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-01-10 06:59:38,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 83 states have (on average 1.144578313253012) internal successors, (95), 82 states have internal predecessors, (95), 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 06:59:38,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 95 transitions. [2025-01-10 06:59:38,871 INFO L240 hiAutomatonCegarLoop]: Abstraction has 83 states and 95 transitions. [2025-01-10 06:59:38,871 INFO L432 stractBuchiCegarLoop]: Abstraction has 83 states and 95 transitions. [2025-01-10 06:59:38,871 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-01-10 06:59:38,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 95 transitions. [2025-01-10 06:59:38,872 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 27 [2025-01-10 06:59:38,873 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 06:59:38,873 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 06:59:38,874 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 06:59:38,874 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 4, 2, 2, 1, 1, 1] [2025-01-10 06:59:38,874 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#2(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;" "call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;" "call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#1(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;" "call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;" "call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume !(0 == main_#t~mem7#1);havoc main_#t~mem7#1;call write~int#2(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(1, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" [2025-01-10 06:59:38,874 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;" "call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;" "call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#1(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;" "call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;" "call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume 0 == main_#t~mem7#1;havoc main_#t~mem7#1;call write~int#2(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);" [2025-01-10 06:59:38,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:38,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1137402921, now seen corresponding path program 1 times [2025-01-10 06:59:38,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:38,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50328926] [2025-01-10 06:59:38,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:59:38,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:38,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 06:59:38,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 06:59:38,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:38,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:38,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2025-01-10 06:59:39,037 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-10 06:59:39,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:59:39,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50328926] [2025-01-10 06:59:39,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50328926] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:59:39,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:59:39,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:59:39,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469032778] [2025-01-10 06:59:39,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:59:39,038 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 06:59:39,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:39,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1309477591, now seen corresponding path program 2 times [2025-01-10 06:59:39,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:39,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560564923] [2025-01-10 06:59:39,038 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:59:39,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:39,054 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-01-10 06:59:39,061 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 06:59:39,062 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:59:39,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:39,062 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:39,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 06:59:39,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 06:59:39,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:39,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:39,073 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:39,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:59:39,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:59:39,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:59:39,514 INFO L87 Difference]: Start difference. First operand 83 states and 95 transitions. cyclomatic complexity: 19 Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:39,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:59:39,532 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2025-01-10 06:59:39,532 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 119 transitions. [2025-01-10 06:59:39,533 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 46 [2025-01-10 06:59:39,533 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 96 states and 108 transitions. [2025-01-10 06:59:39,534 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2025-01-10 06:59:39,534 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2025-01-10 06:59:39,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 96 states and 108 transitions. [2025-01-10 06:59:39,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 06:59:39,534 INFO L218 hiAutomatonCegarLoop]: Abstraction has 96 states and 108 transitions. [2025-01-10 06:59:39,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states and 108 transitions. [2025-01-10 06:59:39,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2025-01-10 06:59:39,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 94 states have (on average 1.127659574468085) internal successors, (106), 93 states have internal predecessors, (106), 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 06:59:39,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2025-01-10 06:59:39,541 INFO L240 hiAutomatonCegarLoop]: Abstraction has 94 states and 106 transitions. [2025-01-10 06:59:39,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:59:39,545 INFO L432 stractBuchiCegarLoop]: Abstraction has 94 states and 106 transitions. [2025-01-10 06:59:39,545 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-01-10 06:59:39,545 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 106 transitions. [2025-01-10 06:59:39,546 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 46 [2025-01-10 06:59:39,546 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 06:59:39,546 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 06:59:39,547 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 3, 2, 1, 1, 1, 1, 1] [2025-01-10 06:59:39,547 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-01-10 06:59:39,547 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#2(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;" "call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;" "call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#1(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;" "call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;" "call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume 0 == main_#t~mem7#1;havoc main_#t~mem7#1;call write~int#2(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;" "call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" [2025-01-10 06:59:39,547 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;" "call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" [2025-01-10 06:59:39,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:39,547 INFO L85 PathProgramCache]: Analyzing trace with hash 371951355, now seen corresponding path program 2 times [2025-01-10 06:59:39,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:39,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097439881] [2025-01-10 06:59:39,548 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:59:39,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:39,565 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-01-10 06:59:39,591 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 06:59:39,591 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:59:39,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:39,592 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:39,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 06:59:39,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 06:59:39,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:39,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:39,613 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:39,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:39,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1111335, now seen corresponding path program 4 times [2025-01-10 06:59:39,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:39,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761699347] [2025-01-10 06:59:39,616 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 06:59:39,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:39,621 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 4 statements into 2 equivalence classes. [2025-01-10 06:59:39,622 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:59:39,626 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 06:59:39,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:39,626 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:39,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:59:39,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:59:39,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:39,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:39,632 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:39,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:39,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1993109281, now seen corresponding path program 3 times [2025-01-10 06:59:39,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:39,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385384489] [2025-01-10 06:59:39,633 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:59:39,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:39,652 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 6 equivalence classes. [2025-01-10 06:59:39,667 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 10 of 29 statements. [2025-01-10 06:59:39,667 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 06:59:39,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:39,739 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-01-10 06:59:39,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:59:39,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385384489] [2025-01-10 06:59:39,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385384489] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:59:39,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:59:39,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:59:39,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575201263] [2025-01-10 06:59:39,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:59:39,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:59:39,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:59:39,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:59:39,794 INFO L87 Difference]: Start difference. First operand 94 states and 106 transitions. cyclomatic complexity: 18 Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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 06:59:39,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:59:39,808 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2025-01-10 06:59:39,808 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 102 transitions. [2025-01-10 06:59:39,808 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2025-01-10 06:59:39,809 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 94 states and 96 transitions. [2025-01-10 06:59:39,809 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2025-01-10 06:59:39,809 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2025-01-10 06:59:39,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 96 transitions. [2025-01-10 06:59:39,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 06:59:39,809 INFO L218 hiAutomatonCegarLoop]: Abstraction has 94 states and 96 transitions. [2025-01-10 06:59:39,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 96 transitions. [2025-01-10 06:59:39,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 86. [2025-01-10 06:59:39,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 85 states have internal predecessors, (88), 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 06:59:39,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2025-01-10 06:59:39,812 INFO L240 hiAutomatonCegarLoop]: Abstraction has 86 states and 88 transitions. [2025-01-10 06:59:39,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:59:39,818 INFO L432 stractBuchiCegarLoop]: Abstraction has 86 states and 88 transitions. [2025-01-10 06:59:39,818 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-01-10 06:59:39,818 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 88 transitions. [2025-01-10 06:59:39,818 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2025-01-10 06:59:39,818 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 06:59:39,818 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 06:59:39,821 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 8, 4, 4, 2, 2, 1, 1, 1, 1] [2025-01-10 06:59:39,821 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 8, 8, 4, 4, 2, 2, 1, 1] [2025-01-10 06:59:39,821 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#2(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;" "call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;" "call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#1(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;" "call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;" "call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume 0 == main_#t~mem7#1;havoc main_#t~mem7#1;call write~int#2(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;" "call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;" "call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#1(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;" "call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;" "call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume !(0 == main_#t~mem7#1);havoc main_#t~mem7#1;call write~int#2(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(1, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" [2025-01-10 06:59:39,821 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;" "call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;" "call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#1(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;" "call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;" "call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume 0 == main_#t~mem7#1;havoc main_#t~mem7#1;call write~int#2(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;" "call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;" "call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#1(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;" "call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;" "call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume !(0 == main_#t~mem7#1);havoc main_#t~mem7#1;call write~int#2(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(1, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" [2025-01-10 06:59:39,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:39,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1814697605, now seen corresponding path program 1 times [2025-01-10 06:59:39,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:39,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557300156] [2025-01-10 06:59:39,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:59:39,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:39,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-10 06:59:39,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-10 06:59:39,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:39,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:39,841 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:39,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-10 06:59:39,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-10 06:59:39,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:39,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:39,857 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:39,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:39,858 INFO L85 PathProgramCache]: Analyzing trace with hash 378074179, now seen corresponding path program 1 times [2025-01-10 06:59:39,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:39,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355964413] [2025-01-10 06:59:39,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:59:39,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:39,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-10 06:59:39,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 06:59:39,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:39,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:39,872 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:39,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-10 06:59:39,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 06:59:39,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:39,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:39,880 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:39,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:39,880 INFO L85 PathProgramCache]: Analyzing trace with hash -856553529, now seen corresponding path program 2 times [2025-01-10 06:59:39,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:39,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492588033] [2025-01-10 06:59:39,880 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:59:39,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:39,896 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 78 statements into 2 equivalence classes. [2025-01-10 06:59:39,904 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 78 of 78 statements. [2025-01-10 06:59:39,904 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:59:39,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:40,138 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 268 proven. 61 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2025-01-10 06:59:40,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:59:40,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492588033] [2025-01-10 06:59:40,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492588033] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:59:40,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401936939] [2025-01-10 06:59:40,138 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:59:40,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:59:40,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:40,140 INFO L229 MonitoredProcess]: Starting monitored process 56 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 06:59:40,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2025-01-10 06:59:40,208 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 78 statements into 2 equivalence classes. [2025-01-10 06:59:40,268 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 78 of 78 statements. [2025-01-10 06:59:40,268 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:59:40,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:40,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:59:40,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:40,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-10 06:59:40,330 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 294 proven. 7 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2025-01-10 06:59:40,330 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:59:40,382 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 294 proven. 7 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2025-01-10 06:59:40,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401936939] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:59:40,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:59:40,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 8 [2025-01-10 06:59:40,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169326104] [2025-01-10 06:59:40,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:59:42,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:59:42,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:59:42,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:59:42,282 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. cyclomatic complexity: 4 Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:42,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:59:42,318 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2025-01-10 06:59:42,318 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 50 transitions. [2025-01-10 06:59:42,318 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-01-10 06:59:42,318 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 0 states and 0 transitions. [2025-01-10 06:59:42,318 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-01-10 06:59:42,318 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-01-10 06:59:42,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-01-10 06:59:42,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 06:59:42,318 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 06:59:42,318 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 06:59:42,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:59:42,319 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 06:59:42,319 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-01-10 06:59:42,319 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-01-10 06:59:42,319 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-01-10 06:59:42,319 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-01-10 06:59:42,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.01 06:59:42 BoogieIcfgContainer [2025-01-10 06:59:42,328 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-01-10 06:59:42,329 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 06:59:42,329 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 06:59:42,329 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 06:59:42,330 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:59:26" (3/4) ... [2025-01-10 06:59:42,331 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 06:59:42,332 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 06:59:42,336 INFO L158 Benchmark]: Toolchain (without parser) took 16535.74ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 133.7MB in the beginning and 186.5MB in the end (delta: -52.7MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2025-01-10 06:59:42,336 INFO L158 Benchmark]: CDTParser took 0.59ms. Allocated memory is still 201.3MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:59:42,336 INFO L158 Benchmark]: CACSL2BoogieTranslator took 157.82ms. Allocated memory is still 167.8MB. Free memory was 133.7MB in the beginning and 123.4MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 06:59:42,336 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.61ms. Allocated memory is still 167.8MB. Free memory was 123.4MB in the beginning and 122.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:59:42,336 INFO L158 Benchmark]: Boogie Preprocessor took 40.66ms. Allocated memory is still 167.8MB. Free memory was 122.1MB in the beginning and 120.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:59:42,337 INFO L158 Benchmark]: RCFGBuilder took 234.26ms. Allocated memory is still 167.8MB. Free memory was 120.7MB in the beginning and 108.5MB in the end (delta: 12.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 06:59:42,337 INFO L158 Benchmark]: BuchiAutomizer took 16066.50ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 108.5MB in the beginning and 186.6MB in the end (delta: -78.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:59:42,337 INFO L158 Benchmark]: Witness Printer took 6.41ms. Allocated memory is still 243.3MB. Free memory was 186.6MB in the beginning and 186.5MB in the end (delta: 86.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:59:42,338 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.59ms. Allocated memory is still 201.3MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 157.82ms. Allocated memory is still 167.8MB. Free memory was 133.7MB in the beginning and 123.4MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.61ms. Allocated memory is still 167.8MB. Free memory was 123.4MB in the beginning and 122.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.66ms. Allocated memory is still 167.8MB. Free memory was 122.1MB in the beginning and 120.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 234.26ms. Allocated memory is still 167.8MB. Free memory was 120.7MB in the beginning and 108.5MB in the end (delta: 12.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 16066.50ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 108.5MB in the beginning and 186.6MB in the end (delta: -78.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 6.41ms. Allocated memory is still 243.3MB. Free memory was 186.6MB in the beginning and 186.5MB in the end (delta: 86.5kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x0~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~mem6 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x0~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~x2~0!base,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (6 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 5 locations. One deterministic module has affine ranking function null and consists of 3 locations. One deterministic module has affine ranking function null and consists of 5 locations. One deterministic module has affine ranking function null and consists of 4 locations. 6 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 16.0s and 11 iterations. TraceHistogramMax:8. Analysis of lassos took 15.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 9. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 25 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 29/29 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 65 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 62 mSDsluCounter, 255 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 149 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 111 IncrementalHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 106 mSDtfsCounter, 111 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU4 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital270 mio100 ax100 hnf100 lsp100 ukn73 mio100 lsp24 div100 bol100 ite100 ukn100 eq165 hnf90 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 37ms VariablesStem: 2 VariablesLoop: 2 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 06:59:42,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Ended with exit code 0 [2025-01-10 06:59:42,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:42,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE