./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 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/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-?-48c9605-m [2025-02-08 14:25:51,319 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:25:51,380 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-02-08 14:25:51,383 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:25:51,384 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:25:51,384 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-08 14:25:51,398 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:25:51,398 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:25:51,398 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:25:51,399 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:25:51,399 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:25:51,399 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:25:51,399 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:25:51,399 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:25:51,399 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-08 14:25:51,399 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-08 14:25:51,400 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-08 14:25:51,400 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-08 14:25:51,400 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-08 14:25:51,400 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-08 14:25:51,400 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:25:51,400 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-08 14:25:51,400 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:25:51,400 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:25:51,400 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-08 14:25:51,400 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-08 14:25:51,400 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-08 14:25:51,400 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:25:51,400 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:25:51,401 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-08 14:25:51,401 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:25:51,401 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:25:51,401 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:25:51,401 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:25:51,401 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:25:51,401 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:25:51,401 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-08 14:25:51,401 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-02-08 14:25:51,589 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:25:51,595 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:25:51,597 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:25:51,598 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:25:51,598 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:25:51,599 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-02-08 14:25:53,482 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9ed8ae887/9ce5d90769834f04af0ab19ef1ed6a88/FLAGf160036bb [2025-02-08 14:25:53,769 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:25:53,770 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-memory-linkedlists/ll_append-alloca-2.i [2025-02-08 14:25:53,779 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9ed8ae887/9ce5d90769834f04af0ab19ef1ed6a88/FLAGf160036bb [2025-02-08 14:25:54,055 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9ed8ae887/9ce5d90769834f04af0ab19ef1ed6a88 [2025-02-08 14:25:54,057 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:25:54,059 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:25:54,060 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:25:54,062 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:25:54,065 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:25:54,067 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:25:54" (1/1) ... [2025-02-08 14:25:54,068 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36762760 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:25:54, skipping insertion in model container [2025-02-08 14:25:54,068 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:25:54" (1/1) ... [2025-02-08 14:25:54,094 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:25:54,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:25:54,313 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:25:54,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:25:54,359 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:25:54,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:25:54 WrapperNode [2025-02-08 14:25:54,359 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:25:54,360 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:25:54,360 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:25:54,360 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:25:54,365 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:25:54" (1/1) ... [2025-02-08 14:25:54,371 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:25:54" (1/1) ... [2025-02-08 14:25:54,386 INFO L138 Inliner]: procedures = 115, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 38 [2025-02-08 14:25:54,386 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:25:54,387 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:25:54,387 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:25:54,387 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:25:54,391 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:25:54" (1/1) ... [2025-02-08 14:25:54,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:25:54" (1/1) ... [2025-02-08 14:25:54,398 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:25:54" (1/1) ... [2025-02-08 14:25:54,420 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-02-08 14:25:54,420 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:25:54" (1/1) ... [2025-02-08 14:25:54,420 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:25:54" (1/1) ... [2025-02-08 14:25:54,428 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:25:54" (1/1) ... [2025-02-08 14:25:54,433 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:25:54" (1/1) ... [2025-02-08 14:25:54,434 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:25:54" (1/1) ... [2025-02-08 14:25:54,434 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:25:54" (1/1) ... [2025-02-08 14:25:54,435 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:25:54,439 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:25:54,439 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:25:54,439 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:25:54,440 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:25:54" (1/1) ... [2025-02-08 14:25:54,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:25:54,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:25:54,476 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:25:54,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-02-08 14:25:54,493 INFO L130 BoogieDeclarations]: Found specification of procedure new_ll [2025-02-08 14:25:54,493 INFO L138 BoogieDeclarations]: Found implementation of procedure new_ll [2025-02-08 14:25:54,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 14:25:54,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 14:25:54,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 14:25:54,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 14:25:54,494 INFO L130 BoogieDeclarations]: Found specification of procedure length [2025-02-08 14:25:54,494 INFO L138 BoogieDeclarations]: Found implementation of procedure length [2025-02-08 14:25:54,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:25:54,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:25:54,567 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:25:54,569 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:25:54,710 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L559: havoc #t~mem4.base, #t~mem4.offset;havoc #t~ret5; [2025-02-08 14:25:54,806 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-02-08 14:25:54,806 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:25:54,816 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:25:54,816 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:25:54,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:25:54 BoogieIcfgContainer [2025-02-08 14:25:54,817 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:25:54,817 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-08 14:25:54,817 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-08 14:25:54,821 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-08 14:25:54,822 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:25:54,822 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.02 02:25:54" (1/3) ... [2025-02-08 14:25:54,823 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@271ebbb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:25:54, skipping insertion in model container [2025-02-08 14:25:54,823 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:25:54,823 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:25:54" (2/3) ... [2025-02-08 14:25:54,823 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@271ebbb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:25:54, skipping insertion in model container [2025-02-08 14:25:54,823 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:25:54,823 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:25:54" (3/3) ... [2025-02-08 14:25:54,824 INFO L363 chiAutomizerObserver]: Analyzing ICFG ll_append-alloca-2.i [2025-02-08 14:25:54,854 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-08 14:25:54,854 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-08 14:25:54,855 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-08 14:25:54,855 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-08 14:25:54,855 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-08 14:25:54,855 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-08 14:25:54,855 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-08 14:25:54,855 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-08 14:25:54,858 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 26 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 19 states have internal predecessors, (23), 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-02-08 14:25:54,871 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2025-02-08 14:25:54,871 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:25:54,871 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:25:54,876 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-08 14:25:54,876 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-08 14:25:54,876 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-08 14:25:54,876 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 26 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 19 states have internal predecessors, (23), 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-02-08 14:25:54,877 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2025-02-08 14:25:54,877 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:25:54,878 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:25:54,878 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-08 14:25:54,878 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-08 14:25:54,882 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-02-08 14:25:54,882 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-02-08 14:25:54,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:25:54,886 INFO L85 PathProgramCache]: Analyzing trace with hash 65516, now seen corresponding path program 1 times [2025-02-08 14:25:54,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:25:54,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776017672] [2025-02-08 14:25:54,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:25:54,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:25:54,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:25:54,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:25:54,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:25:54,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:25:54,964 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:25:54,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:25:54,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:25:54,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:25:54,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:25:54,995 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:25:55,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:25:55,004 INFO L85 PathProgramCache]: Analyzing trace with hash 35750, now seen corresponding path program 1 times [2025-02-08 14:25:55,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:25:55,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48424224] [2025-02-08 14:25:55,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:25:55,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:25:55,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:25:55,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:25:55,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:25:55,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:25:55,039 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:25:55,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:25:55,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:25:55,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:25:55,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:25:55,064 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:25:55,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:25:55,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1951793115, now seen corresponding path program 1 times [2025-02-08 14:25:55,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:25:55,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459711173] [2025-02-08 14:25:55,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:25:55,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:25:55,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:25:55,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:25:55,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:25:55,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:25:55,098 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:25:55,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:25:55,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:25:55,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:25:55,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:25:55,124 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:25:55,762 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:25:55,762 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:25:55,763 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:25:55,763 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:25:55,763 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:25:55,763 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:25:55,763 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:25:55,763 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:25:55,764 INFO L132 ssoRankerPreferences]: Filename of dumped script: ll_append-alloca-2.i_Iteration1_Lasso [2025-02-08 14:25:55,764 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:25:55,764 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:25:55,776 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:55,781 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:55,784 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:55,786 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:55,789 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:55,791 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:55,793 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:55,796 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:55,799 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:55,801 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:55,803 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:55,805 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:55,807 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:55,857 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:55,860 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:55,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:55,864 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:55,866 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:55,868 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:55,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:55,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:55,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:55,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:55,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:55,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:55,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:55,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:55,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:55,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:55,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:55,890 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:55,893 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:55,894 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:55,896 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:55,897 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:55,899 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:55,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:55,902 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:55,904 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:25:56,074 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:25:56,077 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:25:56,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:25:56,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:25:56,082 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:25:56,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-02-08 14:25:56,090 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:25:56,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:25:56,101 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:25:56,102 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:25:56,102 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:25:56,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:25:56,110 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:25:56,110 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:25:56,112 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:25:56,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-02-08 14:25:56,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:25:56,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:25:56,121 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:25:56,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-02-08 14:25:56,123 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:25:56,133 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:25:56,133 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:25:56,133 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:25:56,133 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:25:56,133 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:25:56,134 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:25:56,134 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:25:56,136 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:25:56,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-02-08 14:25:56,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:25:56,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:25:56,147 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:25:56,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-02-08 14:25:56,150 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:25:56,160 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:25:56,160 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:25:56,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:25:56,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:25:56,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:25:56,161 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:25:56,161 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:25:56,162 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:25:56,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-02-08 14:25:56,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:25:56,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:25:56,174 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:25:56,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-02-08 14:25:56,176 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:25:56,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:25:56,186 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:25:56,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:25:56,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:25:56,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:25:56,187 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:25:56,187 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:25:56,190 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:25:56,199 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-02-08 14:25:56,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:25:56,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:25:56,205 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:25:56,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-02-08 14:25:56,208 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:25:56,218 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:25:56,218 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:25:56,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:25:56,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:25:56,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:25:56,219 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:25:56,219 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:25:56,220 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:25:56,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-02-08 14:25:56,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:25:56,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:25:56,229 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:25:56,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-02-08 14:25:56,232 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:25:56,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:25:56,242 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:25:56,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:25:56,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:25:56,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:25:56,243 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:25:56,243 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:25:56,245 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:25:56,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-02-08 14:25:56,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:25:56,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:25:56,253 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:25:56,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-02-08 14:25:56,255 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:25:56,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:25:56,269 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:25:56,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:25:56,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:25:56,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:25:56,269 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:25:56,269 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:25:56,271 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:25:56,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-02-08 14:25:56,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:25:56,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:25:56,284 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:25:56,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-02-08 14:25:56,287 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:25:56,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:25:56,298 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:25:56,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:25:56,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:25:56,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:25:56,298 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:25:56,298 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:25:56,301 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:25:56,306 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-02-08 14:25:56,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:25:56,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:25:56,308 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:25:56,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-02-08 14:25:56,311 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:25:56,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:25:56,320 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:25:56,321 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:25:56,321 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:25:56,321 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:25:56,321 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:25:56,321 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:25:56,322 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:25:56,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-02-08 14:25:56,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:25:56,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:25:56,332 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:25:56,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-02-08 14:25:56,334 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:25:56,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:25:56,345 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:25:56,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:25:56,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:25:56,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:25:56,345 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:25:56,345 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:25:56,347 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:25:56,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-02-08 14:25:56,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:25:56,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:25:56,354 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:25:56,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-02-08 14:25:56,358 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:25:56,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:25:56,368 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:25:56,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:25:56,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:25:56,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:25:56,369 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:25:56,369 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:25:56,372 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:25:56,378 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-02-08 14:25:56,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:25:56,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:25:56,381 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:25:56,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-02-08 14:25:56,382 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:25:56,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:25:56,393 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:25:56,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:25:56,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:25:56,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:25:56,394 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:25:56,394 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:25:56,395 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:25:56,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-02-08 14:25:56,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:25:56,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:25:56,405 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:25:56,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-02-08 14:25:56,408 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:25:56,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:25:56,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:25:56,417 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-08 14:25:56,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:25:56,422 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-02-08 14:25:56,423 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-02-08 14:25:56,432 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:25:56,452 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-02-08 14:25:56,458 INFO L444 ModelExtractionUtils]: 1 out of 11 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-02-08 14:25:56,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:25:56,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:25:56,461 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:25:56,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-02-08 14:25:56,464 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:25:56,478 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2025-02-08 14:25:56,479 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:25:56,479 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-02-08 14:25:56,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-02-08 14:25:56,496 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-02-08 14:25:56,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:25:56,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:25:56,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:25:56,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:25:56,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:25:56,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 14:25:56,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:25:56,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:25:56,617 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-02-08 14:25:56,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:25:56,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:25:56,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:25:56,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 14:25:56,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:25:56,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:25:56,707 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-02-08 14:25:56,712 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 26 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 19 states have internal predecessors, (23), 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.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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-02-08 14:25:56,836 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 26 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 19 states have internal predecessors, (23), 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.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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 41 states and 49 transitions. Complement of second has 17 states. [2025-02-08 14:25:56,838 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-02-08 14:25:56,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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-02-08 14:25:56,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2025-02-08 14:25:56,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 9 transitions. Stem has 3 letters. Loop has 3 letters. [2025-02-08 14:25:56,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:25:56,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 9 transitions. Stem has 6 letters. Loop has 3 letters. [2025-02-08 14:25:56,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:25:56,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 9 transitions. Stem has 3 letters. Loop has 6 letters. [2025-02-08 14:25:56,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:25:56,854 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 49 transitions. [2025-02-08 14:25:56,863 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2025-02-08 14:25:56,871 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 27 states and 34 transitions. [2025-02-08 14:25:56,876 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2025-02-08 14:25:56,877 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2025-02-08 14:25:56,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 34 transitions. [2025-02-08 14:25:56,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:25:56,877 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 34 transitions. [2025-02-08 14:25:56,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 34 transitions. [2025-02-08 14:25:56,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2025-02-08 14:25:56,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 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-02-08 14:25:56,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2025-02-08 14:25:56,927 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 30 transitions. [2025-02-08 14:25:56,930 INFO L432 stractBuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2025-02-08 14:25:56,931 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-08 14:25:56,931 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 30 transitions. [2025-02-08 14:25:56,931 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2025-02-08 14:25:56,931 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:25:56,931 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:25:56,932 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:25:56,932 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-08 14:25:56,932 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;" >"#45#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-02-08 14:25:56,933 INFO L754 eck$LassoCheckResult]: Loop: "assume true;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-02-08 14:25:56,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:25:56,933 INFO L85 PathProgramCache]: Analyzing trace with hash 598709390, now seen corresponding path program 1 times [2025-02-08 14:25:56,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:25:56,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064813488] [2025-02-08 14:25:56,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:25:56,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:25:56,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 14:25:56,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 14:25:56,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:25:56,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:25:57,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:25:57,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:25:57,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064813488] [2025-02-08 14:25:57,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064813488] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:25:57,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:25:57,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:25:57,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976893961] [2025-02-08 14:25:57,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:25:57,079 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:25:57,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:25:57,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1728, now seen corresponding path program 1 times [2025-02-08 14:25:57,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:25:57,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016168902] [2025-02-08 14:25:57,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:25:57,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:25:57,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:25:57,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:25:57,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:25:57,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:25:57,090 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:25:57,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:25:57,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:25:57,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:25:57,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:25:57,093 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:25:57,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:25:57,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:25:57,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:25:57,154 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. cyclomatic complexity: 8 Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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-02-08 14:25:57,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:25:57,172 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2025-02-08 14:25:57,172 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 30 transitions. [2025-02-08 14:25:57,172 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2025-02-08 14:25:57,173 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 22 states and 25 transitions. [2025-02-08 14:25:57,173 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2025-02-08 14:25:57,173 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2025-02-08 14:25:57,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 25 transitions. [2025-02-08 14:25:57,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:25:57,173 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 25 transitions. [2025-02-08 14:25:57,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 25 transitions. [2025-02-08 14:25:57,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-02-08 14:25:57,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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-02-08 14:25:57,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2025-02-08 14:25:57,175 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 25 transitions. [2025-02-08 14:25:57,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:25:57,176 INFO L432 stractBuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2025-02-08 14:25:57,176 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-08 14:25:57,176 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 25 transitions. [2025-02-08 14:25:57,176 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2025-02-08 14:25:57,176 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:25:57,176 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:25:57,177 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:25:57,177 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-08 14:25:57,177 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;" >"#39#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;" >"#45#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-02-08 14:25:57,177 INFO L754 eck$LassoCheckResult]: Loop: "assume true;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-02-08 14:25:57,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:25:57,177 INFO L85 PathProgramCache]: Analyzing trace with hash 602358157, now seen corresponding path program 1 times [2025-02-08 14:25:57,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:25:57,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156182023] [2025-02-08 14:25:57,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:25:57,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:25:57,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 14:25:57,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 14:25:57,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:25:57,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:25:57,190 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:25:57,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 14:25:57,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 14:25:57,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:25:57,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:25:57,200 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:25:57,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:25:57,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1728, now seen corresponding path program 2 times [2025-02-08 14:25:57,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:25:57,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449205704] [2025-02-08 14:25:57,200 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:25:57,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:25:57,203 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:25:57,204 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:25:57,204 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:25:57,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:25:57,204 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:25:57,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:25:57,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:25:57,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:25:57,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:25:57,207 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:25:57,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:25:57,207 INFO L85 PathProgramCache]: Analyzing trace with hash -954395316, now seen corresponding path program 1 times [2025-02-08 14:25:57,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:25:57,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688643356] [2025-02-08 14:25:57,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:25:57,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:25:57,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 14:25:57,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 14:25:57,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:25:57,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:25:57,509 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 14:25:57,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:25:57,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688643356] [2025-02-08 14:25:57,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688643356] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:25:57,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68666041] [2025-02-08 14:25:57,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:25:57,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:25:57,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:25:57,512 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:25:57,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-08 14:25:57,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 14:25:57,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 14:25:57,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:25:57,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:25:57,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-08 14:25:57,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:25:57,621 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-02-08 14:25:57,626 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-02-08 14:25:57,659 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 14:25:57,660 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:25:57,764 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 14:25:57,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68666041] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:25:57,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:25:57,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2025-02-08 14:25:57,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020610350] [2025-02-08 14:25:57,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:25:57,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:25:57,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 14:25:57,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 14:25:57,816 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. cyclomatic complexity: 6 Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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-02-08 14:25:57,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:25:57,889 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2025-02-08 14:25:57,889 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 34 transitions. [2025-02-08 14:25:57,890 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2025-02-08 14:25:57,892 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 34 transitions. [2025-02-08 14:25:57,892 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2025-02-08 14:25:57,893 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2025-02-08 14:25:57,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 34 transitions. [2025-02-08 14:25:57,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:25:57,893 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 34 transitions. [2025-02-08 14:25:57,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 34 transitions. [2025-02-08 14:25:57,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2025-02-08 14:25:57,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 21 states have internal predecessors, (24), 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-02-08 14:25:57,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2025-02-08 14:25:57,895 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 33 transitions. [2025-02-08 14:25:57,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 14:25:57,897 INFO L432 stractBuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2025-02-08 14:25:57,897 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-08 14:25:57,897 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 33 transitions. [2025-02-08 14:25:57,897 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2025-02-08 14:25:57,897 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:25:57,897 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:25:57,898 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:25:57,898 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-08 14:25:57,898 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;" >"#39#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;" >"#45#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;" "assume true;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-02-08 14:25:57,898 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-02-08 14:25:57,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:25:57,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1949102338, now seen corresponding path program 1 times [2025-02-08 14:25:57,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:25:57,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415120786] [2025-02-08 14:25:57,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:25:57,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:25:57,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 14:25:57,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 14:25:57,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:25:57,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:25:57,927 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:25:57,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 14:25:57,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 14:25:57,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:25:57,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:25:57,950 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:25:57,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:25:57,954 INFO L85 PathProgramCache]: Analyzing trace with hash 44680, now seen corresponding path program 1 times [2025-02-08 14:25:57,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:25:57,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026037081] [2025-02-08 14:25:57,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:25:57,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:25:57,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:25:57,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:25:57,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:25:57,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:25:57,959 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:25:57,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:25:57,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:25:57,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:25:57,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:25:57,963 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:25:57,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:25:57,965 INFO L85 PathProgramCache]: Analyzing trace with hash 2044891623, now seen corresponding path program 1 times [2025-02-08 14:25:57,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:25:57,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708810918] [2025-02-08 14:25:57,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:25:57,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:25:57,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 14:25:57,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 14:25:57,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:25:57,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:25:57,978 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:25:57,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 14:25:58,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 14:25:58,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:25:58,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:25:58,014 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:25:59,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 14:25:59,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 14:25:59,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:25:59,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:25:59,200 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:25:59,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 14:25:59,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 14:25:59,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:25:59,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:25:59,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.02 02:25:59 BoogieIcfgContainer [2025-02-08 14:25:59,261 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-08 14:25:59,262 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 14:25:59,262 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 14:25:59,262 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 14:25:59,263 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:25:54" (3/4) ... [2025-02-08 14:25:59,264 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-02-08 14:25:59,311 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 14:25:59,311 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 14:25:59,312 INFO L158 Benchmark]: Toolchain (without parser) took 5253.33ms. Allocated memory is still 142.6MB. Free memory was 111.2MB in the beginning and 108.7MB in the end (delta: 2.5MB). Peak memory consumption was 80.1MB. Max. memory is 16.1GB. [2025-02-08 14:25:59,312 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:25:59,312 INFO L158 Benchmark]: CACSL2BoogieTranslator took 299.28ms. Allocated memory is still 142.6MB. Free memory was 110.9MB in the beginning and 94.7MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 14:25:59,313 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.06ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 93.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:25:59,313 INFO L158 Benchmark]: Boogie Preprocessor took 48.72ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 91.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:25:59,313 INFO L158 Benchmark]: IcfgBuilder took 377.80ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 76.9MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 14:25:59,313 INFO L158 Benchmark]: BuchiAutomizer took 4444.10ms. Allocated memory is still 142.6MB. Free memory was 76.5MB in the beginning and 36.0MB in the end (delta: 40.5MB). Peak memory consumption was 38.1MB. Max. memory is 16.1GB. [2025-02-08 14:25:59,314 INFO L158 Benchmark]: Witness Printer took 49.51ms. Allocated memory is still 142.6MB. Free memory was 36.0MB in the beginning and 108.7MB in the end (delta: -72.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:25:59,315 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.26ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 299.28ms. Allocated memory is still 142.6MB. Free memory was 110.9MB in the beginning and 94.7MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.06ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 93.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.72ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 91.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 377.80ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 76.9MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 4444.10ms. Allocated memory is still 142.6MB. Free memory was 76.5MB in the beginning and 36.0MB in the end (delta: 40.5MB). Peak memory consumption was 38.1MB. Max. memory is 16.1GB. * Witness Printer took 49.51ms. Allocated memory is still 142.6MB. Free memory was 36.0MB in the beginning and 108.7MB in the end (delta: -72.7MB). Peak memory consumption was 8.4MB. 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 3 terminating modules (2 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function \old(n) and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 8 locations. The remainder module has 29 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.3s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 3.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 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, 9 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9 mSDsluCounter, 179 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 136 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 87 IncrementalHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 43 mSDtfsCounter, 87 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU1 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: 77ms 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] COND TRUE x->next != ((void *)0) [L566] EXPR x->next [L566] COND FALSE !(x->next != ((void *)0)) [L568] x->next = y [L569] return s; [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] COND TRUE x->next != ((void *)0) [L566] EXPR x->next [L566] COND FALSE !(x->next != ((void *)0)) [L568] x->next = y [L569] return s; [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-02-08 14:25:59,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-02-08 14:25:59,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)