./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 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-linkedlists/ll_append-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 14:21:07,116 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 14:21:07,176 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-19 14:21:07,180 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 14:21:07,180 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 14:21:07,211 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 14:21:07,213 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 14:21:07,214 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 14:21:07,214 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 14:21:07,215 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 14:21:07,216 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 14:21:07,217 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 14:21:07,217 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 14:21:07,217 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-19 14:21:07,217 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-19 14:21:07,219 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-19 14:21:07,219 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-19 14:21:07,220 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-19 14:21:07,220 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-19 14:21:07,220 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 14:21:07,220 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-19 14:21:07,224 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 14:21:07,225 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 14:21:07,225 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-19 14:21:07,225 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-19 14:21:07,225 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-19 14:21:07,225 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 14:21:07,226 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 14:21:07,226 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 14:21:07,226 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-19 14:21:07,226 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 14:21:07,226 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 14:21:07,227 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 14:21:07,227 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 14:21:07,227 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 14:21:07,228 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-19 14:21:07,228 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/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 [2024-11-19 14:21:07,476 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 14:21:07,502 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 14:21:07,505 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 14:21:07,506 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 14:21:07,508 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 14:21:07,509 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-linkedlists/ll_append-alloca-2.i [2024-11-19 14:21:08,862 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 14:21:09,055 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 14:21:09,055 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-linkedlists/ll_append-alloca-2.i [2024-11-19 14:21:09,064 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac9b49283/16688f6325c64374a89e6b05439ff8ab/FLAGb33ad6d0e [2024-11-19 14:21:09,424 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac9b49283/16688f6325c64374a89e6b05439ff8ab [2024-11-19 14:21:09,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 14:21:09,427 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 14:21:09,428 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 14:21:09,428 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 14:21:09,435 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 14:21:09,436 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:21:09" (1/1) ... [2024-11-19 14:21:09,442 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38f2446c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:21:09, skipping insertion in model container [2024-11-19 14:21:09,442 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:21:09" (1/1) ... [2024-11-19 14:21:09,502 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 14:21:09,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:21:09,973 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 14:21:10,017 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:21:10,076 INFO L204 MainTranslator]: Completed translation [2024-11-19 14:21:10,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:21:10 WrapperNode [2024-11-19 14:21:10,077 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 14:21:10,078 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 14:21:10,078 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 14:21:10,078 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 14:21:10,100 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:21:10" (1/1) ... [2024-11-19 14:21:10,116 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:21:10" (1/1) ... [2024-11-19 14:21:10,138 INFO L138 Inliner]: procedures = 115, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 39 [2024-11-19 14:21:10,141 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 14:21:10,142 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 14:21:10,142 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 14:21:10,142 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 14:21:10,152 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:21:10" (1/1) ... [2024-11-19 14:21:10,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:21:10" (1/1) ... [2024-11-19 14:21:10,155 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:21:10" (1/1) ... [2024-11-19 14:21:10,170 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]. [2024-11-19 14:21:10,170 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:21:10" (1/1) ... [2024-11-19 14:21:10,170 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:21:10" (1/1) ... [2024-11-19 14:21:10,174 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:21:10" (1/1) ... [2024-11-19 14:21:10,180 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:21:10" (1/1) ... [2024-11-19 14:21:10,181 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:21:10" (1/1) ... [2024-11-19 14:21:10,186 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:21:10" (1/1) ... [2024-11-19 14:21:10,188 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 14:21:10,189 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 14:21:10,189 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 14:21:10,189 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 14:21:10,189 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:21:10" (1/1) ... [2024-11-19 14:21:10,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:21:10,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:21:10,236 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:21:10,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-19 14:21:10,306 INFO L130 BoogieDeclarations]: Found specification of procedure new_ll [2024-11-19 14:21:10,306 INFO L138 BoogieDeclarations]: Found implementation of procedure new_ll [2024-11-19 14:21:10,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 14:21:10,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 14:21:10,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 14:21:10,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 14:21:10,307 INFO L130 BoogieDeclarations]: Found specification of procedure length [2024-11-19 14:21:10,307 INFO L138 BoogieDeclarations]: Found implementation of procedure length [2024-11-19 14:21:10,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 14:21:10,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 14:21:10,401 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 14:21:10,403 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 14:21:10,533 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-11-19 14:21:10,534 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 14:21:10,547 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 14:21:10,548 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 14:21:10,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:21:10 BoogieIcfgContainer [2024-11-19 14:21:10,548 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 14:21:10,549 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-19 14:21:10,549 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-19 14:21:10,552 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-19 14:21:10,553 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:21:10,553 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 02:21:09" (1/3) ... [2024-11-19 14:21:10,554 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4c3959ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:21:10, skipping insertion in model container [2024-11-19 14:21:10,554 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:21:10,554 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:21:10" (2/3) ... [2024-11-19 14:21:10,554 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4c3959ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:21:10, skipping insertion in model container [2024-11-19 14:21:10,554 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:21:10,555 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:21:10" (3/3) ... [2024-11-19 14:21:10,556 INFO L332 chiAutomizerObserver]: Analyzing ICFG ll_append-alloca-2.i [2024-11-19 14:21:10,599 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-19 14:21:10,599 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-19 14:21:10,600 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-19 14:21:10,600 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-19 14:21:10,600 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-19 14:21:10,600 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-19 14:21:10,600 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-19 14:21:10,601 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-19 14:21:10,604 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 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) [2024-11-19 14:21:10,620 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2024-11-19 14:21:10,621 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:21:10,621 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:21:10,626 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-19 14:21:10,626 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:21:10,626 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-19 14:21:10,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 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) [2024-11-19 14:21:10,628 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2024-11-19 14:21:10,628 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:21:10,628 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:21:10,629 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-19 14:21:10,629 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:21:10,634 INFO L745 eck$LassoCheckResult]: Stem: 22#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5#L-1true 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; 12#L574true assume !(main_~n~0#1 < 1); 26#L577true call main_#t~ret9#1.base, main_#t~ret9#1.offset := new_ll(main_~n~0#1);< 9#$Ultimate##0true [2024-11-19 14:21:10,634 INFO L747 eck$LassoCheckResult]: Loop: 9#$Ultimate##0true ~n := #in~n; 18#L548true 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); 13#L552true call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);< 9#$Ultimate##0true [2024-11-19 14:21:10,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:21:10,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1418244, now seen corresponding path program 1 times [2024-11-19 14:21:10,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:21:10,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414785319] [2024-11-19 14:21:10,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:21:10,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:21:10,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:21:10,722 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:21:10,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:21:10,740 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:21:10,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:21:10,743 INFO L85 PathProgramCache]: Analyzing trace with hash 29967, now seen corresponding path program 1 times [2024-11-19 14:21:10,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:21:10,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358465149] [2024-11-19 14:21:10,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:21:10,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:21:10,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:21:10,760 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:21:10,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:21:10,777 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:21:10,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:21:10,780 INFO L85 PathProgramCache]: Analyzing trace with hash -698765780, now seen corresponding path program 1 times [2024-11-19 14:21:10,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:21:10,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746290315] [2024-11-19 14:21:10,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:21:10,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:21:10,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:21:10,804 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:21:10,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:21:10,816 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:21:11,412 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:21:11,413 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:21:11,413 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:21:11,413 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:21:11,413 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:21:11,413 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:21:11,414 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:21:11,414 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:21:11,414 INFO L132 ssoRankerPreferences]: Filename of dumped script: ll_append-alloca-2.i_Iteration1_Lasso [2024-11-19 14:21:11,414 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:21:11,414 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:21:11,427 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:21:11,433 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:21:11,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:21:11,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:21:11,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:21:11,441 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:21:11,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:21:11,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:21:11,447 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:21:11,449 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:21:11,451 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:21:11,453 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:21:11,455 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:21:11,457 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:21:11,498 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:21:11,500 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:21:11,502 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:21:11,504 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:21:11,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:21:11,508 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:21:11,510 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:21:11,512 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:21:11,513 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:21:11,515 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:21:11,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:21:11,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:21:11,521 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:21:11,523 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:21:11,525 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:21:11,527 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:21:11,528 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:21:11,530 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:21:11,532 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:21:11,533 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:21:11,535 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:21:11,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:21:11,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:21:11,541 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:21:11,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:21:11,786 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:21:11,792 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:21:11,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:21:11,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:21:11,795 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:21:11,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-19 14:21:11,798 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 [2024-11-19 14:21:11,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:21:11,811 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:21:11,812 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:21:11,812 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:21:11,812 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:21:11,813 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:21:11,813 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:21:11,815 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:21:11,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-19 14:21:11,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:21:11,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:21:11,832 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:21:11,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-19 14:21:11,835 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 [2024-11-19 14:21:11,847 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:21:11,848 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:21:11,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:21:11,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:21:11,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:21:11,849 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:21:11,849 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:21:11,850 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:21:11,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-19 14:21:11,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:21:11,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:21:11,863 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:21:11,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-19 14:21:11,865 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 [2024-11-19 14:21:11,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:21:11,876 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:21:11,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:21:11,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:21:11,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:21:11,878 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:21:11,878 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:21:11,879 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:21:11,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-11-19 14:21:11,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:21:11,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:21:11,898 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:21:11,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-19 14:21:11,905 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 [2024-11-19 14:21:11,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:21:11,919 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:21:11,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:21:11,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:21:11,919 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:21:11,924 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:21:11,924 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:21:11,926 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:21:11,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-19 14:21:11,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:21:11,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:21:11,946 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:21:11,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-19 14:21:11,948 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 [2024-11-19 14:21:11,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:21:11,963 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:21:11,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:21:11,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:21:11,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:21:11,965 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:21:11,965 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:21:11,968 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:21:11,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-19 14:21:11,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:21:11,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:21:11,986 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:21:11,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-19 14:21:11,990 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 [2024-11-19 14:21:12,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:21:12,003 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:21:12,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:21:12,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:21:12,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:21:12,004 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:21:12,004 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:21:12,006 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:21:12,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-19 14:21:12,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:21:12,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:21:12,023 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:21:12,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-19 14:21:12,026 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 [2024-11-19 14:21:12,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:21:12,041 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:21:12,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:21:12,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:21:12,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:21:12,043 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:21:12,043 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:21:12,044 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:21:12,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-19 14:21:12,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:21:12,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:21:12,064 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:21:12,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-19 14:21:12,067 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:21:12,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:21:12,080 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:21:12,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:21:12,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:21:12,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:21:12,083 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:21:12,083 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:21:12,084 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:21:12,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-19 14:21:12,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:21:12,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:21:12,101 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:21:12,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-19 14:21:12,108 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 [2024-11-19 14:21:12,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:21:12,119 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:21:12,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:21:12,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:21:12,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:21:12,120 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:21:12,120 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:21:12,125 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:21:12,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-11-19 14:21:12,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:21:12,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:21:12,146 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:21:12,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-19 14:21:12,148 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 [2024-11-19 14:21:12,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:21:12,159 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:21:12,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:21:12,159 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:21:12,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:21:12,160 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:21:12,160 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:21:12,161 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:21:12,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-11-19 14:21:12,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:21:12,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:21:12,174 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:21:12,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-19 14:21:12,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 [2024-11-19 14:21:12,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:21:12,186 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:21:12,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:21:12,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:21:12,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:21:12,187 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:21:12,187 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:21:12,191 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:21:12,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-19 14:21:12,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:21:12,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:21:12,205 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:21:12,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-19 14:21:12,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 [2024-11-19 14:21:12,218 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:21:12,219 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:21:12,219 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:21:12,219 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:21:12,219 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:21:12,220 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:21:12,220 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:21:12,221 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:21:12,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-11-19 14:21:12,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:21:12,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:21:12,237 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:21:12,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-19 14:21:12,240 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 [2024-11-19 14:21:12,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:21:12,251 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:21:12,251 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:21:12,251 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:21:12,251 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:21:12,252 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:21:12,252 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:21:12,253 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:21:12,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-11-19 14:21:12,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:21:12,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:21:12,267 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:21:12,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-19 14:21:12,269 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 [2024-11-19 14:21:12,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:21:12,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:21:12,280 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-19 14:21:12,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:21:12,286 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-11-19 14:21:12,287 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-11-19 14:21:12,298 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:21:12,315 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-11-19 14:21:12,315 INFO L444 ModelExtractionUtils]: 1 out of 11 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-19 14:21:12,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:21:12,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:21:12,374 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:21:12,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-19 14:21:12,383 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:21:12,412 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2024-11-19 14:21:12,412 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:21:12,412 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] [2024-11-19 14:21:12,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-19 14:21:12,435 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2024-11-19 14:21:12,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:21:12,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:21:12,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 14:21:12,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:21:12,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:21:12,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 14:21:12,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:21:12,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:21:12,622 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 [2024-11-19 14:21:12,625 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 27 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:21:12,740 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 27 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4). Second operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 45 states and 54 transitions. Complement of second has 17 states. [2024-11-19 14:21:12,742 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 [2024-11-19 14:21:12,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:21:12,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2024-11-19 14:21:12,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 4 letters. Loop has 3 letters. [2024-11-19 14:21:12,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:21:12,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 7 letters. Loop has 3 letters. [2024-11-19 14:21:12,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:21:12,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 4 letters. Loop has 6 letters. [2024-11-19 14:21:12,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:21:12,755 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 54 transitions. [2024-11-19 14:21:12,758 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2024-11-19 14:21:12,764 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 29 states and 37 transitions. [2024-11-19 14:21:12,764 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2024-11-19 14:21:12,765 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-11-19 14:21:12,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2024-11-19 14:21:12,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:21:12,766 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 37 transitions. [2024-11-19 14:21:12,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2024-11-19 14:21:12,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2024-11-19 14:21:12,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 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) [2024-11-19 14:21:12,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2024-11-19 14:21:12,786 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-11-19 14:21:12,786 INFO L425 stractBuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-11-19 14:21:12,786 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-19 14:21:12,786 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. [2024-11-19 14:21:12,787 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2024-11-19 14:21:12,787 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:21:12,787 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:21:12,788 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:21:12,788 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:21:12,788 INFO L745 eck$LassoCheckResult]: Stem: 168#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 156#L-1 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; 157#L574 assume !(main_~n~0#1 < 1); 145#L577 call main_#t~ret9#1.base, main_#t~ret9#1.offset := new_ll(main_~n~0#1);< 160#$Ultimate##0 ~n := #in~n; 161#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 169#new_llFINAL assume true; 167#new_llEXIT >#57#return; 163#L577-1 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; 164#L563 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; 166#L566-3 [2024-11-19 14:21:12,788 INFO L747 eck$LassoCheckResult]: Loop: 166#L566-3 call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$#0(append_~x#1.base, 4 + append_~x#1.offset, 8); 165#L566-1 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; 166#L566-3 [2024-11-19 14:21:12,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:21:12,789 INFO L85 PathProgramCache]: Analyzing trace with hash 772923198, now seen corresponding path program 1 times [2024-11-19 14:21:12,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:21:12,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096244846] [2024-11-19 14:21:12,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:21:12,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:21:12,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:21:12,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:21:12,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:21:12,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096244846] [2024-11-19 14:21:12,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096244846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:21:12,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:21:12,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 14:21:12,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243068560] [2024-11-19 14:21:12,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:21:12,947 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:21:12,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:21:12,948 INFO L85 PathProgramCache]: Analyzing trace with hash 2086, now seen corresponding path program 1 times [2024-11-19 14:21:12,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:21:12,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241191586] [2024-11-19 14:21:12,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:21:12,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:21:12,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:21:12,952 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:21:12,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:21:12,955 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:21:13,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:21:13,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 14:21:13,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 14:21:13,025 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 14:21:13,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:21:13,054 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2024-11-19 14:21:13,054 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 34 transitions. [2024-11-19 14:21:13,055 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2024-11-19 14:21:13,056 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 34 transitions. [2024-11-19 14:21:13,056 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2024-11-19 14:21:13,056 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2024-11-19 14:21:13,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 34 transitions. [2024-11-19 14:21:13,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:21:13,056 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 34 transitions. [2024-11-19 14:21:13,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 34 transitions. [2024-11-19 14:21:13,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-19 14:21:13,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 14:21:13,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2024-11-19 14:21:13,059 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 34 transitions. [2024-11-19 14:21:13,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 14:21:13,059 INFO L425 stractBuchiCegarLoop]: Abstraction has 29 states and 34 transitions. [2024-11-19 14:21:13,059 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-19 14:21:13,060 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 34 transitions. [2024-11-19 14:21:13,060 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2024-11-19 14:21:13,060 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:21:13,060 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:21:13,060 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:21:13,061 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:21:13,061 INFO L745 eck$LassoCheckResult]: Stem: 232#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 220#L-1 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; 221#L574 assume !(main_~n~0#1 < 1); 209#L577 call main_#t~ret9#1.base, main_#t~ret9#1.offset := new_ll(main_~n~0#1);< 224#$Ultimate##0 ~n := #in~n; 225#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 236#new_llFINAL assume true; 229#new_llEXIT >#57#return; 227#L577-1 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; 228#L563 assume append_~x#1.base == 0 && append_~x#1.offset == 0;append_#res#1.base, append_#res#1.offset := append_~y#1.base, append_~y#1.offset; 213#append_returnLabel#1 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; 215#L579 call main_#t~ret11#1 := length(main_~y~0#1.base, main_~y~0#1.offset);< 223#$Ultimate##0 [2024-11-19 14:21:13,061 INFO L747 eck$LassoCheckResult]: Loop: 223#$Ultimate##0 ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; 214#L557 assume !(~xs.base == 0 && ~xs.offset == 0);call #t~mem4.base, #t~mem4.offset := read~$Pointer$#0(~xs.base, 4 + ~xs.offset, 8); 216#L559 call #t~ret5 := length(#t~mem4.base, #t~mem4.offset);< 223#$Ultimate##0 [2024-11-19 14:21:13,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:21:13,061 INFO L85 PathProgramCache]: Analyzing trace with hash -250149368, now seen corresponding path program 1 times [2024-11-19 14:21:13,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:21:13,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924692550] [2024-11-19 14:21:13,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:21:13,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:21:13,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:21:13,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:21:13,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:21:13,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924692550] [2024-11-19 14:21:13,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924692550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:21:13,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:21:13,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 14:21:13,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602191808] [2024-11-19 14:21:13,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:21:13,118 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:21:13,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:21:13,118 INFO L85 PathProgramCache]: Analyzing trace with hash 37905, now seen corresponding path program 1 times [2024-11-19 14:21:13,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:21:13,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712947462] [2024-11-19 14:21:13,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:21:13,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:21:13,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:21:13,122 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:21:13,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:21:13,128 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:21:13,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:21:13,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 14:21:13,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 14:21:13,265 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. cyclomatic complexity: 8 Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 14:21:13,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:21:13,293 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2024-11-19 14:21:13,294 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 31 transitions. [2024-11-19 14:21:13,295 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2024-11-19 14:21:13,296 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 24 states and 28 transitions. [2024-11-19 14:21:13,297 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-11-19 14:21:13,297 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2024-11-19 14:21:13,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2024-11-19 14:21:13,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:21:13,298 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-11-19 14:21:13,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2024-11-19 14:21:13,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-19 14:21:13,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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) [2024-11-19 14:21:13,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2024-11-19 14:21:13,302 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-11-19 14:21:13,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 14:21:13,305 INFO L425 stractBuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-11-19 14:21:13,305 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-19 14:21:13,305 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 28 transitions. [2024-11-19 14:21:13,306 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2024-11-19 14:21:13,306 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:21:13,306 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:21:13,307 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:21:13,307 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:21:13,307 INFO L745 eck$LassoCheckResult]: Stem: 294#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 284#L-1 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; 285#L574 assume !(main_~n~0#1 < 1); 273#L577 call main_#t~ret9#1.base, main_#t~ret9#1.offset := new_ll(main_~n~0#1);< 288#$Ultimate##0 ~n := #in~n; 283#L548 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); 274#L552 call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);< 289#$Ultimate##0 ~n := #in~n; 281#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 282#new_llFINAL assume true; 286#new_llEXIT >#53#return; 272#L552-1 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; 275#new_llFINAL assume true; 295#new_llEXIT >#57#return; 290#L577-1 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; 291#L563 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; 292#L566-3 [2024-11-19 14:21:13,307 INFO L747 eck$LassoCheckResult]: Loop: 292#L566-3 call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$#0(append_~x#1.base, 4 + append_~x#1.offset, 8); 293#L566-1 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; 292#L566-3 [2024-11-19 14:21:13,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:21:13,307 INFO L85 PathProgramCache]: Analyzing trace with hash 704779872, now seen corresponding path program 1 times [2024-11-19 14:21:13,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:21:13,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453484280] [2024-11-19 14:21:13,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:21:13,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:21:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:21:13,337 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:21:13,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:21:13,362 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:21:13,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:21:13,365 INFO L85 PathProgramCache]: Analyzing trace with hash 2086, now seen corresponding path program 2 times [2024-11-19 14:21:13,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:21:13,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522107093] [2024-11-19 14:21:13,365 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:21:13,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:21:13,371 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:21:13,372 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:21:13,372 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:21:13,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:21:13,375 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:21:13,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:21:13,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1311374651, now seen corresponding path program 1 times [2024-11-19 14:21:13,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:21:13,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755841629] [2024-11-19 14:21:13,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:21:13,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:21:13,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:21:13,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-19 14:21:13,697 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 14:21:13,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:21:13,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755841629] [2024-11-19 14:21:13,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755841629] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:21:13,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929175380] [2024-11-19 14:21:13,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:21:13,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:21:13,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:21:13,702 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:21:13,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-19 14:21:13,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:21:13,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-19 14:21:13,777 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:21:13,810 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 [2024-11-19 14:21:13,817 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 [2024-11-19 14:21:13,852 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 14:21:13,853 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:21:13,955 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 14:21:13,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929175380] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:21:13,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:21:13,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2024-11-19 14:21:13,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298773801] [2024-11-19 14:21:13,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:21:13,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:21:13,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 14:21:13,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 14:21:13,999 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. cyclomatic complexity: 7 Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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) [2024-11-19 14:21:14,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:21:14,070 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2024-11-19 14:21:14,070 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 38 transitions. [2024-11-19 14:21:14,071 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2024-11-19 14:21:14,072 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 38 transitions. [2024-11-19 14:21:14,072 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2024-11-19 14:21:14,072 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2024-11-19 14:21:14,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 38 transitions. [2024-11-19 14:21:14,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:21:14,072 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 38 transitions. [2024-11-19 14:21:14,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 38 transitions. [2024-11-19 14:21:14,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2024-11-19 14:21:14,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 states have internal predecessors, (28), 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) [2024-11-19 14:21:14,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2024-11-19 14:21:14,075 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-11-19 14:21:14,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 14:21:14,076 INFO L425 stractBuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-11-19 14:21:14,076 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-19 14:21:14,076 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2024-11-19 14:21:14,077 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2024-11-19 14:21:14,077 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:21:14,077 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:21:14,077 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:21:14,077 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:21:14,078 INFO L745 eck$LassoCheckResult]: Stem: 465#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 457#L-1 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; 458#L574 assume !(main_~n~0#1 < 1); 447#L577 call main_#t~ret9#1.base, main_#t~ret9#1.offset := new_ll(main_~n~0#1);< 461#$Ultimate##0 ~n := #in~n; 456#L548 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); 446#L552 call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);< 462#$Ultimate##0 ~n := #in~n; 454#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 455#new_llFINAL assume true; 466#new_llEXIT >#53#return; 467#L552-1 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; 475#new_llFINAL assume true; 474#new_llEXIT >#57#return; 473#L577-1 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; 472#L563 assume append_~x#1.base == 0 && append_~x#1.offset == 0;append_#res#1.base, append_#res#1.offset := append_~y#1.base, append_~y#1.offset; 450#append_returnLabel#1 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; 453#L579 call main_#t~ret11#1 := length(main_~y~0#1.base, main_~y~0#1.offset);< 460#$Ultimate##0 [2024-11-19 14:21:14,078 INFO L747 eck$LassoCheckResult]: Loop: 460#$Ultimate##0 ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; 451#L557 assume !(~xs.base == 0 && ~xs.offset == 0);call #t~mem4.base, #t~mem4.offset := read~$Pointer$#0(~xs.base, 4 + ~xs.offset, 8); 452#L559 call #t~ret5 := length(#t~mem4.base, #t~mem4.offset);< 460#$Ultimate##0 [2024-11-19 14:21:14,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:21:14,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1311376214, now seen corresponding path program 1 times [2024-11-19 14:21:14,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:21:14,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197304338] [2024-11-19 14:21:14,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:21:14,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:21:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:21:14,118 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 14:21:14,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:21:14,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197304338] [2024-11-19 14:21:14,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197304338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:21:14,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:21:14,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 14:21:14,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265712002] [2024-11-19 14:21:14,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:21:14,119 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:21:14,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:21:14,120 INFO L85 PathProgramCache]: Analyzing trace with hash 37905, now seen corresponding path program 2 times [2024-11-19 14:21:14,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:21:14,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016595750] [2024-11-19 14:21:14,120 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:21:14,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:21:14,123 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:21:14,123 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:21:14,123 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:21:14,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:21:14,125 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:21:14,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:21:14,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 14:21:14,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 14:21:14,204 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. cyclomatic complexity: 9 Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 14:21:14,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:21:14,224 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2024-11-19 14:21:14,224 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 39 transitions. [2024-11-19 14:21:14,224 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2024-11-19 14:21:14,225 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 39 transitions. [2024-11-19 14:21:14,225 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2024-11-19 14:21:14,225 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2024-11-19 14:21:14,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 39 transitions. [2024-11-19 14:21:14,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:21:14,225 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 39 transitions. [2024-11-19 14:21:14,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 39 transitions. [2024-11-19 14:21:14,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2024-11-19 14:21:14,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 23 states have internal predecessors, (26), 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) [2024-11-19 14:21:14,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-11-19 14:21:14,228 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-11-19 14:21:14,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 14:21:14,228 INFO L425 stractBuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-11-19 14:21:14,229 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-19 14:21:14,229 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 35 transitions. [2024-11-19 14:21:14,229 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2024-11-19 14:21:14,229 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:21:14,229 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:21:14,230 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:21:14,230 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:21:14,230 INFO L745 eck$LassoCheckResult]: Stem: 542#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 531#L-1 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; 532#L574 assume !(main_~n~0#1 < 1); 520#L577 call main_#t~ret9#1.base, main_#t~ret9#1.offset := new_ll(main_~n~0#1);< 535#$Ultimate##0 ~n := #in~n; 530#L548 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); 521#L552 call #t~ret3.base, #t~ret3.offset := new_ll(~n - 1);< 536#$Ultimate##0 ~n := #in~n; 528#L548 assume 0 == ~n;#res.base, #res.offset := 0, 0; 529#new_llFINAL assume true; 533#new_llEXIT >#53#return; 543#L552-1 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; 549#new_llFINAL assume true; 545#new_llEXIT >#57#return; 537#L577-1 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; 538#L563 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; 547#L566-3 call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$#0(append_~x#1.base, 4 + append_~x#1.offset, 8); 541#L566-1 assume !(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset; 523#L566-4 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; 524#append_returnLabel#1 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; 527#L579 call main_#t~ret11#1 := length(main_~y~0#1.base, main_~y~0#1.offset);< 534#$Ultimate##0 [2024-11-19 14:21:14,230 INFO L747 eck$LassoCheckResult]: Loop: 534#$Ultimate##0 ~xs.base, ~xs.offset := #in~xs.base, #in~xs.offset; 525#L557 assume !(~xs.base == 0 && ~xs.offset == 0);call #t~mem4.base, #t~mem4.offset := read~$Pointer$#0(~xs.base, 4 + ~xs.offset, 8); 526#L559 call #t~ret5 := length(#t~mem4.base, #t~mem4.offset);< 534#$Ultimate##0 [2024-11-19 14:21:14,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:21:14,230 INFO L85 PathProgramCache]: Analyzing trace with hash -139719339, now seen corresponding path program 1 times [2024-11-19 14:21:14,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:21:14,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535317085] [2024-11-19 14:21:14,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:21:14,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:21:14,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:21:14,244 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:21:14,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:21:14,253 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:21:14,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:21:14,253 INFO L85 PathProgramCache]: Analyzing trace with hash 37905, now seen corresponding path program 3 times [2024-11-19 14:21:14,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:21:14,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557159575] [2024-11-19 14:21:14,253 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:21:14,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:21:14,256 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 14:21:14,256 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:21:14,256 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:21:14,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:21:14,258 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:21:14,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:21:14,258 INFO L85 PathProgramCache]: Analyzing trace with hash -555510211, now seen corresponding path program 1 times [2024-11-19 14:21:14,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:21:14,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314695416] [2024-11-19 14:21:14,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:21:14,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:21:14,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:21:14,271 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:21:14,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:21:14,289 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:21:15,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:21:15,448 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:21:15,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:21:15,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 02:21:15 BoogieIcfgContainer [2024-11-19 14:21:15,496 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-19 14:21:15,496 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 14:21:15,497 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 14:21:15,497 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 14:21:15,497 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:21:10" (3/4) ... [2024-11-19 14:21:15,499 INFO L139 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-19 14:21:15,527 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 14:21:15,527 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 14:21:15,527 INFO L158 Benchmark]: Toolchain (without parser) took 6100.13ms. Allocated memory was 180.4MB in the beginning and 257.9MB in the end (delta: 77.6MB). Free memory was 106.4MB in the beginning and 112.8MB in the end (delta: -6.4MB). Peak memory consumption was 73.0MB. Max. memory is 16.1GB. [2024-11-19 14:21:15,528 INFO L158 Benchmark]: CDTParser took 0.54ms. Allocated memory is still 180.4MB. Free memory was 134.3MB in the beginning and 134.1MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:21:15,528 INFO L158 Benchmark]: CACSL2BoogieTranslator took 649.08ms. Allocated memory is still 180.4MB. Free memory was 106.2MB in the beginning and 146.7MB in the end (delta: -40.6MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. [2024-11-19 14:21:15,528 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.40ms. Allocated memory is still 180.4MB. Free memory was 146.7MB in the beginning and 148.3MB in the end (delta: -1.6MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. [2024-11-19 14:21:15,528 INFO L158 Benchmark]: Boogie Preprocessor took 46.54ms. Allocated memory is still 180.4MB. Free memory was 148.3MB in the beginning and 146.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:21:15,528 INFO L158 Benchmark]: RCFGBuilder took 359.65ms. Allocated memory is still 180.4MB. Free memory was 146.2MB in the beginning and 131.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 14:21:15,529 INFO L158 Benchmark]: BuchiAutomizer took 4947.27ms. Allocated memory was 180.4MB in the beginning and 257.9MB in the end (delta: 77.6MB). Free memory was 131.6MB in the beginning and 114.9MB in the end (delta: 16.7MB). Peak memory consumption was 94.3MB. Max. memory is 16.1GB. [2024-11-19 14:21:15,529 INFO L158 Benchmark]: Witness Printer took 30.46ms. Allocated memory is still 257.9MB. Free memory was 114.9MB in the beginning and 112.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:21:15,530 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.54ms. Allocated memory is still 180.4MB. Free memory was 134.3MB in the beginning and 134.1MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 649.08ms. Allocated memory is still 180.4MB. Free memory was 106.2MB in the beginning and 146.7MB in the end (delta: -40.6MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.40ms. Allocated memory is still 180.4MB. Free memory was 146.7MB in the beginning and 148.3MB in the end (delta: -1.6MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.54ms. Allocated memory is still 180.4MB. Free memory was 148.3MB in the beginning and 146.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 359.65ms. Allocated memory is still 180.4MB. Free memory was 146.2MB in the beginning and 131.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 4947.27ms. Allocated memory was 180.4MB in the beginning and 257.9MB in the end (delta: 77.6MB). Free memory was 131.6MB in the beginning and 114.9MB in the end (delta: 16.7MB). Peak memory consumption was 94.3MB. Max. memory is 16.1GB. * Witness Printer took 30.46ms. Allocated memory is still 257.9MB. Free memory was 114.9MB in the beginning and 112.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function \old(n) and consists of 6 locations. 4 modules have a trivial ranking function, the largest among these consists of 8 locations. The remainder module has 31 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.8s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 4.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 6 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 30 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 27 mSDsluCounter, 354 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 264 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 154 IncrementalHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 90 mSDtfsCounter, 154 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU3 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital138 mio100 ax100 hnf100 lsp100 ukn31 mio100 lsp39 div100 bol100 ite100 ukn100 eq217 hnf86 smp100 dnf112 smp100 tf100 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 147ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 555]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L573] int n = __VERIFIER_nondet_int(); [L574] COND FALSE !(n < 1) VAL [n=1] [L577] CALL, EXPR new_ll(n) VAL [\old(n)=1] [L548] COND FALSE !(n == 0) [L550] node_t* head = malloc(sizeof(node_t)); [L551] head->val = n VAL [\old(n)=1, head={-1:0}, n=1] [L552] CALL, EXPR new_ll(n-1) VAL [\old(n)=0] [L548] COND TRUE n == 0 [L549] return ((void *)0); VAL [\old(n)=0, \result={0:0}] [L552] RET, EXPR new_ll(n-1) VAL [\old(n)=1, head={-1:0}, n=1] [L552] head->next = new_ll(n-1) [L553] return head; VAL [\old(n)=1, \result={-1:0}, n=1] [L577] RET, EXPR new_ll(n) VAL [n=1] [L577] node_t* x = new_ll(n); [L578] CALL, EXPR append(x, x) [L563] COND FALSE !(x == ((void *)0)) [L565] node_t* s = x; VAL [s={-1:0}, x={-1:0}, y={-1:0}] [L566] EXPR x->next [L566] COND FALSE !(x->next != ((void *)0)) [L568] x->next = y [L569] return s; VAL [\result={-1:0}] [L578] RET, EXPR append(x, x) [L578] node_t* y = append(x, x); [L579] CALL length(y) VAL [\old(xs)={-1:0}] Loop: [L557] COND FALSE !(xs == ((void *)0)) [L559] EXPR xs->next [L559] CALL length(xs->next) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 555]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L573] int n = __VERIFIER_nondet_int(); [L574] COND FALSE !(n < 1) VAL [n=1] [L577] CALL, EXPR new_ll(n) VAL [\old(n)=1] [L548] COND FALSE !(n == 0) [L550] node_t* head = malloc(sizeof(node_t)); [L551] head->val = n VAL [\old(n)=1, head={-1:0}, n=1] [L552] CALL, EXPR new_ll(n-1) VAL [\old(n)=0] [L548] COND TRUE n == 0 [L549] return ((void *)0); VAL [\old(n)=0, \result={0:0}] [L552] RET, EXPR new_ll(n-1) VAL [\old(n)=1, head={-1:0}, n=1] [L552] head->next = new_ll(n-1) [L553] return head; VAL [\old(n)=1, \result={-1:0}, n=1] [L577] RET, EXPR new_ll(n) VAL [n=1] [L577] node_t* x = new_ll(n); [L578] CALL, EXPR append(x, x) [L563] COND FALSE !(x == ((void *)0)) [L565] node_t* s = x; VAL [s={-1:0}, x={-1:0}, y={-1:0}] [L566] EXPR x->next [L566] COND FALSE !(x->next != ((void *)0)) [L568] x->next = y [L569] return s; VAL [\result={-1:0}] [L578] RET, EXPR append(x, x) [L578] node_t* y = append(x, x); [L579] CALL length(y) VAL [\old(xs)={-1:0}] Loop: [L557] COND FALSE !(xs == ((void *)0)) [L559] EXPR xs->next [L559] CALL length(xs->next) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-19 14:21:15,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-19 14:21:15,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)