./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 c00e63dc 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-?-c00e63d-m [2025-02-06 18:58:14,765 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 18:58:14,822 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-02-06 18:58:14,828 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 18:58:14,828 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 18:58:14,829 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-06 18:58:14,848 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 18:58:14,849 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 18:58:14,850 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 18:58:14,850 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 18:58:14,851 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 18:58:14,851 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 18:58:14,851 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 18:58:14,851 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 18:58:14,851 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-06 18:58:14,852 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-06 18:58:14,852 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-06 18:58:14,852 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-06 18:58:14,852 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-06 18:58:14,852 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-06 18:58:14,852 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 18:58:14,852 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-06 18:58:14,852 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 18:58:14,852 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 18:58:14,852 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-06 18:58:14,852 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-06 18:58:14,852 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-06 18:58:14,852 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 18:58:14,853 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 18:58:14,853 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-06 18:58:14,853 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 18:58:14,853 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 18:58:14,853 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 18:58:14,853 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 18:58:14,853 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 18:58:14,854 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 18:58:14,854 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-06 18:58:14,854 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-02-06 18:58:15,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 18:58:15,089 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 18:58:15,091 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 18:58:15,093 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 18:58:15,093 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 18:58:15,094 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-02-06 18:58:16,245 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/674598305/51cac3ad3a8c4b4c9317987809f45282/FLAG89f27f892 [2025-02-06 18:58:16,462 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 18:58:16,462 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2025-02-06 18:58:16,472 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/674598305/51cac3ad3a8c4b4c9317987809f45282/FLAG89f27f892 [2025-02-06 18:58:16,822 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/674598305/51cac3ad3a8c4b4c9317987809f45282 [2025-02-06 18:58:16,823 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 18:58:16,824 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 18:58:16,825 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 18:58:16,825 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 18:58:16,828 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 18:58:16,829 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:58:16" (1/1) ... [2025-02-06 18:58:16,829 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@220808e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:58:16, skipping insertion in model container [2025-02-06 18:58:16,829 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:58:16" (1/1) ... [2025-02-06 18:58:16,838 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 18:58:16,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:58:16,932 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 18:58:16,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:58:16,947 INFO L204 MainTranslator]: Completed translation [2025-02-06 18:58:16,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:58:16 WrapperNode [2025-02-06 18:58:16,948 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 18:58:16,949 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 18:58:16,949 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 18:58:16,949 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 18:58:16,952 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:58:16" (1/1) ... [2025-02-06 18:58:16,960 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:58:16" (1/1) ... [2025-02-06 18:58:16,972 INFO L138 Inliner]: procedures = 7, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 59 [2025-02-06 18:58:16,972 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 18:58:16,972 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 18:58:16,972 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 18:58:16,972 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 18:58:16,977 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:58:16" (1/1) ... [2025-02-06 18:58:16,977 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:58:16" (1/1) ... [2025-02-06 18:58:16,978 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:58:16" (1/1) ... [2025-02-06 18:58:16,985 INFO L175 MemorySlicer]: Split 15 memory accesses to 4 slices as follows [3, 4, 4, 4]. 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 [2, 3, 3, 3]. [2025-02-06 18:58:16,985 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:58:16" (1/1) ... [2025-02-06 18:58:16,985 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:58:16" (1/1) ... [2025-02-06 18:58:16,990 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:58:16" (1/1) ... [2025-02-06 18:58:16,990 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:58:16" (1/1) ... [2025-02-06 18:58:16,991 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:58:16" (1/1) ... [2025-02-06 18:58:16,991 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:58:16" (1/1) ... [2025-02-06 18:58:16,992 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 18:58:16,993 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 18:58:16,993 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 18:58:16,993 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 18:58:16,995 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:58:16" (1/1) ... [2025-02-06 18:58:16,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:17,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:17,037 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:17,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-02-06 18:58:17,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 18:58:17,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 18:58:17,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 18:58:17,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 18:58:17,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 18:58:17,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 18:58:17,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 18:58:17,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 18:58:17,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 18:58:17,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 18:58:17,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 18:58:17,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 18:58:17,110 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 18:58:17,111 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 18:58:17,226 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7: call ULTIMATE.dealloc(main_#t~malloc0#1.base, main_#t~malloc0#1.offset);havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call ULTIMATE.dealloc(main_#t~malloc1#1.base, main_#t~malloc1#1.offset);havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call ULTIMATE.dealloc(main_#t~malloc2#1.base, main_#t~malloc2#1.offset);havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call ULTIMATE.dealloc(main_#t~malloc3#1.base, main_#t~malloc3#1.offset);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; [2025-02-06 18:58:17,235 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-02-06 18:58:17,235 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 18:58:17,243 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 18:58:17,243 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 18:58:17,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:58:17 BoogieIcfgContainer [2025-02-06 18:58:17,244 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 18:58:17,244 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-06 18:58:17,244 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-06 18:58:17,248 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-06 18:58:17,249 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 18:58:17,249 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.02 06:58:16" (1/3) ... [2025-02-06 18:58:17,249 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9ad178f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 06:58:17, skipping insertion in model container [2025-02-06 18:58:17,250 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 18:58:17,250 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:58:16" (2/3) ... [2025-02-06 18:58:17,250 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9ad178f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 06:58:17, skipping insertion in model container [2025-02-06 18:58:17,250 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 18:58:17,250 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:58:17" (3/3) ... [2025-02-06 18:58:17,251 INFO L363 chiAutomizerObserver]: Analyzing ICFG 4BitCounterPointer.c [2025-02-06 18:58:17,293 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-06 18:58:17,293 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-06 18:58:17,294 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-06 18:58:17,294 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-06 18:58:17,295 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-06 18:58:17,295 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-06 18:58:17,295 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-06 18:58:17,295 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-06 18:58:17,298 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:58:17,308 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-02-06 18:58:17,309 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 18:58:17,309 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 18:58:17,312 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-06 18:58:17,312 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-06 18:58:17,312 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-06 18:58:17,312 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:58:17,313 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-02-06 18:58:17,313 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 18:58:17,314 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 18:58:17,314 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-06 18:58:17,314 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-06 18:58:17,317 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#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#1(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" [2025-02-06 18:58:17,317 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem4#1 := read~int#0(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#3(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#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" [2025-02-06 18:58:17,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:58:17,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1504, now seen corresponding path program 1 times [2025-02-06 18:58:17,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:58:17,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048527615] [2025-02-06 18:58:17,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:58:17,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:58:17,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 18:58:17,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 18:58:17,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:17,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:17,463 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:58:17,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 18:58:17,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 18:58:17,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:17,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:17,512 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:58:17,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:58:17,514 INFO L85 PathProgramCache]: Analyzing trace with hash 43652, now seen corresponding path program 1 times [2025-02-06 18:58:17,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:58:17,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528108632] [2025-02-06 18:58:17,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:58:17,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:58:17,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 18:58:17,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 18:58:17,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:17,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:17,527 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:58:17,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 18:58:17,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 18:58:17,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:17,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:17,533 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:58:17,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:58:17,534 INFO L85 PathProgramCache]: Analyzing trace with hash 44819525, now seen corresponding path program 1 times [2025-02-06 18:58:17,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:58:17,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633354654] [2025-02-06 18:58:17,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:58:17,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:58:17,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 18:58:17,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 18:58:17,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:17,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:17,597 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:58:17,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 18:58:17,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 18:58:17,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:17,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:17,620 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:58:18,362 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 18:58:18,363 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 18:58:18,363 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 18:58:18,363 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 18:58:18,363 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 18:58:18,363 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:18,364 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 18:58:18,364 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 18:58:18,364 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration1_Lasso [2025-02-06 18:58:18,364 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 18:58:18,365 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 18:58:18,375 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:18,838 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:18,841 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:18,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:18,843 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:18,848 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:18,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:19,118 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 18:58:19,121 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 18:58:19,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:19,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:19,126 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:19,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-02-06 18:58:19,128 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 18:58:19,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 18:58:19,140 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 18:58:19,140 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 18:58:19,140 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 18:58:19,150 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 18:58:19,150 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 18:58:19,155 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 18:58:19,161 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-02-06 18:58:19,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:19,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:19,163 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:19,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-02-06 18:58:19,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-02-06 18:58:19,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 18:58:19,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 18:58:19,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 18:58:19,176 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 18:58:19,178 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 18:58:19,178 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 18:58:19,180 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 18:58:19,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-02-06 18:58:19,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:19,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:19,189 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:19,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-02-06 18:58:19,192 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 18:58:19,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 18:58:19,203 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 18:58:19,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 18:58:19,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 18:58:19,208 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 18:58:19,209 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 18:58:19,213 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 18:58:19,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-02-06 18:58:19,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:19,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:19,222 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:19,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-02-06 18:58:19,224 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 18:58:19,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 18:58:19,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 18:58:19,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 18:58:19,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 18:58:19,240 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 18:58:19,240 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 18:58:19,245 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 18:58:19,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-02-06 18:58:19,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:19,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:19,253 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:19,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-02-06 18:58:19,256 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 18:58:19,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 18:58:19,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 18:58:19,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 18:58:19,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 18:58:19,269 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 18:58:19,269 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 18:58:19,274 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 18:58:19,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-02-06 18:58:19,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:19,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:19,283 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:19,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-02-06 18:58:19,285 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 18:58:19,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 18:58:19,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 18:58:19,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 18:58:19,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 18:58:19,299 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 18:58:19,300 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 18:58:19,304 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 18:58:19,323 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-02-06 18:58:19,325 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-02-06 18:58:19,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:19,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:19,328 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:19,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-02-06 18:58:19,330 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 18:58:19,347 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 18:58:19,347 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 18:58:19,348 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#3 ULTIMATE.start_main_~x0~0#1.base) 0)_1) = -2*v_rep(select (select #memory_int#3 ULTIMATE.start_main_~x0~0#1.base) 0)_1 + 1 Supporting invariants [] [2025-02-06 18:58:19,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-02-06 18:58:19,423 INFO L156 tatePredicateManager]: 28 out of 29 supporting invariants were superfluous and have been removed [2025-02-06 18:58:19,428 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-02-06 18:58:19,429 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-02-06 18:58:19,429 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~x0~0!base,]]] [2025-02-06 18:58:19,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:58:19,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 18:58:19,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 18:58:19,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:19,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:58:19,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 18:58:19,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:58:19,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 18:58:19,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 18:58:19,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:19,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:58:19,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 18:58:19,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:58:19,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:58:19,522 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-06 18:58:19,523 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:58:19,571 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 25 states and 33 transitions. Complement of second has 8 states. [2025-02-06 18:58:19,574 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-02-06 18:58:19,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:58:19,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2025-02-06 18:58:19,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 2 letters. Loop has 3 letters. [2025-02-06 18:58:19,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 18:58:19,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 3 letters. [2025-02-06 18:58:19,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 18:58:19,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 2 letters. Loop has 6 letters. [2025-02-06 18:58:19,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 18:58:19,582 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 33 transitions. [2025-02-06 18:58:19,583 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-02-06 18:58:19,584 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 13 states and 18 transitions. [2025-02-06 18:58:19,586 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-02-06 18:58:19,587 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-02-06 18:58:19,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2025-02-06 18:58:19,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 18:58:19,588 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2025-02-06 18:58:19,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2025-02-06 18:58:19,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-02-06 18:58:19,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 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-02-06 18:58:19,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2025-02-06 18:58:19,605 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2025-02-06 18:58:19,605 INFO L432 stractBuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2025-02-06 18:58:19,605 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-06 18:58:19,605 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2025-02-06 18:58:19,606 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-02-06 18:58:19,607 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 18:58:19,607 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 18:58:19,607 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-06 18:58:19,607 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-06 18:58:19,607 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#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#1(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#0(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#3(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#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" [2025-02-06 18:58:19,607 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#2(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#0(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#3(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#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" [2025-02-06 18:58:19,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:58:19,609 INFO L85 PathProgramCache]: Analyzing trace with hash 44819530, now seen corresponding path program 1 times [2025-02-06 18:58:19,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:58:19,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259067021] [2025-02-06 18:58:19,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:58:19,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:58:19,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 18:58:19,647 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-02-06 18:58:19,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 18:58:19,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:19,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:58:19,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:58:19,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:58:19,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259067021] [2025-02-06 18:58:19,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259067021] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:58:19,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:58:19,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:58:19,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926204846] [2025-02-06 18:58:19,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:58:19,785 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 18:58:19,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:58:19,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1086342, now seen corresponding path program 1 times [2025-02-06 18:58:19,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:58:19,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787188470] [2025-02-06 18:58:19,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:58:19,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:58:19,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 18:58:19,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 18:58:19,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:19,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:19,791 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:58:19,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 18:58:19,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 18:58:19,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:19,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:19,795 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:58:19,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:58:19,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:58:19,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:58:19,901 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:58:19,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:58:19,922 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2025-02-06 18:58:19,922 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2025-02-06 18:58:19,922 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-02-06 18:58:19,923 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 18 states and 22 transitions. [2025-02-06 18:58:19,923 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-02-06 18:58:19,924 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-02-06 18:58:19,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 22 transitions. [2025-02-06 18:58:19,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 18:58:19,924 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-02-06 18:58:19,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 22 transitions. [2025-02-06 18:58:19,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2025-02-06 18:58:19,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:58:19,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2025-02-06 18:58:19,926 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2025-02-06 18:58:19,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:58:19,927 INFO L432 stractBuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2025-02-06 18:58:19,927 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-06 18:58:19,927 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2025-02-06 18:58:19,927 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-02-06 18:58:19,927 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 18:58:19,927 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 18:58:19,928 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2025-02-06 18:58:19,928 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2025-02-06 18:58:19,928 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#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#1(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#0(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#3(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#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#0(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#3(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#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" [2025-02-06 18:58:19,928 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#2(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#0(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#3(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#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#0(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#3(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#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" [2025-02-06 18:58:19,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:58:19,928 INFO L85 PathProgramCache]: Analyzing trace with hash -516345915, now seen corresponding path program 1 times [2025-02-06 18:58:19,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:58:19,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602488623] [2025-02-06 18:58:19,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:58:19,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:58:19,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 18:58:19,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 18:58:19,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:19,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:19,962 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:58:19,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 18:58:19,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 18:58:19,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:19,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:19,973 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:58:19,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:58:19,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1996658935, now seen corresponding path program 1 times [2025-02-06 18:58:19,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:58:19,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769815092] [2025-02-06 18:58:19,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:58:19,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:58:19,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:58:19,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:58:19,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:19,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:19,978 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:58:19,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:58:19,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:58:19,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:19,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:19,982 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:58:19,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:58:19,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1699197637, now seen corresponding path program 1 times [2025-02-06 18:58:19,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:58:19,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497147850] [2025-02-06 18:58:19,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:58:19,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:58:19,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 18:58:20,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 18:58:20,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:20,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:20,002 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:58:20,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 18:58:20,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 18:58:20,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:20,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:20,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:58:21,049 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 18:58:21,049 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 18:58:21,049 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 18:58:21,049 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 18:58:21,049 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 18:58:21,049 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:21,049 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 18:58:21,049 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 18:58:21,049 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration3_Lasso [2025-02-06 18:58:21,049 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 18:58:21,049 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 18:58:21,051 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:21,056 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:21,494 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:21,495 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:21,496 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:21,752 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 18:58:21,752 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 18:58:21,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:21,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:21,755 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:21,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-02-06 18:58:21,756 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 18:58:21,766 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 18:58:21,766 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 18:58:21,766 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 18:58:21,766 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 18:58:21,766 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 18:58:21,767 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 18:58:21,767 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 18:58:21,768 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 18:58:21,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-02-06 18:58:21,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:21,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:21,776 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:21,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-02-06 18:58:21,778 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 18:58:21,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 18:58:21,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 18:58:21,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 18:58:21,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 18:58:21,789 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 18:58:21,789 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 18:58:21,791 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 18:58:21,797 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-02-06 18:58:21,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:21,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:21,799 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:21,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-02-06 18:58:21,801 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 18:58:21,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 18:58:21,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 18:58:21,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 18:58:21,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 18:58:21,814 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 18:58:21,814 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 18:58:21,818 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 18:58:21,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-02-06 18:58:21,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:21,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:21,826 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:21,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-02-06 18:58:21,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-02-06 18:58:21,839 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 18:58:21,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 18:58:21,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 18:58:21,839 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 18:58:21,841 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 18:58:21,841 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 18:58:21,843 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 18:58:21,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-02-06 18:58:21,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:21,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:21,851 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:21,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-02-06 18:58:21,854 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 18:58:21,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 18:58:21,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 18:58:21,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 18:58:21,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 18:58:21,865 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 18:58:21,865 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 18:58:21,868 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 18:58:21,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-02-06 18:58:21,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:21,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:21,875 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:21,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-02-06 18:58:21,876 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 18:58:21,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 18:58:21,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 18:58:21,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 18:58:21,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 18:58:21,888 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 18:58:21,888 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 18:58:21,892 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 18:58:21,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-02-06 18:58:21,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:21,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:21,899 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:21,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-02-06 18:58:21,901 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 18:58:21,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 18:58:21,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 18:58:21,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 18:58:21,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 18:58:21,915 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 18:58:21,915 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 18:58:21,918 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 18:58:21,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-02-06 18:58:21,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:21,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:21,925 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:21,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-02-06 18:58:21,927 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 18:58:21,936 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 18:58:21,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 18:58:21,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 18:58:21,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 18:58:21,938 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 18:58:21,938 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 18:58:21,942 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 18:58:21,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-02-06 18:58:21,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:21,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:21,949 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:21,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-02-06 18:58:21,952 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 18:58:21,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 18:58:21,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 18:58:21,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 18:58:21,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 18:58:21,964 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 18:58:21,964 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 18:58:21,967 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 18:58:21,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-02-06 18:58:21,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:21,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:21,976 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:21,993 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 18:58:21,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-02-06 18:58:22,004 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 18:58:22,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 18:58:22,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 18:58:22,004 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 18:58:22,006 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 18:58:22,006 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 18:58:22,008 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 18:58:22,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-02-06 18:58:22,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:22,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:22,016 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:22,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-02-06 18:58:22,018 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 18:58:22,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 18:58:22,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 18:58:22,027 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 18:58:22,027 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 18:58:22,030 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 18:58:22,030 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 18:58:22,034 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 18:58:22,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-02-06 18:58:22,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:22,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:22,041 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:22,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-02-06 18:58:22,043 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 18:58:22,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 18:58:22,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 18:58:22,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 18:58:22,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 18:58:22,053 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 18:58:22,053 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 18:58:22,056 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 18:58:22,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-02-06 18:58:22,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:22,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:22,064 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:22,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-02-06 18:58:22,066 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 18:58:22,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 18:58:22,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 18:58:22,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 18:58:22,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 18:58:22,078 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 18:58:22,078 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 18:58:22,082 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 18:58:22,088 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-02-06 18:58:22,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:22,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:22,089 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:22,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-02-06 18:58:22,091 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 18:58:22,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 18:58:22,100 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 18:58:22,100 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 18:58:22,100 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 18:58:22,103 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 18:58:22,103 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 18:58:22,108 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 18:58:22,118 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-02-06 18:58:22,118 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-02-06 18:58:22,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:22,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:22,120 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:22,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-02-06 18:58:22,122 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 18:58:22,133 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 18:58:22,133 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 18:58:22,133 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-02-06 18:58:22,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-02-06 18:58:22,227 INFO L156 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2025-02-06 18:58:22,229 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~mem6 [2025-02-06 18:58:22,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:58:22,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 18:58:22,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 18:58:22,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:22,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:58:22,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 18:58:22,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:58:22,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:58:22,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:58:22,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:22,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:58:22,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 18:58:22,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:58:22,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 18:58:22,344 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 18:58:22,344 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-06 18:58:22,345 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:58:22,358 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 31 states and 41 transitions. Complement of second has 5 states. [2025-02-06 18:58:22,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-02-06 18:58:22,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:58:22,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2025-02-06 18:58:22,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 8 letters. Loop has 7 letters. [2025-02-06 18:58:22,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 18:58:22,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 15 letters. Loop has 7 letters. [2025-02-06 18:58:22,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 18:58:22,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 8 letters. Loop has 14 letters. [2025-02-06 18:58:22,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 18:58:22,360 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 41 transitions. [2025-02-06 18:58:22,361 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2025-02-06 18:58:22,361 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 41 transitions. [2025-02-06 18:58:22,361 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2025-02-06 18:58:22,361 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2025-02-06 18:58:22,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 41 transitions. [2025-02-06 18:58:22,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 18:58:22,361 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 41 transitions. [2025-02-06 18:58:22,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 41 transitions. [2025-02-06 18:58:22,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2025-02-06 18:58:22,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 26 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:58:22,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2025-02-06 18:58:22,363 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 36 transitions. [2025-02-06 18:58:22,363 INFO L432 stractBuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2025-02-06 18:58:22,364 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-06 18:58:22,364 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 36 transitions. [2025-02-06 18:58:22,364 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2025-02-06 18:58:22,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 18:58:22,364 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 18:58:22,364 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2025-02-06 18:58:22,365 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-06 18:58:22,365 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#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#1(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#0(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#3(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#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#0(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#3(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#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(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#2(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);" [2025-02-06 18:58:22,365 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem4#1 := read~int#0(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#3(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#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" [2025-02-06 18:58:22,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:58:22,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1173145824, now seen corresponding path program 2 times [2025-02-06 18:58:22,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:58:22,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255624480] [2025-02-06 18:58:22,365 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:58:22,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:58:22,375 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-02-06 18:58:22,394 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 18:58:22,395 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 18:58:22,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:22,395 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:58:22,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 18:58:22,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 18:58:22,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:22,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:22,416 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:58:22,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:58:22,417 INFO L85 PathProgramCache]: Analyzing trace with hash 43652, now seen corresponding path program 2 times [2025-02-06 18:58:22,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:58:22,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444403134] [2025-02-06 18:58:22,417 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:58:22,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:58:22,422 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-02-06 18:58:22,423 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 18:58:22,423 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 18:58:22,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:22,423 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:58:22,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 18:58:22,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 18:58:22,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:22,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:22,427 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:58:22,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:58:22,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1038369093, now seen corresponding path program 3 times [2025-02-06 18:58:22,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:58:22,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039880170] [2025-02-06 18:58:22,429 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 18:58:22,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:58:22,439 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 12 statements into 3 equivalence classes. [2025-02-06 18:58:22,455 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 18:58:22,455 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 18:58:22,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:22,455 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:58:22,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 18:58:22,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 18:58:22,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:22,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:22,469 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:58:23,673 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 18:58:23,673 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 18:58:23,673 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 18:58:23,673 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 18:58:23,673 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 18:58:23,673 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:23,673 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 18:58:23,673 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 18:58:23,673 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration4_Lasso [2025-02-06 18:58:23,673 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 18:58:23,673 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 18:58:23,674 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:23,678 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:23,680 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:23,681 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:23,683 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:23,684 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:24,002 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-02-06 18:58:24,269 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 18:58:24,270 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 18:58:24,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:24,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:24,272 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:24,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-02-06 18:58:24,274 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 18:58:24,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 18:58:24,284 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 18:58:24,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 18:58:24,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 18:58:24,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 18:58:24,284 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 18:58:24,284 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 18:58:24,285 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 18:58:24,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-02-06 18:58:24,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:24,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:24,292 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:24,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-02-06 18:58:24,293 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 18:58:24,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 18:58:24,303 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 18:58:24,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 18:58:24,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 18:58:24,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 18:58:24,303 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 18:58:24,303 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 18:58:24,304 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 18:58:24,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-02-06 18:58:24,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:24,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:24,311 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:24,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-02-06 18:58:24,312 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 18:58:24,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 18:58:24,322 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 18:58:24,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 18:58:24,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 18:58:24,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 18:58:24,322 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 18:58:24,322 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 18:58:24,323 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 18:58:24,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-02-06 18:58:24,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:24,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:24,330 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:24,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-02-06 18:58:24,331 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 18:58:24,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 18:58:24,340 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 18:58:24,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 18:58:24,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 18:58:24,341 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 18:58:24,341 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 18:58:24,341 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 18:58:24,342 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 18:58:24,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-02-06 18:58:24,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:24,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:24,349 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:24,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-02-06 18:58:24,351 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 18:58:24,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 18:58:24,361 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 18:58:24,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 18:58:24,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 18:58:24,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 18:58:24,361 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 18:58:24,361 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 18:58:24,362 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 18:58:24,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-02-06 18:58:24,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:24,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:24,370 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:24,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-02-06 18:58:24,372 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 18:58:24,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 18:58:24,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 18:58:24,382 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 18:58:24,382 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 18:58:24,383 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 18:58:24,383 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 18:58:24,386 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 18:58:24,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-02-06 18:58:24,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:24,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:24,394 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:24,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-02-06 18:58:24,396 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 18:58:24,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 18:58:24,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 18:58:24,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 18:58:24,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 18:58:24,407 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 18:58:24,407 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 18:58:24,409 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 18:58:24,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-02-06 18:58:24,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:24,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:24,418 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:24,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-02-06 18:58:24,420 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 18:58:24,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 18:58:24,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 18:58:24,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 18:58:24,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 18:58:24,431 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 18:58:24,432 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 18:58:24,435 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 18:58:24,440 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-02-06 18:58:24,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:24,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:24,442 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:24,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-02-06 18:58:24,443 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 18:58:24,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 18:58:24,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 18:58:24,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 18:58:24,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 18:58:24,455 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 18:58:24,455 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 18:58:24,458 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 18:58:24,463 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-02-06 18:58:24,463 INFO L444 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-02-06 18:58:24,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:24,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:24,464 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:24,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-02-06 18:58:24,466 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 18:58:24,476 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 18:58:24,476 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 18:58:24,476 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#3 ULTIMATE.start_main_~x0~0#1.base) ULTIMATE.start_main_~x0~0#1.offset)_3) = -2*v_rep(select (select #memory_int#3 ULTIMATE.start_main_~x0~0#1.base) ULTIMATE.start_main_~x0~0#1.offset)_3 + 1 Supporting invariants [] [2025-02-06 18:58:24,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-02-06 18:58:24,541 INFO L156 tatePredicateManager]: 34 out of 34 supporting invariants were superfluous and have been removed [2025-02-06 18:58:24,542 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-02-06 18:58:24,542 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-02-06 18:58:24,542 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~x0~0!base,]]] [2025-02-06 18:58:24,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:58:24,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 18:58:24,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 18:58:24,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:24,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:58:24,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 18:58:24,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:58:24,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 18:58:24,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 18:58:24,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:24,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:58:24,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 18:58:24,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:58:24,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:58:24,597 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-06 18:58:24,597 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 36 transitions. cyclomatic complexity: 13 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:58:24,609 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 36 transitions. cyclomatic complexity: 13. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 61 states and 76 transitions. Complement of second has 7 states. [2025-02-06 18:58:24,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-06 18:58:24,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:58:24,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2025-02-06 18:58:24,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 9 letters. Loop has 3 letters. [2025-02-06 18:58:24,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 18:58:24,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 12 letters. Loop has 3 letters. [2025-02-06 18:58:24,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 18:58:24,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 9 letters. Loop has 6 letters. [2025-02-06 18:58:24,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 18:58:24,611 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 76 transitions. [2025-02-06 18:58:24,611 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2025-02-06 18:58:24,612 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 51 states and 64 transitions. [2025-02-06 18:58:24,612 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2025-02-06 18:58:24,612 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2025-02-06 18:58:24,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 64 transitions. [2025-02-06 18:58:24,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 18:58:24,612 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 64 transitions. [2025-02-06 18:58:24,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 64 transitions. [2025-02-06 18:58:24,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2025-02-06 18:58:24,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 46 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-02-06 18:58:24,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2025-02-06 18:58:24,614 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47 states and 60 transitions. [2025-02-06 18:58:24,615 INFO L432 stractBuchiCegarLoop]: Abstraction has 47 states and 60 transitions. [2025-02-06 18:58:24,615 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-06 18:58:24,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 60 transitions. [2025-02-06 18:58:24,615 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2025-02-06 18:58:24,615 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 18:58:24,615 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 18:58:24,615 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2025-02-06 18:58:24,615 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2025-02-06 18:58:24,615 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#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#1(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#0(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#3(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#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#0(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#3(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#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(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#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" [2025-02-06 18:58:24,615 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 == main_#t~mem7#1;havoc main_#t~mem7#1;call write~int#1(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#0(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#3(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#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#0(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#3(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#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(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#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4);" [2025-02-06 18:58:24,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:58:24,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1173145827, now seen corresponding path program 1 times [2025-02-06 18:58:24,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:58:24,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102958683] [2025-02-06 18:58:24,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:58:24,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:58:24,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 18:58:24,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 18:58:24,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:24,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:58:24,691 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 18:58:24,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:58:24,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102958683] [2025-02-06 18:58:24,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102958683] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:58:24,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:58:24,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:58:24,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677623815] [2025-02-06 18:58:24,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:58:24,691 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 18:58:24,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:58:24,691 INFO L85 PathProgramCache]: Analyzing trace with hash -24074498, now seen corresponding path program 1 times [2025-02-06 18:58:24,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:58:24,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046148917] [2025-02-06 18:58:24,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:58:24,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:58:24,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 18:58:24,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 18:58:24,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:24,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:24,697 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:58:24,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 18:58:24,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 18:58:24,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:24,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:24,702 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:58:24,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:58:24,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:58:24,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:58:24,885 INFO L87 Difference]: Start difference. First operand 47 states and 60 transitions. cyclomatic complexity: 20 Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:58:24,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:58:24,897 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2025-02-06 18:58:24,897 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 49 transitions. [2025-02-06 18:58:24,897 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2025-02-06 18:58:24,898 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 49 transitions. [2025-02-06 18:58:24,898 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2025-02-06 18:58:24,898 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2025-02-06 18:58:24,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 49 transitions. [2025-02-06 18:58:24,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 18:58:24,898 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 49 transitions. [2025-02-06 18:58:24,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 49 transitions. [2025-02-06 18:58:24,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-02-06 18:58:24,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.225) internal successors, (49), 39 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:58:24,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2025-02-06 18:58:24,900 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 49 transitions. [2025-02-06 18:58:24,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:58:24,900 INFO L432 stractBuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2025-02-06 18:58:24,900 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-06 18:58:24,900 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 49 transitions. [2025-02-06 18:58:24,901 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2025-02-06 18:58:24,901 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 18:58:24,901 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 18:58:24,901 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 2, 1, 1] [2025-02-06 18:58:24,901 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-06 18:58:24,901 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#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#1(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#0(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#3(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#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#0(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#3(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#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(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#2(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#0(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#3(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#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#0(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#3(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#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(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#2(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);" [2025-02-06 18:58:24,901 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem4#1 := read~int#0(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#3(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#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" [2025-02-06 18:58:24,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:58:24,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1135519200, now seen corresponding path program 4 times [2025-02-06 18:58:24,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:58:24,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395296448] [2025-02-06 18:58:24,902 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 18:58:24,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:58:24,909 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-02-06 18:58:24,913 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 18:58:24,913 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 18:58:24,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:58:25,035 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 18:58:25,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:58:25,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395296448] [2025-02-06 18:58:25,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395296448] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:58:25,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591109445] [2025-02-06 18:58:25,036 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 18:58:25,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:58:25,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:25,038 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:58:25,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-02-06 18:58:25,078 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-02-06 18:58:25,095 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 18:58:25,095 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 18:58:25,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:58:25,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 18:58:25,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:58:25,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 18:58:25,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 18:58:25,126 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 18:58:25,126 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:58:25,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591109445] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:58:25,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:58:25,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-02-06 18:58:25,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792334516] [2025-02-06 18:58:25,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:58:25,127 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 18:58:25,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:58:25,128 INFO L85 PathProgramCache]: Analyzing trace with hash 43652, now seen corresponding path program 3 times [2025-02-06 18:58:25,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:58:25,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186515151] [2025-02-06 18:58:25,128 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 18:58:25,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:58:25,130 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-02-06 18:58:25,132 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 18:58:25,132 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 18:58:25,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:25,132 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:58:25,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 18:58:25,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 18:58:25,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:25,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:25,136 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:58:25,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:58:25,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:58:25,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 18:58:25,176 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. cyclomatic complexity: 14 Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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-02-06 18:58:25,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:58:25,191 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2025-02-06 18:58:25,191 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 36 transitions. [2025-02-06 18:58:25,191 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2025-02-06 18:58:25,192 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 36 transitions. [2025-02-06 18:58:25,192 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2025-02-06 18:58:25,192 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2025-02-06 18:58:25,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 36 transitions. [2025-02-06 18:58:25,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 18:58:25,192 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 36 transitions. [2025-02-06 18:58:25,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 36 transitions. [2025-02-06 18:58:25,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2025-02-06 18:58:25,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:58:25,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2025-02-06 18:58:25,193 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 35 transitions. [2025-02-06 18:58:25,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:58:25,194 INFO L432 stractBuchiCegarLoop]: Abstraction has 30 states and 35 transitions. [2025-02-06 18:58:25,194 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-06 18:58:25,194 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 35 transitions. [2025-02-06 18:58:25,194 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2025-02-06 18:58:25,194 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 18:58:25,194 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 18:58:25,194 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1] [2025-02-06 18:58:25,194 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 2, 2, 1, 1, 1] [2025-02-06 18:58:25,195 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#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#1(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#0(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#3(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#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#0(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#3(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#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(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#2(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#0(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#3(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#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#0(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#3(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#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" [2025-02-06 18:58:25,195 INFO L754 eck$LassoCheckResult]: Loop: "assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(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#1(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#0(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#3(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#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#0(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#3(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#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(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#2(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#0(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#3(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#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#0(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#3(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#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4);" [2025-02-06 18:58:25,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:58:25,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1699197637, now seen corresponding path program 5 times [2025-02-06 18:58:25,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:58:25,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334427977] [2025-02-06 18:58:25,195 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 18:58:25,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:58:25,213 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 15 statements into 4 equivalence classes. [2025-02-06 18:58:25,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-02-06 18:58:25,227 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 18:58:25,228 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-02-06 18:58:25,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:25,228 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:58:25,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 18:58:25,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 18:58:25,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:25,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:25,236 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:58:25,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:58:25,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1776752198, now seen corresponding path program 1 times [2025-02-06 18:58:25,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:58:25,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085072031] [2025-02-06 18:58:25,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:58:25,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:58:25,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 18:58:25,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 18:58:25,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:25,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:25,243 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:58:25,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 18:58:25,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 18:58:25,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:25,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:25,247 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:58:25,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:58:25,248 INFO L85 PathProgramCache]: Analyzing trace with hash 229835522, now seen corresponding path program 1 times [2025-02-06 18:58:25,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:58:25,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603359191] [2025-02-06 18:58:25,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:58:25,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:58:25,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 18:58:25,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 18:58:25,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:25,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:25,269 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:58:25,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 18:58:25,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 18:58:25,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:25,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:25,280 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:58:26,848 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 18:58:26,848 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 18:58:26,848 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 18:58:26,848 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 18:58:26,848 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 18:58:26,848 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:26,848 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 18:58:26,848 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 18:58:26,848 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration7_Lasso [2025-02-06 18:58:26,848 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 18:58:26,849 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 18:58:26,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:26,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:26,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:26,855 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:27,284 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:27,552 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 18:58:27,552 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 18:58:27,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:27,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:27,554 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:27,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-02-06 18:58:27,555 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 18:58:27,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 18:58:27,565 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 18:58:27,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 18:58:27,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 18:58:27,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 18:58:27,565 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 18:58:27,565 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 18:58:27,567 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 18:58:27,573 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-02-06 18:58:27,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:27,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:27,575 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:27,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-02-06 18:58:27,576 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 18:58:27,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 18:58:27,586 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 18:58:27,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 18:58:27,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 18:58:27,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 18:58:27,586 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 18:58:27,586 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 18:58:27,587 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 18:58:27,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2025-02-06 18:58:27,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:27,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:27,594 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:27,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-02-06 18:58:27,596 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 18:58:27,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 18:58:27,606 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 18:58:27,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 18:58:27,606 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 18:58:27,606 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 18:58:27,607 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 18:58:27,607 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 18:58:27,607 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 18:58:27,613 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-02-06 18:58:27,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:27,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:27,615 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:27,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-02-06 18:58:27,616 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 18:58:27,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 18:58:27,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 18:58:27,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 18:58:27,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 18:58:27,628 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 18:58:27,628 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 18:58:27,631 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 18:58:27,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-02-06 18:58:27,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:27,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:27,639 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:27,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-02-06 18:58:27,641 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 18:58:27,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 18:58:27,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 18:58:27,651 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-06 18:58:27,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 18:58:27,658 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-02-06 18:58:27,658 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-02-06 18:58:27,670 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 18:58:27,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-02-06 18:58:27,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:27,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:27,677 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:27,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-02-06 18:58:27,679 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 18:58:27,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 18:58:27,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 18:58:27,689 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 18:58:27,689 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 18:58:27,690 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 18:58:27,690 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 18:58:27,694 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 18:58:27,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2025-02-06 18:58:27,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:27,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:27,706 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:27,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-02-06 18:58:27,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-02-06 18:58:27,719 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 18:58:27,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 18:58:27,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 18:58:27,719 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 18:58:27,723 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 18:58:27,723 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 18:58:27,730 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 18:58:27,736 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-02-06 18:58:27,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:27,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:27,738 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:27,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-02-06 18:58:27,739 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 18:58:27,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 18:58:27,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 18:58:27,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 18:58:27,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 18:58:27,751 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 18:58:27,751 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 18:58:27,755 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 18:58:27,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-02-06 18:58:27,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:27,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:27,762 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:27,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-02-06 18:58:27,763 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 18:58:27,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 18:58:27,773 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 18:58:27,773 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 18:58:27,773 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 18:58:27,775 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 18:58:27,775 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 18:58:27,778 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 18:58:27,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-02-06 18:58:27,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:27,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:27,786 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:27,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-02-06 18:58:27,789 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 18:58:27,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 18:58:27,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 18:58:27,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 18:58:27,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 18:58:27,800 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 18:58:27,800 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 18:58:27,802 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 18:58:27,807 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-02-06 18:58:27,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:27,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:27,809 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:27,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-02-06 18:58:27,811 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 18:58:27,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 18:58:27,820 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 18:58:27,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 18:58:27,820 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 18:58:27,822 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 18:58:27,822 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 18:58:27,825 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 18:58:27,831 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-02-06 18:58:27,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:27,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:27,832 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-02-06 18:58:27,833 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-02-06 18:58:27,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 18:58:27,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 18:58:27,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 18:58:27,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 18:58:27,844 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 18:58:27,845 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 18:58:27,846 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 18:58:27,849 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 18:58:27,854 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-02-06 18:58:27,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:27,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:27,856 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:27,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-02-06 18:58:27,858 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 18:58:27,868 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 18:58:27,868 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 18:58:27,868 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 18:58:27,868 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 18:58:27,870 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 18:58:27,870 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 18:58:27,874 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 18:58:27,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2025-02-06 18:58:27,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:27,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:27,881 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:27,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-02-06 18:58:27,883 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 18:58:27,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 18:58:27,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 18:58:27,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 18:58:27,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 18:58:27,894 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 18:58:27,894 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 18:58:27,897 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 18:58:27,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2025-02-06 18:58:27,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:27,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:27,904 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:27,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-02-06 18:58:27,906 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 18:58:27,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 18:58:27,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 18:58:27,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 18:58:27,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 18:58:27,917 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 18:58:27,917 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 18:58:27,921 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 18:58:27,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-02-06 18:58:27,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:27,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:27,928 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:27,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-02-06 18:58:27,930 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 18:58:27,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 18:58:27,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 18:58:27,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 18:58:27,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 18:58:27,941 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 18:58:27,941 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 18:58:27,943 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 18:58:27,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2025-02-06 18:58:27,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:27,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:27,950 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:27,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-02-06 18:58:27,952 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 18:58:27,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 18:58:27,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 18:58:27,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 18:58:27,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 18:58:27,962 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 18:58:27,962 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 18:58:27,965 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 18:58:27,969 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-06 18:58:27,969 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2025-02-06 18:58:27,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:27,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:27,972 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:27,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-02-06 18:58:27,973 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 18:58:27,983 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 18:58:27,983 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 18:58:27,983 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x2~0#1.base) ULTIMATE.start_main_~x2~0#1.offset)_4) = -2*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x2~0#1.base) ULTIMATE.start_main_~x2~0#1.offset)_4 + 1 Supporting invariants [] [2025-02-06 18:58:27,989 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-02-06 18:58:28,059 INFO L156 tatePredicateManager]: 38 out of 38 supporting invariants were superfluous and have been removed [2025-02-06 18:58:28,061 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-02-06 18:58:28,061 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-02-06 18:58:28,061 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~x2~0!base,]]] [2025-02-06 18:58:28,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:58:28,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 18:58:28,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 18:58:28,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:28,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:58:28,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 18:58:28,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:58:28,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 18:58:28,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 18:58:28,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:28,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:58:28,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 18:58:28,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:58:28,138 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 34 treesize of output 11 [2025-02-06 18:58:28,182 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-06 18:58:28,183 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-02-06 18:58:28,183 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 35 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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-02-06 18:58:28,200 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 35 transitions. cyclomatic complexity: 8. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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) Result 65 states and 77 transitions. Complement of second has 7 states. [2025-02-06 18:58:28,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-06 18:58:28,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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-02-06 18:58:28,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2025-02-06 18:58:28,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 15 letters. Loop has 15 letters. [2025-02-06 18:58:28,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 18:58:28,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 30 letters. Loop has 15 letters. [2025-02-06 18:58:28,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 18:58:28,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 15 letters. Loop has 30 letters. [2025-02-06 18:58:28,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 18:58:28,203 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 77 transitions. [2025-02-06 18:58:28,203 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2025-02-06 18:58:28,204 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 65 states and 77 transitions. [2025-02-06 18:58:28,204 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2025-02-06 18:58:28,204 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2025-02-06 18:58:28,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 77 transitions. [2025-02-06 18:58:28,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 18:58:28,204 INFO L218 hiAutomatonCegarLoop]: Abstraction has 65 states and 77 transitions. [2025-02-06 18:58:28,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 77 transitions. [2025-02-06 18:58:28,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-02-06 18:58:28,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 64 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:58:28,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2025-02-06 18:58:28,207 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65 states and 77 transitions. [2025-02-06 18:58:28,207 INFO L432 stractBuchiCegarLoop]: Abstraction has 65 states and 77 transitions. [2025-02-06 18:58:28,207 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-02-06 18:58:28,207 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 77 transitions. [2025-02-06 18:58:28,208 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2025-02-06 18:58:28,208 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 18:58:28,208 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 18:58:28,208 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1, 1] [2025-02-06 18:58:28,208 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 2, 2, 1, 1, 1] [2025-02-06 18:58:28,208 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#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#1(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#0(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#3(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#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#0(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#3(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#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(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#2(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#0(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#3(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#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#0(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#3(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#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(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#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(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#1(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(1, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" [2025-02-06 18:58:28,209 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem4#1 := read~int#0(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#3(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#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#0(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#3(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#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(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#2(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#0(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#3(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#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#0(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#3(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#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(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#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(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#1(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);" [2025-02-06 18:58:28,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:58:28,209 INFO L85 PathProgramCache]: Analyzing trace with hash 841356932, now seen corresponding path program 1 times [2025-02-06 18:58:28,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:58:28,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231472325] [2025-02-06 18:58:28,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:58:28,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:58:28,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 18:58:28,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 18:58:28,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:28,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:58:28,286 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-06 18:58:28,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:58:28,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231472325] [2025-02-06 18:58:28,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231472325] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:58:28,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:58:28,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:58:28,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074573249] [2025-02-06 18:58:28,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:58:28,286 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 18:58:28,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:58:28,286 INFO L85 PathProgramCache]: Analyzing trace with hash -624921022, now seen corresponding path program 2 times [2025-02-06 18:58:28,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:58:28,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307761782] [2025-02-06 18:58:28,287 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:58:28,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:58:28,309 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-02-06 18:58:28,312 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 18:58:28,312 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 18:58:28,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:28,312 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:58:28,312 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-02-06 18:58:28,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 18:58:28,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 18:58:28,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:28,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:28,317 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:58:28,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:58:28,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:58:28,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:58:28,675 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. cyclomatic complexity: 19 Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:58:28,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:58:28,686 INFO L93 Difference]: Finished difference Result 84 states and 97 transitions. [2025-02-06 18:58:28,687 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 97 transitions. [2025-02-06 18:58:28,687 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 36 [2025-02-06 18:58:28,688 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 76 states and 88 transitions. [2025-02-06 18:58:28,688 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2025-02-06 18:58:28,688 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2025-02-06 18:58:28,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 88 transitions. [2025-02-06 18:58:28,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 18:58:28,688 INFO L218 hiAutomatonCegarLoop]: Abstraction has 76 states and 88 transitions. [2025-02-06 18:58:28,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 88 transitions. [2025-02-06 18:58:28,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2025-02-06 18:58:28,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 74 states have (on average 1.162162162162162) internal successors, (86), 73 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:58:28,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions. [2025-02-06 18:58:28,690 INFO L240 hiAutomatonCegarLoop]: Abstraction has 74 states and 86 transitions. [2025-02-06 18:58:28,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:58:28,691 INFO L432 stractBuchiCegarLoop]: Abstraction has 74 states and 86 transitions. [2025-02-06 18:58:28,691 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-02-06 18:58:28,691 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 86 transitions. [2025-02-06 18:58:28,691 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 36 [2025-02-06 18:58:28,691 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 18:58:28,691 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 18:58:28,692 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 3, 2, 1, 1, 1, 1, 1] [2025-02-06 18:58:28,692 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-06 18:58:28,692 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#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#1(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#0(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#3(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#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#0(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#3(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#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(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#2(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#0(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#3(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#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#0(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#3(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#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(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#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(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#1(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#0(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#3(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#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" [2025-02-06 18:58:28,692 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem4#1 := read~int#0(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#3(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#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" [2025-02-06 18:58:28,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:58:28,692 INFO L85 PathProgramCache]: Analyzing trace with hash -564794174, now seen corresponding path program 2 times [2025-02-06 18:58:28,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:58:28,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283383448] [2025-02-06 18:58:28,692 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:58:28,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:58:28,701 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-02-06 18:58:28,710 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 18:58:28,711 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 18:58:28,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:28,711 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:58:28,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 18:58:28,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 18:58:28,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:28,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:28,724 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:58:28,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:58:28,724 INFO L85 PathProgramCache]: Analyzing trace with hash 43652, now seen corresponding path program 4 times [2025-02-06 18:58:28,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:58:28,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582209529] [2025-02-06 18:58:28,724 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 18:58:28,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:58:28,729 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-02-06 18:58:28,729 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 18:58:28,730 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 18:58:28,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:28,731 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:58:28,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 18:58:28,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 18:58:28,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:28,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:28,734 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:58:28,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:58:28,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1898641955, now seen corresponding path program 3 times [2025-02-06 18:58:28,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:58:28,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752327823] [2025-02-06 18:58:28,736 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 18:58:28,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:58:28,743 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 6 equivalence classes. [2025-02-06 18:58:28,750 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 8 of 23 statements. [2025-02-06 18:58:28,751 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 18:58:28,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:58:28,792 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-06 18:58:28,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:58:28,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752327823] [2025-02-06 18:58:28,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752327823] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:58:28,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:58:28,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:58:28,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416367245] [2025-02-06 18:58:28,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:58:28,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:58:28,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:58:28,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:58:28,840 INFO L87 Difference]: Start difference. First operand 74 states and 86 transitions. cyclomatic complexity: 18 Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:58:28,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:58:28,855 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2025-02-06 18:58:28,855 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 80 transitions. [2025-02-06 18:58:28,856 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2025-02-06 18:58:28,857 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 74 states and 76 transitions. [2025-02-06 18:58:28,857 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2025-02-06 18:58:28,857 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2025-02-06 18:58:28,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 76 transitions. [2025-02-06 18:58:28,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 18:58:28,857 INFO L218 hiAutomatonCegarLoop]: Abstraction has 74 states and 76 transitions. [2025-02-06 18:58:28,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 76 transitions. [2025-02-06 18:58:28,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 68. [2025-02-06 18:58:28,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 67 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:58:28,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2025-02-06 18:58:28,859 INFO L240 hiAutomatonCegarLoop]: Abstraction has 68 states and 70 transitions. [2025-02-06 18:58:28,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:58:28,860 INFO L432 stractBuchiCegarLoop]: Abstraction has 68 states and 70 transitions. [2025-02-06 18:58:28,860 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-02-06 18:58:28,860 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 70 transitions. [2025-02-06 18:58:28,861 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2025-02-06 18:58:28,861 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 18:58:28,861 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 18:58:28,862 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 4, 4, 2, 2, 1, 1, 1, 1] [2025-02-06 18:58:28,862 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 8, 4, 4, 2, 2, 1, 1] [2025-02-06 18:58:28,863 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#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#1(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#0(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#3(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#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#0(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#3(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#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(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#2(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#0(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#3(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#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#0(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#3(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#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(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#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(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#1(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#0(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#3(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#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#0(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#3(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#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(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#2(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#0(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#3(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#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#0(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#3(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#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(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#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(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#1(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(1, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" [2025-02-06 18:58:28,863 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem4#1 := read~int#0(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#3(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#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#0(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#3(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#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(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#2(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#0(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#3(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#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#0(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#3(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#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(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#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(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#1(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#0(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#3(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#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#0(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#3(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#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(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#2(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#0(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#3(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#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume true;call main_#t~mem4#1 := read~int#0(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#3(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#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(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#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(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#1(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(1, main_~x3~0#1.base, main_~x3~0#1.offset, 4);" [2025-02-06 18:58:28,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:58:28,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1828604801, now seen corresponding path program 1 times [2025-02-06 18:58:28,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:58:28,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228410969] [2025-02-06 18:58:28,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:58:28,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:58:28,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 18:58:28,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 18:58:28,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:28,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:28,886 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:58:28,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 18:58:28,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 18:58:28,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:28,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:28,898 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:58:28,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:58:28,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1437690398, now seen corresponding path program 1 times [2025-02-06 18:58:28,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:58:28,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718294675] [2025-02-06 18:58:28,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:58:28,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:58:28,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 18:58:28,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 18:58:28,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:28,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:28,911 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:58:28,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 18:58:28,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 18:58:28,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:28,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:28,922 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:58:28,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:58:28,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1843118434, now seen corresponding path program 2 times [2025-02-06 18:58:28,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:58:28,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533280364] [2025-02-06 18:58:28,922 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:58:28,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:58:28,937 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 2 equivalence classes. [2025-02-06 18:58:28,953 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 18:58:28,953 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 18:58:28,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:58:29,108 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 223 proven. 7 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-02-06 18:58:29,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:58:29,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533280364] [2025-02-06 18:58:29,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533280364] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:58:29,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027166631] [2025-02-06 18:58:29,109 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:58:29,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:58:29,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:29,111 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:58:29,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2025-02-06 18:58:29,205 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 2 equivalence classes. [2025-02-06 18:58:29,262 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 18:58:29,262 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 18:58:29,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:58:29,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 18:58:29,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:58:29,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 18:58:29,301 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 223 proven. 7 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-02-06 18:58:29,301 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:58:29,329 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 223 proven. 7 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-02-06 18:58:29,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027166631] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:58:29,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:58:29,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-02-06 18:58:29,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77745758] [2025-02-06 18:58:29,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:58:31,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:58:31,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:58:31,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:58:31,071 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. cyclomatic complexity: 4 Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:58:31,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:58:31,084 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2025-02-06 18:58:31,084 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 40 transitions. [2025-02-06 18:58:31,084 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-06 18:58:31,084 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 0 states and 0 transitions. [2025-02-06 18:58:31,084 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-06 18:58:31,084 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-06 18:58:31,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-06 18:58:31,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 18:58:31,084 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 18:58:31,085 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 18:58:31,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:58:31,085 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 18:58:31,085 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-02-06 18:58:31,085 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-06 18:58:31,085 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-06 18:58:31,085 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-06 18:58:31,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 06.02 06:58:31 BoogieIcfgContainer [2025-02-06 18:58:31,092 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-06 18:58:31,092 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 18:58:31,092 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 18:58:31,093 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 18:58:31,093 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:58:17" (3/4) ... [2025-02-06 18:58:31,095 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 18:58:31,095 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 18:58:31,096 INFO L158 Benchmark]: Toolchain (without parser) took 14271.29ms. Allocated memory was 167.8MB in the beginning and 369.1MB in the end (delta: 201.3MB). Free memory was 125.2MB in the beginning and 212.1MB in the end (delta: -86.9MB). Peak memory consumption was 110.3MB. Max. memory is 16.1GB. [2025-02-06 18:58:31,097 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 116.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 18:58:31,097 INFO L158 Benchmark]: CACSL2BoogieTranslator took 122.99ms. Allocated memory is still 167.8MB. Free memory was 125.2MB in the beginning and 114.4MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 18:58:31,097 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.43ms. Allocated memory is still 167.8MB. Free memory was 114.4MB in the beginning and 113.7MB in the end (delta: 715.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 18:58:31,097 INFO L158 Benchmark]: Boogie Preprocessor took 19.81ms. Allocated memory is still 167.8MB. Free memory was 113.7MB in the beginning and 112.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 18:58:31,097 INFO L158 Benchmark]: IcfgBuilder took 251.19ms. Allocated memory is still 167.8MB. Free memory was 112.3MB in the beginning and 98.4MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 18:58:31,097 INFO L158 Benchmark]: BuchiAutomizer took 13847.66ms. Allocated memory was 167.8MB in the beginning and 369.1MB in the end (delta: 201.3MB). Free memory was 98.4MB in the beginning and 212.1MB in the end (delta: -113.8MB). Peak memory consumption was 85.1MB. Max. memory is 16.1GB. [2025-02-06 18:58:31,097 INFO L158 Benchmark]: Witness Printer took 2.68ms. Allocated memory is still 369.1MB. Free memory was 212.1MB in the beginning and 212.1MB in the end (delta: 72.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 18:58:31,098 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.29ms. Allocated memory is still 201.3MB. Free memory is still 116.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 122.99ms. Allocated memory is still 167.8MB. Free memory was 125.2MB in the beginning and 114.4MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.43ms. Allocated memory is still 167.8MB. Free memory was 114.4MB in the beginning and 113.7MB in the end (delta: 715.1kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.81ms. Allocated memory is still 167.8MB. Free memory was 113.7MB in the beginning and 112.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 251.19ms. Allocated memory is still 167.8MB. Free memory was 112.3MB in the beginning and 98.4MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 13847.66ms. Allocated memory was 167.8MB in the beginning and 369.1MB in the end (delta: 201.3MB). Free memory was 98.4MB in the beginning and 212.1MB in the end (delta: -113.8MB). Peak memory consumption was 85.1MB. Max. memory is 16.1GB. * Witness Printer took 2.68ms. Allocated memory is still 369.1MB. Free memory was 212.1MB in the beginning and 212.1MB in the end (delta: 72.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~x0~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~mem6 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~x0~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~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 4 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 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.8s and 11 iterations. TraceHistogramMax:8. Analysis of lassos took 13.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 9. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 19 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: 22/22 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 49 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46 mSDsluCounter, 189 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 96 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 77 IncrementalHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 93 mSDtfsCounter, 77 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU4 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital266 mio100 ax100 hnf100 lsp99 ukn75 mio100 lsp24 div100 bol100 ite100 ukn100 eq164 hnf90 smp100 dnf101 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 32ms VariablesStem: 3 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 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-02-06 18:58:31,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Ended with exit code 0 [2025-02-06 18:58:31,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2025-02-06 18:58:31,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE