./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-linkedlists/ll_append-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-linkedlists/ll_append-alloca-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash a94e514ac338898e2e1e54a42b19ae4490ac5c412319209fc14736a6de9b7386 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 07:08:05,386 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 07:08:05,423 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-01-10 07:08:05,427 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 07:08:05,427 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 07:08:05,443 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 07:08:05,443 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 07:08:05,444 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 07:08:05,444 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 07:08:05,444 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 07:08:05,444 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 07:08:05,444 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 07:08:05,444 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 07:08:05,445 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-01-10 07:08:05,445 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-01-10 07:08:05,445 INFO L153 SettingsManager]: * Use old map elimination=false [2025-01-10 07:08:05,445 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-01-10 07:08:05,445 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-01-10 07:08:05,445 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-01-10 07:08:05,445 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 07:08:05,445 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-01-10 07:08:05,445 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 07:08:05,445 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 07:08:05,446 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-01-10 07:08:05,446 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-01-10 07:08:05,446 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-01-10 07:08:05,446 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 07:08:05,446 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 07:08:05,446 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-01-10 07:08:05,446 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 07:08:05,446 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 07:08:05,446 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 07:08:05,446 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 07:08:05,447 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 07:08:05,447 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 07:08:05,447 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-01-10 07:08:05,447 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 -> a94e514ac338898e2e1e54a42b19ae4490ac5c412319209fc14736a6de9b7386 [2025-01-10 07:08:05,646 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 07:08:05,654 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 07:08:05,655 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 07:08:05,656 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 07:08:05,656 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 07:08:05,657 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-linkedlists/ll_append-alloca-2.i [2025-01-10 07:08:06,919 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a5edc6e32/191876d96e634dab81164c158771ddc3/FLAG785a34c59 [2025-01-10 07:08:07,260 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 07:08:07,261 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-memory-linkedlists/ll_append-alloca-2.i [2025-01-10 07:08:07,270 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a5edc6e32/191876d96e634dab81164c158771ddc3/FLAG785a34c59 [2025-01-10 07:08:07,282 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a5edc6e32/191876d96e634dab81164c158771ddc3 [2025-01-10 07:08:07,284 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 07:08:07,285 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 07:08:07,287 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 07:08:07,290 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 07:08:07,294 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 07:08:07,295 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:08:07" (1/1) ... [2025-01-10 07:08:07,296 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@721add81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:08:07, skipping insertion in model container [2025-01-10 07:08:07,297 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:08:07" (1/1) ... [2025-01-10 07:08:07,331 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 07:08:07,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:08:07,597 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 07:08:07,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:08:07,669 INFO L204 MainTranslator]: Completed translation [2025-01-10 07:08:07,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:08:07 WrapperNode [2025-01-10 07:08:07,671 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 07:08:07,672 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 07:08:07,672 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 07:08:07,672 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 07:08:07,678 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:08:07" (1/1) ... [2025-01-10 07:08:07,687 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:08:07" (1/1) ... [2025-01-10 07:08:07,702 INFO L138 Inliner]: procedures = 115, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 38 [2025-01-10 07:08:07,702 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 07:08:07,703 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 07:08:07,703 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 07:08:07,703 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 07:08:07,708 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:08:07" (1/1) ... [2025-01-10 07:08:07,708 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:08:07" (1/1) ... [2025-01-10 07:08:07,710 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:08:07" (1/1) ... [2025-01-10 07:08:07,722 INFO L175 MemorySlicer]: Split 6 memory accesses to 1 slices as follows [6]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 3 writes are split as follows [3]. [2025-01-10 07:08:07,722 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:08:07" (1/1) ... [2025-01-10 07:08:07,722 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:08:07" (1/1) ... [2025-01-10 07:08:07,731 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:08:07" (1/1) ... [2025-01-10 07:08:07,732 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:08:07" (1/1) ... [2025-01-10 07:08:07,740 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:08:07" (1/1) ... [2025-01-10 07:08:07,741 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:08:07" (1/1) ... [2025-01-10 07:08:07,741 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:08:07" (1/1) ... [2025-01-10 07:08:07,742 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 07:08:07,743 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 07:08:07,743 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 07:08:07,743 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 07:08:07,744 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:08:07" (1/1) ... [2025-01-10 07:08:07,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:08:07,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:08:07,777 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:08:07,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-01-10 07:08:07,801 INFO L130 BoogieDeclarations]: Found specification of procedure new_ll [2025-01-10 07:08:07,801 INFO L138 BoogieDeclarations]: Found implementation of procedure new_ll [2025-01-10 07:08:07,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 07:08:07,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 07:08:07,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 07:08:07,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 07:08:07,803 INFO L130 BoogieDeclarations]: Found specification of procedure length [2025-01-10 07:08:07,803 INFO L138 BoogieDeclarations]: Found implementation of procedure length [2025-01-10 07:08:07,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 07:08:07,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 07:08:07,882 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 07:08:07,885 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 07:08:08,025 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-01-10 07:08:08,025 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 07:08:08,032 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 07:08:08,032 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-10 07:08:08,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:08:08 BoogieIcfgContainer [2025-01-10 07:08:08,033 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 07:08:08,033 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-01-10 07:08:08,034 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-01-10 07:08:08,038 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-01-10 07:08:08,039 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:08:08,039 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.01 07:08:07" (1/3) ... [2025-01-10 07:08:08,040 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d86cf5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:08:08, skipping insertion in model container [2025-01-10 07:08:08,040 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:08:08,040 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:08:07" (2/3) ... [2025-01-10 07:08:08,040 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d86cf5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:08:08, skipping insertion in model container [2025-01-10 07:08:08,040 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:08:08,040 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:08:08" (3/3) ... [2025-01-10 07:08:08,041 INFO L363 chiAutomizerObserver]: Analyzing ICFG ll_append-alloca-2.i [2025-01-10 07:08:08,079 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-01-10 07:08:08,079 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-01-10 07:08:08,079 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-01-10 07:08:08,080 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-01-10 07:08:08,080 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-01-10 07:08:08,080 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-01-10 07:08:08,080 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-01-10 07:08:08,080 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-01-10 07:08:08,084 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 28 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 07:08:08,099 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2025-01-10 07:08:08,100 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:08:08,100 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:08:08,105 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-01-10 07:08:08,105 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:08:08,105 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-01-10 07:08:08,105 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 28 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 07:08:08,106 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2025-01-10 07:08:08,107 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:08:08,107 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:08:08,107 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-01-10 07:08:08,107 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:08:08,112 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~nondet8#1, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1, main_~n~0#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~y_length~0#1;havoc main_#t~nondet8#1;main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;" "assume !(main_~n~0#1 < 1);" "call main_#t~ret9#1.base, main_#t~ret9#1.offset := new_ll(main_~n~0#1);"< [2025-01-10 07:08:08,112 INFO L754 eck$LassoCheckResult]: Loop: "~n := #in~n;" "assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int#0(~n, ~head~0.base, ~head~0.offset, 4);" "call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);"< [2025-01-10 07:08:08,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:08:08,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1418245, now seen corresponding path program 1 times [2025-01-10 07:08:08,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:08:08,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825696337] [2025-01-10 07:08:08,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:08:08,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:08:08,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:08:08,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:08:08,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:08:08,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:08:08,189 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:08:08,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:08:08,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:08:08,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:08:08,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:08:08,213 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:08:08,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:08:08,216 INFO L85 PathProgramCache]: Analyzing trace with hash 29968, now seen corresponding path program 1 times [2025-01-10 07:08:08,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:08:08,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301939041] [2025-01-10 07:08:08,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:08:08,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:08:08,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:08:08,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:08:08,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:08:08,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:08:08,245 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:08:08,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:08:08,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:08:08,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:08:08,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:08:08,261 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:08:08,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:08:08,264 INFO L85 PathProgramCache]: Analyzing trace with hash -698735988, now seen corresponding path program 1 times [2025-01-10 07:08:08,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:08:08,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983878841] [2025-01-10 07:08:08,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:08:08,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:08:08,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:08:08,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:08:08,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:08:08,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:08:08,289 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:08:08,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:08:08,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:08:08,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:08:08,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:08:08,314 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:08:08,951 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:08:08,952 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:08:08,952 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:08:08,953 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:08:08,953 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:08:08,953 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:08:08,953 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:08:08,953 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:08:08,954 INFO L132 ssoRankerPreferences]: Filename of dumped script: ll_append-alloca-2.i_Iteration1_Lasso [2025-01-10 07:08:08,954 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:08:08,954 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:08:08,964 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:08,969 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:08,972 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:08,974 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:08,977 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:08,980 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:08,983 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:08,985 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:08,988 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:08,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:08,992 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:08,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:08,996 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:08,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:09,046 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:09,049 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:09,050 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:09,052 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:09,055 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:09,057 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:09,059 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:09,061 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:09,063 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:09,065 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:09,067 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:09,069 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:09,071 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:09,072 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:09,074 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:09,076 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:09,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:09,080 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:09,083 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:09,085 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:09,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:09,088 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:09,089 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:09,091 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:09,093 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:08:09,254 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:08:09,256 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:08:09,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:08:09,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:08:09,260 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:08:09,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-01-10 07:08:09,262 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:08:09,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:08:09,273 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:08:09,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:08:09,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:08:09,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:08:09,276 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:08:09,276 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:08:09,278 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:08:09,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-01-10 07:08:09,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:08:09,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:08:09,287 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:08:09,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-01-10 07:08:09,289 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:08:09,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:08:09,299 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:08:09,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:08:09,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:08:09,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:08:09,300 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:08:09,300 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:08:09,305 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:08:09,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-01-10 07:08:09,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:08:09,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:08:09,322 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:08:09,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-01-10 07:08:09,323 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:08:09,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:08:09,346 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:08:09,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:08:09,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:08:09,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:08:09,346 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:08:09,347 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:08:09,351 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:08:09,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-01-10 07:08:09,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:08:09,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:08:09,362 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:08:09,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-01-10 07:08:09,363 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:08:09,374 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:08:09,374 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:08:09,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:08:09,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:08:09,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:08:09,376 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:08:09,376 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:08:09,380 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:08:09,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-01-10 07:08:09,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:08:09,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:08:09,393 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:08:09,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-01-10 07:08:09,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-01-10 07:08:09,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:08:09,407 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:08:09,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:08:09,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:08:09,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:08:09,407 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:08:09,407 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:08:09,410 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:08:09,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-01-10 07:08:09,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:08:09,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:08:09,419 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:08:09,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-01-10 07:08:09,422 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:08:09,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:08:09,433 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:08:09,433 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:08:09,433 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:08:09,433 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:08:09,433 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:08:09,433 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:08:09,437 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:08:09,443 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-01-10 07:08:09,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:08:09,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:08:09,446 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:08:09,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-01-10 07:08:09,449 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:08:09,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:08:09,459 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:08:09,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:08:09,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:08:09,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:08:09,460 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:08:09,460 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:08:09,461 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:08:09,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-01-10 07:08:09,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:08:09,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:08:09,469 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:08:09,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-01-10 07:08:09,472 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:08:09,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:08:09,483 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:08:09,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:08:09,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:08:09,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:08:09,483 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:08:09,483 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:08:09,485 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:08:09,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-01-10 07:08:09,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:08:09,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:08:09,493 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:08:09,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-01-10 07:08:09,496 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:08:09,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:08:09,506 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:08:09,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:08:09,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:08:09,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:08:09,507 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:08:09,507 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:08:09,508 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:08:09,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-01-10 07:08:09,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:08:09,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:08:09,516 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:08:09,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-01-10 07:08:09,519 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:08:09,540 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:08:09,540 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:08:09,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:08:09,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:08:09,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:08:09,541 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:08:09,541 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:08:09,542 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:08:09,548 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-01-10 07:08:09,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:08:09,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:08:09,550 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:08:09,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-01-10 07:08:09,553 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:08:09,563 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:08:09,563 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:08:09,564 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:08:09,564 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:08:09,564 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:08:09,564 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:08:09,565 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:08:09,566 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:08:09,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-01-10 07:08:09,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:08:09,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:08:09,574 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:08:09,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-01-10 07:08:09,577 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:08:09,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:08:09,587 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:08:09,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:08:09,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:08:09,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:08:09,588 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:08:09,588 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:08:09,590 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:08:09,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-01-10 07:08:09,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:08:09,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:08:09,600 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:08:09,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-01-10 07:08:09,603 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:08:09,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:08:09,613 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:08:09,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:08:09,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:08:09,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:08:09,614 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:08:09,614 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:08:09,615 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:08:09,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-01-10 07:08:09,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:08:09,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:08:09,623 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:08:09,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-01-10 07:08:09,626 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:08:09,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:08:09,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:08:09,636 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-01-10 07:08:09,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:08:09,642 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-01-10 07:08:09,642 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-01-10 07:08:09,652 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:08:09,672 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-01-10 07:08:09,674 INFO L444 ModelExtractionUtils]: 1 out of 11 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-01-10 07:08:09,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:08:09,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:08:09,678 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:08:09,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-01-10 07:08:09,681 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:08:09,695 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2025-01-10 07:08:09,695 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:08:09,696 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(new_ll_#in~n) = 1*new_ll_#in~n Supporting invariants [1*new_ll_#in~n >= 0] [2025-01-10 07:08:09,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-01-10 07:08:09,707 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-01-10 07:08:09,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:08:09,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:08:09,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:08:09,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:08:09,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:08:09,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 07:08:09,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:08:09,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:08:09,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-01-10 07:08:09,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:08:09,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:08:09,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:08:09,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 07:08:09,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:08:09,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:08:09,864 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2025-01-10 07:08:09,866 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 28 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:08:09,965 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 28 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4). Second operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 46 states and 55 transitions. Complement of second has 17 states. [2025-01-10 07:08:09,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2025-01-10 07:08:09,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:08:09,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2025-01-10 07:08:09,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 4 letters. Loop has 3 letters. [2025-01-10 07:08:09,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:08:09,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 7 letters. Loop has 3 letters. [2025-01-10 07:08:09,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:08:09,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 4 letters. Loop has 6 letters. [2025-01-10 07:08:09,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:08:09,980 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 55 transitions. [2025-01-10 07:08:09,983 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-01-10 07:08:09,988 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 30 states and 38 transitions. [2025-01-10 07:08:09,989 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2025-01-10 07:08:09,989 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2025-01-10 07:08:09,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 38 transitions. [2025-01-10 07:08:09,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:08:09,990 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 38 transitions. [2025-01-10 07:08:09,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 38 transitions. [2025-01-10 07:08:10,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2025-01-10 07:08:10,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 07:08:10,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2025-01-10 07:08:10,013 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 34 transitions. [2025-01-10 07:08:10,013 INFO L432 stractBuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2025-01-10 07:08:10,013 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-01-10 07:08:10,013 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 34 transitions. [2025-01-10 07:08:10,014 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-01-10 07:08:10,014 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:08:10,014 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:08:10,014 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:08:10,014 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:08:10,015 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~nondet8#1, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1, main_~n~0#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~y_length~0#1;havoc main_#t~nondet8#1;main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;" "assume !(main_~n~0#1 < 1);" "call main_#t~ret9#1.base, main_#t~ret9#1.offset := new_ll(main_~n~0#1);"< "~n := #in~n;" "assume 0 == ~n;#res.base, #res.offset := 0, 0;" "assume true;" >"#58#return;" "main_~x~0#1.base, main_~x~0#1.offset := main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;assume { :begin_inline_append } true;append_#in~x#1.base, append_#in~x#1.offset, append_#in~y#1.base, append_#in~y#1.offset := main_~x~0#1.base, main_~x~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;havoc append_#res#1.base, append_#res#1.offset;havoc append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_~x#1.base, append_~x#1.offset, append_~y#1.base, append_~y#1.offset, append_~s~0#1.base, append_~s~0#1.offset;append_~x#1.base, append_~x#1.offset := append_#in~x#1.base, append_#in~x#1.offset;append_~y#1.base, append_~y#1.offset := append_#in~y#1.base, append_#in~y#1.offset;" "assume !(append_~x#1.base == 0 && append_~x#1.offset == 0);append_~s~0#1.base, append_~s~0#1.offset := append_~x#1.base, append_~x#1.offset;" [2025-01-10 07:08:10,015 INFO L754 eck$LassoCheckResult]: Loop: "call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$#0(append_~x#1.base, 4 + append_~x#1.offset, 8);" "assume append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0;havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;" "call append_#t~mem7#1.base, append_#t~mem7#1.offset := read~$Pointer$#0(append_~x#1.base, 4 + append_~x#1.offset, 8);append_~x#1.base, append_~x#1.offset := append_#t~mem7#1.base, append_#t~mem7#1.offset;" [2025-01-10 07:08:10,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:08:10,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1660427840, now seen corresponding path program 1 times [2025-01-10 07:08:10,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:08:10,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592321383] [2025-01-10 07:08:10,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:08:10,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:08:10,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 07:08:10,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 07:08:10,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:08:10,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:08:10,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:08:10,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:08:10,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592321383] [2025-01-10 07:08:10,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592321383] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:08:10,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:08:10,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 07:08:10,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56957815] [2025-01-10 07:08:10,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:08:10,171 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:08:10,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:08:10,172 INFO L85 PathProgramCache]: Analyzing trace with hash 63653, now seen corresponding path program 1 times [2025-01-10 07:08:10,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:08:10,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732573528] [2025-01-10 07:08:10,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:08:10,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:08:10,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:08:10,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:08:10,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:08:10,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:08:10,186 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:08:10,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:08:10,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:08:10,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:08:10,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:08:10,190 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:08:10,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:08:10,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 07:08:10,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 07:08:10,252 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. cyclomatic complexity: 9 Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 07:08:10,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:08:10,274 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2025-01-10 07:08:10,274 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 35 transitions. [2025-01-10 07:08:10,275 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-01-10 07:08:10,276 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 35 transitions. [2025-01-10 07:08:10,276 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2025-01-10 07:08:10,276 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2025-01-10 07:08:10,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 35 transitions. [2025-01-10 07:08:10,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:08:10,277 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 35 transitions. [2025-01-10 07:08:10,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 35 transitions. [2025-01-10 07:08:10,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-01-10 07:08:10,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 07:08:10,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2025-01-10 07:08:10,279 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 35 transitions. [2025-01-10 07:08:10,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 07:08:10,280 INFO L432 stractBuchiCegarLoop]: Abstraction has 30 states and 35 transitions. [2025-01-10 07:08:10,280 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-01-10 07:08:10,280 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 35 transitions. [2025-01-10 07:08:10,281 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-01-10 07:08:10,281 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:08:10,281 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:08:10,281 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:08:10,281 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:08:10,282 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~nondet8#1, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1, main_~n~0#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~y_length~0#1;havoc main_#t~nondet8#1;main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;" "assume !(main_~n~0#1 < 1);" "call main_#t~ret9#1.base, main_#t~ret9#1.offset := new_ll(main_~n~0#1);"< "~n := #in~n;" "assume 0 == ~n;#res.base, #res.offset := 0, 0;" "assume true;" >"#58#return;" "main_~x~0#1.base, main_~x~0#1.offset := main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;assume { :begin_inline_append } true;append_#in~x#1.base, append_#in~x#1.offset, append_#in~y#1.base, append_#in~y#1.offset := main_~x~0#1.base, main_~x~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;havoc append_#res#1.base, append_#res#1.offset;havoc append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_~x#1.base, append_~x#1.offset, append_~y#1.base, append_~y#1.offset, append_~s~0#1.base, append_~s~0#1.offset;append_~x#1.base, append_~x#1.offset := append_#in~x#1.base, append_#in~x#1.offset;append_~y#1.base, append_~y#1.offset := append_#in~y#1.base, append_#in~y#1.offset;" "assume append_~x#1.base == 0 && append_~x#1.offset == 0;append_#res#1.base, append_#res#1.offset := append_~y#1.base, append_~y#1.offset;" "main_#t~ret10#1.base, main_#t~ret10#1.offset := append_#res#1.base, append_#res#1.offset;havoc append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_~x#1.base, append_~x#1.offset, append_~y#1.base, append_~y#1.offset, append_~s~0#1.base, append_~s~0#1.offset;havoc append_#in~x#1.base, append_#in~x#1.offset, append_#in~y#1.base, append_#in~y#1.offset;assume { :end_inline_append } true;main_~y~0#1.base, main_~y~0#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset;" "call main_#t~ret11#1 := length(main_~y~0#1.base, main_~y~0#1.offset);"< [2025-01-10 07:08:10,282 INFO L754 eck$LassoCheckResult]: Loop: "~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset;" "assume !(~xs.base == 0 && ~xs.offset == 0);call #t~mem4.base, #t~mem4.offset := read~$Pointer$#0(~xs.base, 4 + ~xs.offset, 8);" "call #t~ret5 := length(#t~mem4.base, #t~mem4.offset);"< [2025-01-10 07:08:10,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:08:10,282 INFO L85 PathProgramCache]: Analyzing trace with hash -2056680278, now seen corresponding path program 1 times [2025-01-10 07:08:10,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:08:10,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004288282] [2025-01-10 07:08:10,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:08:10,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:08:10,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 07:08:10,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 07:08:10,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:08:10,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:08:10,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:08:10,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:08:10,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004288282] [2025-01-10 07:08:10,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004288282] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:08:10,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:08:10,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 07:08:10,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994066779] [2025-01-10 07:08:10,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:08:10,327 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:08:10,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:08:10,327 INFO L85 PathProgramCache]: Analyzing trace with hash 37906, now seen corresponding path program 1 times [2025-01-10 07:08:10,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:08:10,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552541340] [2025-01-10 07:08:10,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:08:10,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:08:10,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:08:10,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:08:10,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:08:10,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:08:10,332 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:08:10,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:08:10,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:08:10,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:08:10,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:08:10,336 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:08:10,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:08:10,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 07:08:10,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 07:08:10,417 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. cyclomatic complexity: 8 Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 07:08:10,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:08:10,440 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2025-01-10 07:08:10,440 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 32 transitions. [2025-01-10 07:08:10,441 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-01-10 07:08:10,442 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 25 states and 29 transitions. [2025-01-10 07:08:10,442 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2025-01-10 07:08:10,442 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2025-01-10 07:08:10,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 29 transitions. [2025-01-10 07:08:10,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:08:10,442 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 29 transitions. [2025-01-10 07:08:10,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 29 transitions. [2025-01-10 07:08:10,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-01-10 07:08:10,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 07:08:10,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2025-01-10 07:08:10,444 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 29 transitions. [2025-01-10 07:08:10,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 07:08:10,445 INFO L432 stractBuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2025-01-10 07:08:10,445 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-01-10 07:08:10,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2025-01-10 07:08:10,446 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-01-10 07:08:10,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:08:10,446 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:08:10,446 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:08:10,446 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:08:10,447 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~nondet8#1, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1, main_~n~0#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~y_length~0#1;havoc main_#t~nondet8#1;main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;" "assume !(main_~n~0#1 < 1);" "call main_#t~ret9#1.base, main_#t~ret9#1.offset := new_ll(main_~n~0#1);"< "~n := #in~n;" "assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int#0(~n, ~head~0.base, ~head~0.offset, 4);" "call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);"< "~n := #in~n;" "assume 0 == ~n;#res.base, #res.offset := 0, 0;" "assume true;" >"#54#return;" "call write~$Pointer$#0(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8);havoc #t~ret3.base, #t~ret3.offset;#res.base, #res.offset := ~head~0.base, ~head~0.offset;" "assume true;" >"#58#return;" "main_~x~0#1.base, main_~x~0#1.offset := main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;assume { :begin_inline_append } true;append_#in~x#1.base, append_#in~x#1.offset, append_#in~y#1.base, append_#in~y#1.offset := main_~x~0#1.base, main_~x~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;havoc append_#res#1.base, append_#res#1.offset;havoc append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_~x#1.base, append_~x#1.offset, append_~y#1.base, append_~y#1.offset, append_~s~0#1.base, append_~s~0#1.offset;append_~x#1.base, append_~x#1.offset := append_#in~x#1.base, append_#in~x#1.offset;append_~y#1.base, append_~y#1.offset := append_#in~y#1.base, append_#in~y#1.offset;" "assume !(append_~x#1.base == 0 && append_~x#1.offset == 0);append_~s~0#1.base, append_~s~0#1.offset := append_~x#1.base, append_~x#1.offset;" [2025-01-10 07:08:10,447 INFO L754 eck$LassoCheckResult]: Loop: "call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$#0(append_~x#1.base, 4 + append_~x#1.offset, 8);" "assume append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0;havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;" "call append_#t~mem7#1.base, append_#t~mem7#1.offset := read~$Pointer$#0(append_~x#1.base, 4 + append_~x#1.offset, 8);append_~x#1.base, append_~x#1.offset := append_#t~mem7#1.base, append_#t~mem7#1.offset;" [2025-01-10 07:08:10,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:08:10,447 INFO L85 PathProgramCache]: Analyzing trace with hash 243493472, now seen corresponding path program 1 times [2025-01-10 07:08:10,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:08:10,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814158481] [2025-01-10 07:08:10,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:08:10,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:08:10,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 07:08:10,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 07:08:10,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:08:10,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:08:10,460 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:08:10,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 07:08:10,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 07:08:10,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:08:10,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:08:10,472 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:08:10,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:08:10,472 INFO L85 PathProgramCache]: Analyzing trace with hash 63653, now seen corresponding path program 2 times [2025-01-10 07:08:10,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:08:10,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849477815] [2025-01-10 07:08:10,472 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:08:10,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:08:10,475 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:08:10,477 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:08:10,477 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:08:10,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:08:10,477 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:08:10,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:08:10,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:08:10,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:08:10,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:08:10,484 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:08:10,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:08:10,484 INFO L85 PathProgramCache]: Analyzing trace with hash -285704730, now seen corresponding path program 1 times [2025-01-10 07:08:10,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:08:10,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475713668] [2025-01-10 07:08:10,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:08:10,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:08:10,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 07:08:10,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 07:08:10,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:08:10,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:08:10,862 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 07:08:10,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:08:10,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475713668] [2025-01-10 07:08:10,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475713668] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:08:10,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045915748] [2025-01-10 07:08:10,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:08:10,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:08:10,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:08:10,866 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:08:10,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-01-10 07:08:10,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 07:08:10,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 07:08:10,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:08:10,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:08:10,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-01-10 07:08:10,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:08:11,009 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 13 treesize of output 9 [2025-01-10 07:08:11,015 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 13 treesize of output 9 [2025-01-10 07:08:11,045 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 07:08:11,045 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:08:11,151 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 07:08:11,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045915748] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:08:11,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:08:11,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 8 [2025-01-10 07:08:11,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90950648] [2025-01-10 07:08:11,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:08:11,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:08:11,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 07:08:11,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-10 07:08:11,216 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. cyclomatic complexity: 7 Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 07:08:11,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:08:11,274 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2025-01-10 07:08:11,275 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 39 transitions. [2025-01-10 07:08:11,275 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-01-10 07:08:11,277 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 39 transitions. [2025-01-10 07:08:11,277 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2025-01-10 07:08:11,277 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2025-01-10 07:08:11,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 39 transitions. [2025-01-10 07:08:11,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:08:11,277 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 39 transitions. [2025-01-10 07:08:11,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 39 transitions. [2025-01-10 07:08:11,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2025-01-10 07:08:11,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.16) internal successors, (29), 24 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 07:08:11,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2025-01-10 07:08:11,279 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 38 transitions. [2025-01-10 07:08:11,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 07:08:11,280 INFO L432 stractBuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2025-01-10 07:08:11,280 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-01-10 07:08:11,280 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 38 transitions. [2025-01-10 07:08:11,280 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-01-10 07:08:11,280 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:08:11,280 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:08:11,281 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:08:11,281 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:08:11,281 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~nondet8#1, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1, main_~n~0#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~y_length~0#1;havoc main_#t~nondet8#1;main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;" "assume !(main_~n~0#1 < 1);" "call main_#t~ret9#1.base, main_#t~ret9#1.offset := new_ll(main_~n~0#1);"< "~n := #in~n;" "assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int#0(~n, ~head~0.base, ~head~0.offset, 4);" "call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);"< "~n := #in~n;" "assume 0 == ~n;#res.base, #res.offset := 0, 0;" "assume true;" >"#54#return;" "call write~$Pointer$#0(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8);havoc #t~ret3.base, #t~ret3.offset;#res.base, #res.offset := ~head~0.base, ~head~0.offset;" "assume true;" >"#58#return;" "main_~x~0#1.base, main_~x~0#1.offset := main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;assume { :begin_inline_append } true;append_#in~x#1.base, append_#in~x#1.offset, append_#in~y#1.base, append_#in~y#1.offset := main_~x~0#1.base, main_~x~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;havoc append_#res#1.base, append_#res#1.offset;havoc append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_~x#1.base, append_~x#1.offset, append_~y#1.base, append_~y#1.offset, append_~s~0#1.base, append_~s~0#1.offset;append_~x#1.base, append_~x#1.offset := append_#in~x#1.base, append_#in~x#1.offset;append_~y#1.base, append_~y#1.offset := append_#in~y#1.base, append_#in~y#1.offset;" "assume append_~x#1.base == 0 && append_~x#1.offset == 0;append_#res#1.base, append_#res#1.offset := append_~y#1.base, append_~y#1.offset;" "main_#t~ret10#1.base, main_#t~ret10#1.offset := append_#res#1.base, append_#res#1.offset;havoc append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_~x#1.base, append_~x#1.offset, append_~y#1.base, append_~y#1.offset, append_~s~0#1.base, append_~s~0#1.offset;havoc append_#in~x#1.base, append_#in~x#1.offset, append_#in~y#1.base, append_#in~y#1.offset;assume { :end_inline_append } true;main_~y~0#1.base, main_~y~0#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset;" "call main_#t~ret11#1 := length(main_~y~0#1.base, main_~y~0#1.offset);"< [2025-01-10 07:08:11,281 INFO L754 eck$LassoCheckResult]: Loop: "~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset;" "assume !(~xs.base == 0 && ~xs.offset == 0);call #t~mem4.base, #t~mem4.offset := read~$Pointer$#0(~xs.base, 4 + ~xs.offset, 8);" "call #t~ret5 := length(#t~mem4.base, #t~mem4.offset);"< [2025-01-10 07:08:11,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:08:11,281 INFO L85 PathProgramCache]: Analyzing trace with hash 2068992202, now seen corresponding path program 1 times [2025-01-10 07:08:11,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:08:11,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745264042] [2025-01-10 07:08:11,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:08:11,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:08:11,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 07:08:11,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 07:08:11,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:08:11,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:08:11,325 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 07:08:11,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:08:11,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745264042] [2025-01-10 07:08:11,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745264042] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:08:11,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:08:11,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 07:08:11,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105281624] [2025-01-10 07:08:11,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:08:11,325 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:08:11,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:08:11,326 INFO L85 PathProgramCache]: Analyzing trace with hash 37906, now seen corresponding path program 2 times [2025-01-10 07:08:11,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:08:11,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263906173] [2025-01-10 07:08:11,326 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:08:11,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:08:11,328 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:08:11,328 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:08:11,328 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:08:11,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:08:11,329 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:08:11,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:08:11,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:08:11,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:08:11,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:08:11,331 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:08:11,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:08:11,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 07:08:11,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 07:08:11,402 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. cyclomatic complexity: 9 Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 07:08:11,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:08:11,422 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2025-01-10 07:08:11,422 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 41 transitions. [2025-01-10 07:08:11,423 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-01-10 07:08:11,423 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 41 transitions. [2025-01-10 07:08:11,423 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2025-01-10 07:08:11,424 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2025-01-10 07:08:11,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 41 transitions. [2025-01-10 07:08:11,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:08:11,424 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 41 transitions. [2025-01-10 07:08:11,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 41 transitions. [2025-01-10 07:08:11,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2025-01-10 07:08:11,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.08) internal successors, (27), 24 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 07:08:11,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2025-01-10 07:08:11,430 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 36 transitions. [2025-01-10 07:08:11,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 07:08:11,431 INFO L432 stractBuchiCegarLoop]: Abstraction has 32 states and 36 transitions. [2025-01-10 07:08:11,431 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-01-10 07:08:11,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 36 transitions. [2025-01-10 07:08:11,432 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-01-10 07:08:11,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:08:11,435 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:08:11,436 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:08:11,436 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:08:11,436 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~nondet8#1, main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1, main_~n~0#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~y_length~0#1;havoc main_#t~nondet8#1;main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;" "assume !(main_~n~0#1 < 1);" "call main_#t~ret9#1.base, main_#t~ret9#1.offset := new_ll(main_~n~0#1);"< "~n := #in~n;" "assume !(0 == ~n);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;call write~int#0(~n, ~head~0.base, ~head~0.offset, 4);" "call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);"< "~n := #in~n;" "assume 0 == ~n;#res.base, #res.offset := 0, 0;" "assume true;" >"#54#return;" "call write~$Pointer$#0(#t~ret3.base, #t~ret3.offset, ~head~0.base, 4 + ~head~0.offset, 8);havoc #t~ret3.base, #t~ret3.offset;#res.base, #res.offset := ~head~0.base, ~head~0.offset;" "assume true;" >"#58#return;" "main_~x~0#1.base, main_~x~0#1.offset := main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;assume { :begin_inline_append } true;append_#in~x#1.base, append_#in~x#1.offset, append_#in~y#1.base, append_#in~y#1.offset := main_~x~0#1.base, main_~x~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;havoc append_#res#1.base, append_#res#1.offset;havoc append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_~x#1.base, append_~x#1.offset, append_~y#1.base, append_~y#1.offset, append_~s~0#1.base, append_~s~0#1.offset;append_~x#1.base, append_~x#1.offset := append_#in~x#1.base, append_#in~x#1.offset;append_~y#1.base, append_~y#1.offset := append_#in~y#1.base, append_#in~y#1.offset;" "assume !(append_~x#1.base == 0 && append_~x#1.offset == 0);append_~s~0#1.base, append_~s~0#1.offset := append_~x#1.base, append_~x#1.offset;" "call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$#0(append_~x#1.base, 4 + append_~x#1.offset, 8);" "assume !(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;" "call write~$Pointer$#0(append_~y#1.base, append_~y#1.offset, append_~x#1.base, 4 + append_~x#1.offset, 8);append_#res#1.base, append_#res#1.offset := append_~s~0#1.base, append_~s~0#1.offset;" "main_#t~ret10#1.base, main_#t~ret10#1.offset := append_#res#1.base, append_#res#1.offset;havoc append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_~x#1.base, append_~x#1.offset, append_~y#1.base, append_~y#1.offset, append_~s~0#1.base, append_~s~0#1.offset;havoc append_#in~x#1.base, append_#in~x#1.offset, append_#in~y#1.base, append_#in~y#1.offset;assume { :end_inline_append } true;main_~y~0#1.base, main_~y~0#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset;" "call main_#t~ret11#1 := length(main_~y~0#1.base, main_~y~0#1.offset);"< [2025-01-10 07:08:11,436 INFO L754 eck$LassoCheckResult]: Loop: "~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset;" "assume !(~xs.base == 0 && ~xs.offset == 0);call #t~mem4.base, #t~mem4.offset := read~$Pointer$#0(~xs.base, 4 + ~xs.offset, 8);" "call #t~ret5 := length(#t~mem4.base, #t~mem4.offset);"< [2025-01-10 07:08:11,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:08:11,436 INFO L85 PathProgramCache]: Analyzing trace with hash 315726356, now seen corresponding path program 1 times [2025-01-10 07:08:11,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:08:11,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089320871] [2025-01-10 07:08:11,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:08:11,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:08:11,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 07:08:11,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 07:08:11,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:08:11,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:08:11,463 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:08:11,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 07:08:11,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 07:08:11,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:08:11,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:08:11,483 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:08:11,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:08:11,487 INFO L85 PathProgramCache]: Analyzing trace with hash 37906, now seen corresponding path program 3 times [2025-01-10 07:08:11,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:08:11,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600674555] [2025-01-10 07:08:11,487 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:08:11,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:08:11,489 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:08:11,490 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:08:11,490 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 07:08:11,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:08:11,490 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:08:11,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:08:11,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:08:11,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:08:11,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:08:11,496 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:08:11,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:08:11,496 INFO L85 PathProgramCache]: Analyzing trace with hash -174498529, now seen corresponding path program 1 times [2025-01-10 07:08:11,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:08:11,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787361041] [2025-01-10 07:08:11,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:08:11,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:08:11,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 07:08:11,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 07:08:11,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:08:11,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:08:11,524 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:08:11,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 07:08:11,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 07:08:11,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:08:11,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:08:11,550 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:08:13,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 07:08:13,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 07:08:13,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:08:13,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:08:13,151 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:08:13,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 07:08:13,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 07:08:13,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:08:13,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:08:13,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.01 07:08:13 BoogieIcfgContainer [2025-01-10 07:08:13,230 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-01-10 07:08:13,230 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 07:08:13,231 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 07:08:13,231 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 07:08:13,232 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:08:08" (3/4) ... [2025-01-10 07:08:13,234 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-01-10 07:08:13,277 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 07:08:13,278 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 07:08:13,279 INFO L158 Benchmark]: Toolchain (without parser) took 5994.13ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 111.7MB in the beginning and 110.9MB in the end (delta: 749.4kB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. [2025-01-10 07:08:13,279 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 201.3MB. Free memory was 123.7MB in the beginning and 123.4MB in the end (delta: 293.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:08:13,279 INFO L158 Benchmark]: CACSL2BoogieTranslator took 384.91ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 95.3MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 07:08:13,280 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.29ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 93.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:08:13,280 INFO L158 Benchmark]: Boogie Preprocessor took 39.43ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 92.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:08:13,280 INFO L158 Benchmark]: RCFGBuilder took 290.04ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 78.6MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 07:08:13,280 INFO L158 Benchmark]: BuchiAutomizer took 5196.43ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 78.6MB in the beginning and 114.3MB in the end (delta: -35.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:08:13,280 INFO L158 Benchmark]: Witness Printer took 47.76ms. Allocated memory is still 176.2MB. Free memory was 114.3MB in the beginning and 110.9MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:08:13,285 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.44ms. Allocated memory is still 201.3MB. Free memory was 123.7MB in the beginning and 123.4MB in the end (delta: 293.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 384.91ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 95.3MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.29ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 93.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.43ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 92.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 290.04ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 78.6MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 5196.43ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 78.6MB in the beginning and 114.3MB in the end (delta: -35.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 47.76ms. Allocated memory is still 176.2MB. Free memory was 114.3MB in the beginning and 110.9MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function \old(n) and consists of 6 locations. 4 modules have a trivial ranking function, the largest among these consists of 8 locations. The remainder module has 32 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.1s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 4.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 7 StatesRemovedByMinimization, 3 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 [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28 mSDsluCounter, 374 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 280 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 157 IncrementalHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 94 mSDtfsCounter, 157 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU3 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital138 mio100 ax100 hnf100 lsp100 ukn31 mio100 lsp39 div100 bol100 ite100 ukn100 eq217 hnf86 smp100 dnf112 smp100 tf100 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 74ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 555]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L573] int n = __VERIFIER_nondet_int(); [L574] COND FALSE !(n < 1) VAL [n=1] [L577] CALL, EXPR new_ll(n) VAL [\old(n)=1] [L548] COND FALSE !(n == 0) [L550] node_t* head = malloc(sizeof(node_t)); [L551] head->val = n VAL [\old(n)=1, head={-1:0}, n=1] [L552] CALL, EXPR new_ll(n-1) VAL [\old(n)=0] [L548] COND TRUE n == 0 [L549] return ((void *)0); VAL [\old(n)=0, \result={0:0}] [L552] RET, EXPR new_ll(n-1) VAL [\old(n)=1, head={-1:0}, n=1] [L552] head->next = new_ll(n-1) [L553] return head; VAL [\old(n)=1, \result={-1:0}, n=1] [L577] RET, EXPR new_ll(n) VAL [n=1] [L577] node_t* x = new_ll(n); [L578] CALL, EXPR append(x, x) [L563] COND FALSE !(x == ((void *)0)) [L565] node_t* s = x; VAL [s={-1:0}, x={-1:0}, y={-1:0}] [L566] EXPR x->next [L566] COND FALSE !(x->next != ((void *)0)) [L568] x->next = y [L569] return s; VAL [\result={-1:0}] [L578] RET, EXPR append(x, x) [L578] node_t* y = append(x, x); [L579] CALL length(y) VAL [\old(xs)={-1:0}] Loop: [L557] COND FALSE !(xs == ((void *)0)) [L559] EXPR xs->next [L559] CALL length(xs->next) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 555]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L573] int n = __VERIFIER_nondet_int(); [L574] COND FALSE !(n < 1) VAL [n=1] [L577] CALL, EXPR new_ll(n) VAL [\old(n)=1] [L548] COND FALSE !(n == 0) [L550] node_t* head = malloc(sizeof(node_t)); [L551] head->val = n VAL [\old(n)=1, head={-1:0}, n=1] [L552] CALL, EXPR new_ll(n-1) VAL [\old(n)=0] [L548] COND TRUE n == 0 [L549] return ((void *)0); VAL [\old(n)=0, \result={0:0}] [L552] RET, EXPR new_ll(n-1) VAL [\old(n)=1, head={-1:0}, n=1] [L552] head->next = new_ll(n-1) [L553] return head; VAL [\old(n)=1, \result={-1:0}, n=1] [L577] RET, EXPR new_ll(n) VAL [n=1] [L577] node_t* x = new_ll(n); [L578] CALL, EXPR append(x, x) [L563] COND FALSE !(x == ((void *)0)) [L565] node_t* s = x; VAL [s={-1:0}, x={-1:0}, y={-1:0}] [L566] EXPR x->next [L566] COND FALSE !(x->next != ((void *)0)) [L568] x->next = y [L569] return s; VAL [\result={-1:0}] [L578] RET, EXPR append(x, x) [L578] node_t* y = append(x, x); [L579] CALL length(y) VAL [\old(xs)={-1:0}] Loop: [L557] COND FALSE !(xs == ((void *)0)) [L559] EXPR xs->next [L559] CALL length(xs->next) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-01-10 07:08:13,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-01-10 07:08:13,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)