./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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/list-ext-properties/test-0232_1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash b36390e4ace21fb538f0c1df6f562bcf2825b5901fb45d9987e6242615034592 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 20:17:16,496 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 20:17:16,538 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-17 20:17:16,543 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 20:17:16,545 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 20:17:16,545 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-17 20:17:16,567 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 20:17:16,568 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 20:17:16,568 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 20:17:16,568 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 20:17:16,568 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 20:17:16,569 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 20:17:16,569 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 20:17:16,569 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 20:17:16,569 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-17 20:17:16,570 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-17 20:17:16,570 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-17 20:17:16,570 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-17 20:17:16,570 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-17 20:17:16,570 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-17 20:17:16,570 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 20:17:16,570 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-17 20:17:16,571 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 20:17:16,571 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 20:17:16,571 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 20:17:16,571 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 20:17:16,571 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-17 20:17:16,571 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-17 20:17:16,571 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-17 20:17:16,571 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 20:17:16,571 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 20:17:16,571 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 20:17:16,571 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-17 20:17:16,571 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 20:17:16,571 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 20:17:16,571 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 20:17:16,571 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 20:17:16,571 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 20:17:16,571 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 20:17:16,572 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-17 20:17:16,572 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b36390e4ace21fb538f0c1df6f562bcf2825b5901fb45d9987e6242615034592 [2025-03-17 20:17:16,770 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 20:17:16,778 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 20:17:16,779 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 20:17:16,780 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 20:17:16,781 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 20:17:16,782 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2025-03-17 20:17:17,995 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3c3a2c02/50c7f23a6e634b6d92bda3c4ea0f835c/FLAG478612a73 [2025-03-17 20:17:18,269 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 20:17:18,269 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2025-03-17 20:17:18,287 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3c3a2c02/50c7f23a6e634b6d92bda3c4ea0f835c/FLAG478612a73 [2025-03-17 20:17:18,547 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3c3a2c02/50c7f23a6e634b6d92bda3c4ea0f835c [2025-03-17 20:17:18,549 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 20:17:18,549 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 20:17:18,550 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 20:17:18,550 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 20:17:18,553 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 20:17:18,554 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:17:18" (1/1) ... [2025-03-17 20:17:18,554 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55efa566 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:18, skipping insertion in model container [2025-03-17 20:17:18,555 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:17:18" (1/1) ... [2025-03-17 20:17:18,578 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 20:17:18,753 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 20:17:18,761 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 20:17:18,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 20:17:18,810 INFO L204 MainTranslator]: Completed translation [2025-03-17 20:17:18,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:18 WrapperNode [2025-03-17 20:17:18,811 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 20:17:18,812 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 20:17:18,812 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 20:17:18,812 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 20:17:18,816 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:18" (1/1) ... [2025-03-17 20:17:18,824 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:18" (1/1) ... [2025-03-17 20:17:18,835 INFO L138 Inliner]: procedures = 126, calls = 33, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 86 [2025-03-17 20:17:18,835 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 20:17:18,836 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 20:17:18,836 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 20:17:18,836 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 20:17:18,842 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:18" (1/1) ... [2025-03-17 20:17:18,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:18" (1/1) ... [2025-03-17 20:17:18,846 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:18" (1/1) ... [2025-03-17 20:17:18,857 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 10, 8]. 50 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 5 writes are split as follows [0, 3, 2]. [2025-03-17 20:17:18,857 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:18" (1/1) ... [2025-03-17 20:17:18,858 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:18" (1/1) ... [2025-03-17 20:17:18,862 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:18" (1/1) ... [2025-03-17 20:17:18,866 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:18" (1/1) ... [2025-03-17 20:17:18,867 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:18" (1/1) ... [2025-03-17 20:17:18,871 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:18" (1/1) ... [2025-03-17 20:17:18,873 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 20:17:18,873 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 20:17:18,877 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 20:17:18,877 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 20:17:18,878 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:18" (1/1) ... [2025-03-17 20:17:18,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:18,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:18,903 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) [2025-03-17 20:17:18,905 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 [2025-03-17 20:17:18,923 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 20:17:18,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 20:17:18,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 20:17:18,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 20:17:18,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 20:17:18,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 20:17:18,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 20:17:18,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 20:17:18,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 20:17:18,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 20:17:18,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-17 20:17:18,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-17 20:17:18,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-17 20:17:18,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 20:17:18,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 20:17:18,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 20:17:18,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 20:17:18,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 20:17:19,020 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 20:17:19,022 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 20:17:19,169 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L541: call ULTIMATE.dealloc(main_~#list~0#1.base, main_~#list~0#1.offset);havoc main_~#list~0#1.base, main_~#list~0#1.offset; [2025-03-17 20:17:19,176 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-03-17 20:17:19,176 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 20:17:19,181 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 20:17:19,182 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 20:17:19,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:17:19 BoogieIcfgContainer [2025-03-17 20:17:19,182 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 20:17:19,183 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-17 20:17:19,183 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-17 20:17:19,188 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-17 20:17:19,188 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:17:19,188 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.03 08:17:18" (1/3) ... [2025-03-17 20:17:19,190 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5436764b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 08:17:19, skipping insertion in model container [2025-03-17 20:17:19,190 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:17:19,190 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:17:18" (2/3) ... [2025-03-17 20:17:19,190 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5436764b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 08:17:19, skipping insertion in model container [2025-03-17 20:17:19,190 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:17:19,191 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:17:19" (3/3) ... [2025-03-17 20:17:19,191 INFO L363 chiAutomizerObserver]: Analyzing ICFG test-0232_1-1.i [2025-03-17 20:17:19,232 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-17 20:17:19,232 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-17 20:17:19,232 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-17 20:17:19,232 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-17 20:17:19,232 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-17 20:17:19,232 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-17 20:17:19,232 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-17 20:17:19,232 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-17 20:17:19,236 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:17:19,247 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2025-03-17 20:17:19,248 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:17:19,248 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:17:19,253 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 20:17:19,254 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 20:17:19,254 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-17 20:17:19,254 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:17:19,255 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2025-03-17 20:17:19,255 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:17:19,255 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:17:19,255 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 20:17:19,256 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 20:17:19,259 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~c~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post11#1, main_#t~nondet12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~post22#1, main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~length~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$#1(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_~length~0#1 := 0;" [2025-03-17 20:17:19,259 INFO L754 eck$LassoCheckResult]: Loop: "assume true;assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$#1(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$#2(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$#2(append_~item~0#1.base, append_~item~0#1.offset, 4);" "assume append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0;call append_#t~mem7#1.base, append_#t~mem7#1.offset := read~$Pointer$#2(append_~item~0#1.base, append_~item~0#1.offset, 4);call append_#t~mem8#1.base, append_#t~mem8#1.offset := read~$Pointer$#2(append_#t~mem7#1.base, 4 + append_#t~mem7#1.offset, 4);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~mem8#1.base, append_#t~mem8#1.offset;" "call write~$Pointer$#2(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset;call write~$Pointer$#1(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4);havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;havoc append_#in~plist#1.base, append_#in~plist#1.offset;assume { :end_inline_append } true;main_#t~post11#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;havoc main_#t~nondet12#1;" "assume 0 != main_#t~nondet12#1 && ~c~0 < 20;havoc main_#t~nondet12#1;" [2025-03-17 20:17:19,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:17:19,265 INFO L85 PathProgramCache]: Analyzing trace with hash 48, now seen corresponding path program 1 times [2025-03-17 20:17:19,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:17:19,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006436689] [2025-03-17 20:17:19,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:17:19,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:17:19,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:17:19,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:17:19,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:19,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:19,340 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:17:19,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:17:19,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:17:19,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:19,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:19,367 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:17:19,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:17:19,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1383261, now seen corresponding path program 1 times [2025-03-17 20:17:19,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:17:19,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10728029] [2025-03-17 20:17:19,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:17:19,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:17:19,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:17:19,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:17:19,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:19,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:19,425 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:17:19,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:17:19,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:17:19,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:19,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:19,451 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:17:19,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:17:19,455 INFO L85 PathProgramCache]: Analyzing trace with hash 44788748, now seen corresponding path program 1 times [2025-03-17 20:17:19,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:17:19,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003006376] [2025-03-17 20:17:19,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:17:19,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:17:19,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:17:19,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:17:19,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:19,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:17:19,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:17:19,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:17:19,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003006376] [2025-03-17 20:17:19,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003006376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:17:19,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:17:19,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 20:17:19,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802203745] [2025-03-17 20:17:19,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:17:21,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:17:21,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 20:17:21,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 20:17:21,031 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:17:21,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:17:21,077 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2025-03-17 20:17:21,079 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2025-03-17 20:17:21,080 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2025-03-17 20:17:21,084 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 12 states and 16 transitions. [2025-03-17 20:17:21,085 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2025-03-17 20:17:21,085 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2025-03-17 20:17:21,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2025-03-17 20:17:21,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:17:21,086 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2025-03-17 20:17:21,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2025-03-17 20:17:21,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2025-03-17 20:17:21,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:17:21,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2025-03-17 20:17:21,102 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 15 transitions. [2025-03-17 20:17:21,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 20:17:21,106 INFO L432 stractBuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2025-03-17 20:17:21,106 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-17 20:17:21,106 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2025-03-17 20:17:21,107 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2025-03-17 20:17:21,107 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:17:21,107 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:17:21,107 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-17 20:17:21,107 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 20:17:21,107 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~c~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post11#1, main_#t~nondet12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~post22#1, main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~length~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$#1(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_~length~0#1 := 0;" "assume true;assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$#1(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$#2(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$#2(append_~item~0#1.base, append_~item~0#1.offset, 4);" "assume !(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);call append_#t~malloc9#1.base, append_#t~malloc9#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~malloc9#1.base, append_#t~malloc9#1.offset;" [2025-03-17 20:17:21,107 INFO L754 eck$LassoCheckResult]: Loop: "call write~$Pointer$#2(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset;call write~$Pointer$#1(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4);havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;havoc append_#in~plist#1.base, append_#in~plist#1.offset;assume { :end_inline_append } true;main_#t~post11#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;havoc main_#t~nondet12#1;" "assume 0 != main_#t~nondet12#1 && ~c~0 < 20;havoc main_#t~nondet12#1;" "assume true;assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$#1(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$#2(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$#2(append_~item~0#1.base, append_~item~0#1.offset, 4);" "assume append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0;call append_#t~mem7#1.base, append_#t~mem7#1.offset := read~$Pointer$#2(append_~item~0#1.base, append_~item~0#1.offset, 4);call append_#t~mem8#1.base, append_#t~mem8#1.offset := read~$Pointer$#2(append_#t~mem7#1.base, 4 + append_#t~mem7#1.offset, 4);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~mem8#1.base, append_#t~mem8#1.offset;" [2025-03-17 20:17:21,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:17:21,108 INFO L85 PathProgramCache]: Analyzing trace with hash 46607, now seen corresponding path program 1 times [2025-03-17 20:17:21,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:17:21,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494471966] [2025-03-17 20:17:21,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:17:21,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:17:21,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:17:21,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:17:21,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:21,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:21,130 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:17:21,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:17:21,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:17:21,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:21,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:21,140 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:17:21,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:17:21,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1291101, now seen corresponding path program 2 times [2025-03-17 20:17:21,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:17:21,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055259319] [2025-03-17 20:17:21,140 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:17:21,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:17:21,149 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:17:21,158 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:17:21,158 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:17:21,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:21,159 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:17:21,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:17:21,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:17:21,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:21,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:21,174 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:17:21,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:17:21,174 INFO L85 PathProgramCache]: Analyzing trace with hash 93237867, now seen corresponding path program 1 times [2025-03-17 20:17:21,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:17:21,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850821825] [2025-03-17 20:17:21,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:17:21,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:17:21,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 20:17:21,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 20:17:21,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:21,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:21,215 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:17:21,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 20:17:21,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 20:17:21,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:21,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:21,239 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:17:22,838 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:17:22,839 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:17:22,839 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:17:22,840 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:17:22,840 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:17:22,840 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:22,840 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:17:22,840 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:17:22,840 INFO L132 ssoRankerPreferences]: Filename of dumped script: test-0232_1-1.i_Iteration2_Lasso [2025-03-17 20:17:22,840 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:17:22,841 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:17:22,864 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:22,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:22,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:22,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:22,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:22,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:22,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:22,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:22,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:22,890 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:22,893 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:22,894 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:22,896 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:22,897 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:22,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:22,899 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:22,902 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:22,908 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:22,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:22,916 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:22,917 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:22,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:22,920 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:22,921 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:22,923 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:22,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:23,776 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:23,778 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:23,779 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:23,781 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:23,784 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:23,786 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:23,788 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:23,792 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:23,793 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:23,796 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:23,797 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:23,799 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:23,801 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:23,803 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:23,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:23,813 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:23,814 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:23,820 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:23,822 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:23,825 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:23,826 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:24,384 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:17:24,387 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:17:24,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:24,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:24,389 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) [2025-03-17 20:17:24,391 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 [2025-03-17 20:17:24,393 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:17:24,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:17:24,404 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:17:24,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:17:24,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:17:24,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:17:24,408 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:17:24,408 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:17:24,414 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:17:24,420 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 [2025-03-17 20:17:24,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:24,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:24,423 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) [2025-03-17 20:17:24,423 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 [2025-03-17 20:17:24,426 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:17:24,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:17:24,437 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:17:24,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:17:24,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:17:24,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:17:24,438 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:17:24,438 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:17:24,439 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:17:24,447 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 [2025-03-17 20:17:24,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:24,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:24,451 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) [2025-03-17 20:17:24,451 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 [2025-03-17 20:17:24,452 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:17:24,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:17:24,462 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:17:24,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:17:24,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:17:24,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:17:24,465 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:17:24,465 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:17:24,466 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:17:24,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-03-17 20:17:24,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:24,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:24,474 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) [2025-03-17 20:17:24,474 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 [2025-03-17 20:17:24,475 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:17:24,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:17:24,486 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:17:24,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:17:24,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:17:24,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:17:24,486 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:17:24,486 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:17:24,487 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:17:24,493 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 [2025-03-17 20:17:24,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:24,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:24,495 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) [2025-03-17 20:17:24,496 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 [2025-03-17 20:17:24,496 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:17:24,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:17:24,506 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:17:24,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:17:24,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:17:24,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:17:24,506 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:17:24,507 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:17:24,508 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:17:24,513 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 [2025-03-17 20:17:24,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:24,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:24,515 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) [2025-03-17 20:17:24,515 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 [2025-03-17 20:17:24,516 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:17:24,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:17:24,526 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:17:24,527 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:17:24,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:17:24,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:17:24,527 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:17:24,527 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:17:24,528 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:17:24,533 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 [2025-03-17 20:17:24,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:24,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:24,535 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) [2025-03-17 20:17:24,548 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 [2025-03-17 20:17:24,549 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:17:24,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:17:24,559 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:17:24,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:17:24,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:17:24,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:17:24,560 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:17:24,560 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:17:24,561 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:17:24,569 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 [2025-03-17 20:17:24,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:24,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:24,571 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) [2025-03-17 20:17:24,573 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 [2025-03-17 20:17:24,574 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:17:24,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:17:24,583 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:17:24,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:17:24,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:17:24,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:17:24,584 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:17:24,584 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:17:24,585 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:17:24,590 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 [2025-03-17 20:17:24,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:24,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:24,592 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) [2025-03-17 20:17:24,593 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 [2025-03-17 20:17:24,593 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:17:24,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:17:24,603 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:17:24,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:17:24,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:17:24,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:17:24,603 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:17:24,603 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:17:24,604 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:17:24,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-03-17 20:17:24,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:24,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:24,612 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) [2025-03-17 20:17:24,613 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 [2025-03-17 20:17:24,615 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:17:24,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:17:24,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:17:24,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:17:24,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:17:24,628 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:17:24,631 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:17:24,634 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:17:24,639 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 [2025-03-17 20:17:24,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:24,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:24,642 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) [2025-03-17 20:17:24,644 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 [2025-03-17 20:17:24,644 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:17:24,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:17:24,654 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:17:24,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:17:24,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:17:24,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:17:24,655 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:17:24,655 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:17:24,657 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:17:24,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-03-17 20:17:24,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:24,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:24,665 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) [2025-03-17 20:17:24,666 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 [2025-03-17 20:17:24,667 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:17:24,679 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:17:24,679 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:17:24,679 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:17:24,679 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:17:24,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:17:24,680 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:17:24,680 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:17:24,682 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:17:24,687 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Exception during sending of exit command (exit): Broken pipe [2025-03-17 20:17:24,689 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 [2025-03-17 20:17:24,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:24,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:24,693 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) [2025-03-17 20:17:24,694 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 [2025-03-17 20:17:24,696 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:17:24,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:17:24,706 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:17:24,706 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:17:24,706 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:17:24,706 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:17:24,706 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:17:24,706 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:17:24,707 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:17:24,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-03-17 20:17:24,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:24,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:24,715 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) [2025-03-17 20:17:24,717 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 [2025-03-17 20:17:24,718 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:17:24,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:17:24,728 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:17:24,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:17:24,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:17:24,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:17:24,729 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:17:24,730 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:17:24,731 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:17:24,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-03-17 20:17:24,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:24,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:24,739 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) [2025-03-17 20:17:24,740 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 [2025-03-17 20:17:24,743 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:17:24,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:17:24,753 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:17:24,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:17:24,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:17:24,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:17:24,754 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:17:24,754 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:17:24,755 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:17:24,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-03-17 20:17:24,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:24,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:24,762 INFO L229 MonitoredProcess]: Starting monitored process 17 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) [2025-03-17 20:17:24,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-03-17 20:17:24,764 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:17:24,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:17:24,774 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:17:24,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:17:24,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:17:24,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:17:24,774 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:17:24,774 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:17:24,775 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:17:24,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-03-17 20:17:24,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:24,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:24,782 INFO L229 MonitoredProcess]: Starting monitored process 18 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) [2025-03-17 20:17:24,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-03-17 20:17:24,784 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:17:24,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:17:24,794 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:17:24,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:17:24,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:17:24,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:17:24,794 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:17:24,794 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:17:24,795 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:17:24,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-03-17 20:17:24,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:24,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:24,802 INFO L229 MonitoredProcess]: Starting monitored process 19 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) [2025-03-17 20:17:24,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-03-17 20:17:24,804 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:17:24,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:17:24,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:17:24,813 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:17:24,813 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:17:24,815 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:17:24,815 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:17:24,819 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:17:24,833 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-03-17 20:17:24,834 INFO L444 ModelExtractionUtils]: 0 out of 7 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-03-17 20:17:24,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:24,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:24,838 INFO L229 MonitoredProcess]: Starting monitored process 20 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) [2025-03-17 20:17:24,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-03-17 20:17:24,841 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:17:24,852 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 20:17:24,852 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:17:24,853 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~c~0) = -2*~c~0 + 39 Supporting invariants [] [2025-03-17 20:17:24,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-03-17 20:17:24,886 INFO L156 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2025-03-17 20:17:24,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:17:24,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:17:24,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:17:24,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:24,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:17:24,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:17:24,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:17:24,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:17:24,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:17:24,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:24,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:17:24,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 20:17:24,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:17:24,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:17:24,995 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-17 20:17:24,996 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 6 Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:17:25,025 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 6. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 20 states and 30 transitions. Complement of second has 6 states. [2025-03-17 20:17:25,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-17 20:17:25,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:17:25,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2025-03-17 20:17:25,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 3 letters. Loop has 4 letters. [2025-03-17 20:17:25,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:17:25,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 7 letters. Loop has 4 letters. [2025-03-17 20:17:25,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:17:25,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 3 letters. Loop has 8 letters. [2025-03-17 20:17:25,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:17:25,031 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 30 transitions. [2025-03-17 20:17:25,032 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-03-17 20:17:25,032 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 15 states and 21 transitions. [2025-03-17 20:17:25,032 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-17 20:17:25,032 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-17 20:17:25,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 21 transitions. [2025-03-17 20:17:25,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:17:25,032 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 21 transitions. [2025-03-17 20:17:25,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 21 transitions. [2025-03-17 20:17:25,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2025-03-17 20:17:25,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:17:25,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2025-03-17 20:17:25,033 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 20 transitions. [2025-03-17 20:17:25,034 INFO L432 stractBuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2025-03-17 20:17:25,034 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-17 20:17:25,034 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. [2025-03-17 20:17:25,034 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-03-17 20:17:25,034 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:17:25,034 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:17:25,034 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-17 20:17:25,034 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 20:17:25,035 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~c~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post11#1, main_#t~nondet12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~post22#1, main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~length~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$#1(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_~length~0#1 := 0;" "assume true;assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$#1(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$#2(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$#2(append_~item~0#1.base, append_~item~0#1.offset, 4);" "assume !(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);call append_#t~malloc9#1.base, append_#t~malloc9#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~malloc9#1.base, append_#t~malloc9#1.offset;" "call write~$Pointer$#2(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset;call write~$Pointer$#1(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4);havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;havoc append_#in~plist#1.base, append_#in~plist#1.offset;assume { :end_inline_append } true;main_#t~post11#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;havoc main_#t~nondet12#1;" "assume !(0 != main_#t~nondet12#1 && ~c~0 < 20);havoc main_#t~nondet12#1;" "assume !(main_~length~0#1 > 0);" [2025-03-17 20:17:25,035 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~length~0#1 > 0;call main_#t~mem19#1.base, main_#t~mem19#1.offset := read~$Pointer$#1(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call main_#t~mem20#1.base, main_#t~mem20#1.offset := read~$Pointer$#2(main_#t~mem19#1.base, main_#t~mem19#1.offset, 4);main_~next~1#1.base, main_~next~1#1.offset := main_#t~mem20#1.base, main_#t~mem20#1.offset;havoc main_#t~mem19#1.base, main_#t~mem19#1.offset;havoc main_#t~mem20#1.base, main_#t~mem20#1.offset;call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$#1(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call ULTIMATE.dealloc(main_#t~mem21#1.base, main_#t~mem21#1.offset);havoc main_#t~mem21#1.base, main_#t~mem21#1.offset;call write~$Pointer$#1(main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_#t~post22#1 := main_~length~0#1;main_~length~0#1 := main_#t~post22#1 - 1;havoc main_~next~1#1.base, main_~next~1#1.offset;havoc main_#t~post22#1;" [2025-03-17 20:17:25,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:17:25,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1388481019, now seen corresponding path program 1 times [2025-03-17 20:17:25,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:17:25,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591471679] [2025-03-17 20:17:25,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:17:25,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:17:25,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 20:17:25,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 20:17:25,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:25,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:17:25,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:17:25,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:17:25,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591471679] [2025-03-17 20:17:25,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591471679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:17:25,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:17:25,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 20:17:25,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413795514] [2025-03-17 20:17:25,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:17:25,086 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:17:25,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:17:25,086 INFO L85 PathProgramCache]: Analyzing trace with hash 35, now seen corresponding path program 1 times [2025-03-17 20:17:25,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:17:25,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121018918] [2025-03-17 20:17:25,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:17:25,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:17:25,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:17:25,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:17:25,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:25,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:25,094 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:17:25,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:17:25,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:17:25,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:25,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:25,099 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:17:25,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:17:25,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 20:17:25,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 20:17:25,205 INFO L87 Difference]: Start difference. First operand 14 states and 20 transitions. cyclomatic complexity: 8 Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:17:25,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:17:25,222 INFO L93 Difference]: Finished difference Result 14 states and 18 transitions. [2025-03-17 20:17:25,222 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 18 transitions. [2025-03-17 20:17:25,223 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-03-17 20:17:25,223 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 18 transitions. [2025-03-17 20:17:25,223 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-17 20:17:25,223 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-17 20:17:25,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 18 transitions. [2025-03-17 20:17:25,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:17:25,223 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 18 transitions. [2025-03-17 20:17:25,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 18 transitions. [2025-03-17 20:17:25,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-03-17 20:17:25,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:17:25,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2025-03-17 20:17:25,224 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 18 transitions. [2025-03-17 20:17:25,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 20:17:25,227 INFO L432 stractBuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2025-03-17 20:17:25,227 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-17 20:17:25,227 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2025-03-17 20:17:25,227 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-03-17 20:17:25,227 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:17:25,227 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:17:25,227 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:17:25,227 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 20:17:25,228 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~c~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post11#1, main_#t~nondet12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~post22#1, main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~length~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$#1(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_~length~0#1 := 0;" "assume true;assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$#1(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$#2(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$#2(append_~item~0#1.base, append_~item~0#1.offset, 4);" "assume !(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);call append_#t~malloc9#1.base, append_#t~malloc9#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~malloc9#1.base, append_#t~malloc9#1.offset;" "call write~$Pointer$#2(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset;call write~$Pointer$#1(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4);havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;havoc append_#in~plist#1.base, append_#in~plist#1.offset;assume { :end_inline_append } true;main_#t~post11#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;havoc main_#t~nondet12#1;" "assume !(0 != main_#t~nondet12#1 && ~c~0 < 20);havoc main_#t~nondet12#1;" "assume main_~length~0#1 > 0;" "assume !(main_~length~0#1 < 0);" "call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$#1(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$#2(main_#t~mem15#1.base, main_#t~mem15#1.offset, 4);main_~next~0#1.base, main_~next~0#1.offset := main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$#1(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call ULTIMATE.dealloc(main_#t~mem17#1.base, main_#t~mem17#1.offset);havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;call write~$Pointer$#1(main_~next~0#1.base, main_~next~0#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_#t~post18#1 := main_~length~0#1;main_~length~0#1 := main_#t~post18#1 - 1;havoc main_~next~0#1.base, main_~next~0#1.offset;havoc main_#t~post18#1;" [2025-03-17 20:17:25,228 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~length~0#1 > 0;call main_#t~mem19#1.base, main_#t~mem19#1.offset := read~$Pointer$#1(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call main_#t~mem20#1.base, main_#t~mem20#1.offset := read~$Pointer$#2(main_#t~mem19#1.base, main_#t~mem19#1.offset, 4);main_~next~1#1.base, main_~next~1#1.offset := main_#t~mem20#1.base, main_#t~mem20#1.offset;havoc main_#t~mem19#1.base, main_#t~mem19#1.offset;havoc main_#t~mem20#1.base, main_#t~mem20#1.offset;call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$#1(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call ULTIMATE.dealloc(main_#t~mem21#1.base, main_#t~mem21#1.offset);havoc main_#t~mem21#1.base, main_#t~mem21#1.offset;call write~$Pointer$#1(main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_#t~post22#1 := main_~length~0#1;main_~length~0#1 := main_#t~post22#1 - 1;havoc main_~next~1#1.base, main_~next~1#1.offset;havoc main_#t~post22#1;" [2025-03-17 20:17:25,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:17:25,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1404570536, now seen corresponding path program 1 times [2025-03-17 20:17:25,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:17:25,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331163078] [2025-03-17 20:17:25,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:17:25,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:17:25,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 20:17:25,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 20:17:25,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:25,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:25,250 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:17:25,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 20:17:25,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 20:17:25,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:25,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:25,260 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:17:25,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:17:25,261 INFO L85 PathProgramCache]: Analyzing trace with hash 35, now seen corresponding path program 2 times [2025-03-17 20:17:25,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:17:25,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675782744] [2025-03-17 20:17:25,261 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:17:25,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:17:25,264 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:17:25,265 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:17:25,265 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:17:25,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:25,265 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:17:25,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:17:25,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:17:25,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:25,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:25,268 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:17:25,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:17:25,268 INFO L85 PathProgramCache]: Analyzing trace with hash -592013652, now seen corresponding path program 1 times [2025-03-17 20:17:25,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:17:25,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953154198] [2025-03-17 20:17:25,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:17:25,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:17:25,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 20:17:25,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 20:17:25,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:25,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:17:25,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:17:25,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:17:25,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953154198] [2025-03-17 20:17:25,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953154198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:17:25,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:17:25,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 20:17:25,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973810644] [2025-03-17 20:17:25,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:17:25,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:17:25,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 20:17:25,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 20:17:25,413 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. cyclomatic complexity: 6 Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:17:25,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:17:25,438 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2025-03-17 20:17:25,439 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 30 transitions. [2025-03-17 20:17:25,439 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-03-17 20:17:25,439 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 19 states and 25 transitions. [2025-03-17 20:17:25,439 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-03-17 20:17:25,440 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-17 20:17:25,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 25 transitions. [2025-03-17 20:17:25,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:17:25,440 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 25 transitions. [2025-03-17 20:17:25,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 25 transitions. [2025-03-17 20:17:25,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2025-03-17 20:17:25,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:17:25,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2025-03-17 20:17:25,441 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 17 transitions. [2025-03-17 20:17:25,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 20:17:25,443 INFO L432 stractBuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2025-03-17 20:17:25,443 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-17 20:17:25,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2025-03-17 20:17:25,444 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-03-17 20:17:25,444 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:17:25,444 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:17:25,444 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 20:17:25,444 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 20:17:25,445 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~c~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post11#1, main_#t~nondet12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~post22#1, main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~length~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$#1(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_~length~0#1 := 0;" "assume true;assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$#1(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$#2(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$#2(append_~item~0#1.base, append_~item~0#1.offset, 4);" "assume !(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);call append_#t~malloc9#1.base, append_#t~malloc9#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~malloc9#1.base, append_#t~malloc9#1.offset;" "call write~$Pointer$#2(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset;call write~$Pointer$#1(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4);havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;havoc append_#in~plist#1.base, append_#in~plist#1.offset;assume { :end_inline_append } true;main_#t~post11#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;havoc main_#t~nondet12#1;" "assume 0 != main_#t~nondet12#1 && ~c~0 < 20;havoc main_#t~nondet12#1;" "assume true;assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$#1(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$#2(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$#2(append_~item~0#1.base, append_~item~0#1.offset, 4);" "assume !(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);call append_#t~malloc9#1.base, append_#t~malloc9#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~malloc9#1.base, append_#t~malloc9#1.offset;" "call write~$Pointer$#2(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset;call write~$Pointer$#1(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4);havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;havoc append_#in~plist#1.base, append_#in~plist#1.offset;assume { :end_inline_append } true;main_#t~post11#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;havoc main_#t~nondet12#1;" "assume !(0 != main_#t~nondet12#1 && ~c~0 < 20);havoc main_#t~nondet12#1;" "assume main_~length~0#1 > 0;" "assume !(main_~length~0#1 < 0);" "call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$#1(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$#2(main_#t~mem15#1.base, main_#t~mem15#1.offset, 4);main_~next~0#1.base, main_~next~0#1.offset := main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$#1(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call ULTIMATE.dealloc(main_#t~mem17#1.base, main_#t~mem17#1.offset);havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;call write~$Pointer$#1(main_~next~0#1.base, main_~next~0#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_#t~post18#1 := main_~length~0#1;main_~length~0#1 := main_#t~post18#1 - 1;havoc main_~next~0#1.base, main_~next~0#1.offset;havoc main_#t~post18#1;" [2025-03-17 20:17:25,445 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~length~0#1 > 0;call main_#t~mem19#1.base, main_#t~mem19#1.offset := read~$Pointer$#1(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call main_#t~mem20#1.base, main_#t~mem20#1.offset := read~$Pointer$#2(main_#t~mem19#1.base, main_#t~mem19#1.offset, 4);main_~next~1#1.base, main_~next~1#1.offset := main_#t~mem20#1.base, main_#t~mem20#1.offset;havoc main_#t~mem19#1.base, main_#t~mem19#1.offset;havoc main_#t~mem20#1.base, main_#t~mem20#1.offset;call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$#1(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call ULTIMATE.dealloc(main_#t~mem21#1.base, main_#t~mem21#1.offset);havoc main_#t~mem21#1.base, main_#t~mem21#1.offset;call write~$Pointer$#1(main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_#t~post22#1 := main_~length~0#1;main_~length~0#1 := main_#t~post22#1 - 1;havoc main_~next~1#1.base, main_~next~1#1.offset;havoc main_#t~post22#1;" [2025-03-17 20:17:25,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:17:25,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1161156069, now seen corresponding path program 1 times [2025-03-17 20:17:25,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:17:25,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182736009] [2025-03-17 20:17:25,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:17:25,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:17:25,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 20:17:25,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 20:17:25,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:25,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:17:25,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-03-17 20:17:25,646 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:17:25,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:17:25,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182736009] [2025-03-17 20:17:25,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182736009] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:17:25,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427332577] [2025-03-17 20:17:25,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:17:25,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:17:25,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:25,649 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:17:25,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-17 20:17:25,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 20:17:25,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 20:17:25,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:25,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:17:25,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-17 20:17:25,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:17:25,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 20:17:25,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-03-17 20:17:25,781 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:17:25,781 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:17:25,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2025-03-17 20:17:25,820 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:17:25,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427332577] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:17:25,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:17:25,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-03-17 20:17:25,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398941588] [2025-03-17 20:17:25,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:17:25,820 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:17:25,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:17:25,820 INFO L85 PathProgramCache]: Analyzing trace with hash 35, now seen corresponding path program 3 times [2025-03-17 20:17:25,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:17:25,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164402180] [2025-03-17 20:17:25,820 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:17:25,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:17:25,824 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:17:25,825 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:17:25,825 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 20:17:25,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:25,825 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:17:25,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:17:25,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:17:25,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:25,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:25,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:17:25,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:17:25,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 20:17:25,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 20:17:25,938 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:17:25,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:17:25,992 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2025-03-17 20:17:25,992 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 15 transitions. [2025-03-17 20:17:25,992 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-03-17 20:17:25,992 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 15 transitions. [2025-03-17 20:17:25,992 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-17 20:17:25,992 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-17 20:17:25,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 15 transitions. [2025-03-17 20:17:25,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:17:25,992 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 15 transitions. [2025-03-17 20:17:25,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 15 transitions. [2025-03-17 20:17:25,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-03-17 20:17:25,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:17:25,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2025-03-17 20:17:25,993 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 15 transitions. [2025-03-17 20:17:25,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 20:17:25,996 INFO L432 stractBuchiCegarLoop]: Abstraction has 14 states and 15 transitions. [2025-03-17 20:17:25,997 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-17 20:17:25,997 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 15 transitions. [2025-03-17 20:17:25,997 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-03-17 20:17:25,997 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:17:25,997 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:17:25,997 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:17:25,997 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 20:17:25,997 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~c~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post11#1, main_#t~nondet12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~post22#1, main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~length~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$#1(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_~length~0#1 := 0;" "assume true;assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$#1(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$#2(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$#2(append_~item~0#1.base, append_~item~0#1.offset, 4);" "assume !(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);call append_#t~malloc9#1.base, append_#t~malloc9#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~malloc9#1.base, append_#t~malloc9#1.offset;" "call write~$Pointer$#2(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset;call write~$Pointer$#1(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4);havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;havoc append_#in~plist#1.base, append_#in~plist#1.offset;assume { :end_inline_append } true;main_#t~post11#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;havoc main_#t~nondet12#1;" "assume 0 != main_#t~nondet12#1 && ~c~0 < 20;havoc main_#t~nondet12#1;" "assume true;assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$#1(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$#2(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$#2(append_~item~0#1.base, append_~item~0#1.offset, 4);" "assume append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0;call append_#t~mem7#1.base, append_#t~mem7#1.offset := read~$Pointer$#2(append_~item~0#1.base, append_~item~0#1.offset, 4);call append_#t~mem8#1.base, append_#t~mem8#1.offset := read~$Pointer$#2(append_#t~mem7#1.base, 4 + append_#t~mem7#1.offset, 4);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~mem8#1.base, append_#t~mem8#1.offset;" "call write~$Pointer$#2(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset;call write~$Pointer$#1(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4);havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;havoc append_#in~plist#1.base, append_#in~plist#1.offset;assume { :end_inline_append } true;main_#t~post11#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;havoc main_#t~nondet12#1;" "assume !(0 != main_#t~nondet12#1 && ~c~0 < 20);havoc main_#t~nondet12#1;" "assume main_~length~0#1 > 0;" "assume !(main_~length~0#1 < 0);" "call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$#1(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$#2(main_#t~mem15#1.base, main_#t~mem15#1.offset, 4);main_~next~0#1.base, main_~next~0#1.offset := main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$#1(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call ULTIMATE.dealloc(main_#t~mem17#1.base, main_#t~mem17#1.offset);havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;call write~$Pointer$#1(main_~next~0#1.base, main_~next~0#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_#t~post18#1 := main_~length~0#1;main_~length~0#1 := main_#t~post18#1 - 1;havoc main_~next~0#1.base, main_~next~0#1.offset;havoc main_#t~post18#1;" [2025-03-17 20:17:25,998 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~length~0#1 > 0;call main_#t~mem19#1.base, main_#t~mem19#1.offset := read~$Pointer$#1(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call main_#t~mem20#1.base, main_#t~mem20#1.offset := read~$Pointer$#2(main_#t~mem19#1.base, main_#t~mem19#1.offset, 4);main_~next~1#1.base, main_~next~1#1.offset := main_#t~mem20#1.base, main_#t~mem20#1.offset;havoc main_#t~mem19#1.base, main_#t~mem19#1.offset;havoc main_#t~mem20#1.base, main_#t~mem20#1.offset;call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$#1(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call ULTIMATE.dealloc(main_#t~mem21#1.base, main_#t~mem21#1.offset);havoc main_#t~mem21#1.base, main_#t~mem21#1.offset;call write~$Pointer$#1(main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_#t~post22#1 := main_~length~0#1;main_~length~0#1 := main_#t~post22#1 - 1;havoc main_~next~1#1.base, main_~next~1#1.offset;havoc main_#t~post22#1;" [2025-03-17 20:17:25,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:17:25,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1189785220, now seen corresponding path program 1 times [2025-03-17 20:17:25,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:17:25,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149098815] [2025-03-17 20:17:25,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:17:25,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:17:26,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 20:17:26,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 20:17:26,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:26,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:26,029 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:17:26,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 20:17:26,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 20:17:26,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:26,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:26,052 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:17:26,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:17:26,053 INFO L85 PathProgramCache]: Analyzing trace with hash 35, now seen corresponding path program 4 times [2025-03-17 20:17:26,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:17:26,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669097155] [2025-03-17 20:17:26,053 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 20:17:26,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:17:26,058 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1 statements into 2 equivalence classes. [2025-03-17 20:17:26,059 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:17:26,060 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 20:17:26,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:26,060 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:17:26,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:17:26,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:17:26,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:26,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:26,064 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:17:26,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:17:26,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1771363848, now seen corresponding path program 1 times [2025-03-17 20:17:26,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:17:26,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563625523] [2025-03-17 20:17:26,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:17:26,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:17:26,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 20:17:26,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 20:17:26,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:26,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:26,096 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:17:26,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 20:17:26,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 20:17:26,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:26,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:17:26,124 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:17:38,839 WARN L286 SmtUtils]: Spent 12.61s on a formula simplification. DAG size of input: 369 DAG size of output: 296 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-03-17 20:17:40,241 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:17:40,241 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:17:40,241 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:17:40,241 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:17:40,241 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:17:40,241 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:40,241 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:17:40,241 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:17:40,241 INFO L132 ssoRankerPreferences]: Filename of dumped script: test-0232_1-1.i_Iteration6_Lasso [2025-03-17 20:17:40,241 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:17:40,241 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:17:40,244 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:40,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:40,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:40,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:40,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:40,260 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:40,262 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:40,263 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:40,265 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:40,267 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:40,269 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:40,270 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:40,273 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:40,279 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:40,281 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:40,283 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:40,286 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:40,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:40,292 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:40,294 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:40,296 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:40,297 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:40,299 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:40,301 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:40,601 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:40,602 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:40,604 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:40,605 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:40,606 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:40,607 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:40,608 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:40,609 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:40,610 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:40,611 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:40,612 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:40,613 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:40,615 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:40,616 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:40,617 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:40,618 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:40,619 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:40,621 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:40,631 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:40,633 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:40,634 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:40,635 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:40,636 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:40,637 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:40,639 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:40,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:40,641 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:40,642 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:40,643 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:17:40,964 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:17:40,964 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:17:40,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:40,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:40,967 INFO L229 MonitoredProcess]: Starting monitored process 22 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) [2025-03-17 20:17:40,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-03-17 20:17:40,971 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:17:40,981 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:17:40,981 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:17:40,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:17:40,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:17:40,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:17:40,981 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:17:40,981 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:17:40,982 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:17:40,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-03-17 20:17:40,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:40,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:40,989 INFO L229 MonitoredProcess]: Starting monitored process 23 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) [2025-03-17 20:17:40,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-03-17 20:17:40,991 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:17:41,001 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:17:41,001 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:17:41,001 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:17:41,001 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:17:41,001 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:17:41,001 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:17:41,001 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:17:41,002 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:17:41,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-03-17 20:17:41,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:41,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:41,009 INFO L229 MonitoredProcess]: Starting monitored process 24 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) [2025-03-17 20:17:41,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-03-17 20:17:41,010 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:17:41,020 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:17:41,020 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:17:41,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:17:41,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:17:41,020 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:17:41,020 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:17:41,020 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:17:41,021 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:17:41,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-03-17 20:17:41,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:41,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:41,028 INFO L229 MonitoredProcess]: Starting monitored process 25 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) [2025-03-17 20:17:41,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-03-17 20:17:41,029 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:17:41,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:17:41,039 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:17:41,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:17:41,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:17:41,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:17:41,039 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:17:41,039 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:17:41,040 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:17:41,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-03-17 20:17:41,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:41,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:41,047 INFO L229 MonitoredProcess]: Starting monitored process 26 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) [2025-03-17 20:17:41,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-03-17 20:17:41,050 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:17:41,059 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:17:41,059 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:17:41,059 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:17:41,059 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:17:41,059 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:17:41,060 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:17:41,060 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:17:41,061 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:17:41,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-03-17 20:17:41,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:41,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:41,068 INFO L229 MonitoredProcess]: Starting monitored process 27 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) [2025-03-17 20:17:41,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-03-17 20:17:41,070 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:17:41,080 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:17:41,080 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:17:41,080 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:17:41,080 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:17:41,080 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:17:41,080 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:17:41,080 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:17:41,081 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:17:41,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-03-17 20:17:41,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:41,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:41,089 INFO L229 MonitoredProcess]: Starting monitored process 28 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) [2025-03-17 20:17:41,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-03-17 20:17:41,091 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:17:41,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:17:41,101 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:17:41,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:17:41,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:17:41,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:17:41,101 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:17:41,101 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:17:41,102 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:17:41,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-03-17 20:17:41,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:41,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:41,110 INFO L229 MonitoredProcess]: Starting monitored process 29 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) [2025-03-17 20:17:41,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-03-17 20:17:41,112 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:17:41,122 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:17:41,122 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:17:41,122 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:17:41,122 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:17:41,122 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:17:41,122 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:17:41,122 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:17:41,123 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:17:41,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-03-17 20:17:41,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:41,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:41,131 INFO L229 MonitoredProcess]: Starting monitored process 30 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) [2025-03-17 20:17:41,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-03-17 20:17:41,133 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:17:41,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:17:41,143 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:17:41,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:17:41,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:17:41,143 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:17:41,143 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:17:41,143 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:17:41,144 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:17:41,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-03-17 20:17:41,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:41,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:41,151 INFO L229 MonitoredProcess]: Starting monitored process 31 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) [2025-03-17 20:17:41,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-03-17 20:17:41,153 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:17:41,162 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:17:41,162 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:17:41,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:17:41,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:17:41,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:17:41,164 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:17:41,164 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:17:41,165 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:17:41,170 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-03-17 20:17:41,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:41,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:41,172 INFO L229 MonitoredProcess]: Starting monitored process 32 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) [2025-03-17 20:17:41,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-03-17 20:17:41,174 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:17:41,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:17:41,183 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:17:41,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:17:41,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:17:41,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:17:41,183 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:17:41,184 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:17:41,188 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:17:41,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-03-17 20:17:41,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:41,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:41,197 INFO L229 MonitoredProcess]: Starting monitored process 33 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) [2025-03-17 20:17:41,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-03-17 20:17:41,199 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:17:41,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:17:41,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:17:41,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:17:41,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:17:41,210 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:17:41,210 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:17:41,212 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:17:41,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-03-17 20:17:41,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:41,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:41,242 INFO L229 MonitoredProcess]: Starting monitored process 34 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) [2025-03-17 20:17:41,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-03-17 20:17:41,245 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:17:41,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:17:41,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:17:41,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:17:41,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:17:41,257 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:17:41,257 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:17:41,260 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:17:41,266 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-03-17 20:17:41,266 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-03-17 20:17:41,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:17:41,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:17:41,268 INFO L229 MonitoredProcess]: Starting monitored process 35 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) [2025-03-17 20:17:41,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-03-17 20:17:41,269 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:17:41,279 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 20:17:41,279 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:17:41,279 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length~0#1) = 1*ULTIMATE.start_main_~length~0#1 Supporting invariants [] [2025-03-17 20:17:41,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2025-03-17 20:17:41,296 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2025-03-17 20:17:41,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:17:41,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 20:17:41,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 20:17:41,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:41,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:17:41,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:17:41,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:17:41,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:17:41,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:17:41,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:17:41,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:17:41,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 20:17:41,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:17:41,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:17:41,365 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-03-17 20:17:41,366 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 15 transitions. cyclomatic complexity: 3 Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:17:41,369 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 15 transitions. cyclomatic complexity: 3. Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 15 states and 16 transitions. Complement of second has 2 states. [2025-03-17 20:17:41,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-17 20:17:41,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:17:41,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 11 transitions. [2025-03-17 20:17:41,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 12 letters. Loop has 1 letters. [2025-03-17 20:17:41,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:17:41,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 13 letters. Loop has 1 letters. [2025-03-17 20:17:41,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:17:41,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 12 letters. Loop has 2 letters. [2025-03-17 20:17:41,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:17:41,371 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 16 transitions. [2025-03-17 20:17:41,371 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-17 20:17:41,371 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 0 states and 0 transitions. [2025-03-17 20:17:41,371 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-17 20:17:41,371 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-17 20:17:41,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-17 20:17:41,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:17:41,371 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 20:17:41,371 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 20:17:41,371 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 20:17:41,371 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-17 20:17:41,371 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-17 20:17:41,371 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-17 20:17:41,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-17 20:17:41,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.03 08:17:41 BoogieIcfgContainer [2025-03-17 20:17:41,378 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-17 20:17:41,379 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 20:17:41,379 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 20:17:41,379 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 20:17:41,379 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:17:19" (3/4) ... [2025-03-17 20:17:41,381 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 20:17:41,382 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 20:17:41,384 INFO L158 Benchmark]: Toolchain (without parser) took 22832.83ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 111.5MB in the beginning and 101.0MB in the end (delta: 10.5MB). Peak memory consumption was 155.1MB. Max. memory is 16.1GB. [2025-03-17 20:17:41,384 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 128.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:17:41,384 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.13ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 94.2MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 20:17:41,384 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.42ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 93.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:17:41,385 INFO L158 Benchmark]: Boogie Preprocessor took 37.14ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 91.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:17:41,385 INFO L158 Benchmark]: IcfgBuilder took 309.05ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 75.1MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 20:17:41,385 INFO L158 Benchmark]: BuchiAutomizer took 22195.06ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 75.1MB in the beginning and 101.1MB in the end (delta: -26.0MB). Peak memory consumption was 121.6MB. Max. memory is 16.1GB. [2025-03-17 20:17:41,386 INFO L158 Benchmark]: Witness Printer took 3.29ms. Allocated memory is still 285.2MB. Free memory was 101.1MB in the beginning and 101.0MB in the end (delta: 83.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:17:41,388 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.20ms. Allocated memory is still 201.3MB. Free memory is still 128.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 261.13ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 94.2MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.42ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 93.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.14ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 91.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 309.05ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 75.1MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 22195.06ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 75.1MB in the beginning and 101.1MB in the end (delta: -26.0MB). Peak memory consumption was 121.6MB. Max. memory is 16.1GB. * Witness Printer took 3.29ms. Allocated memory is still 285.2MB. Free memory was 101.1MB in the beginning and 101.0MB in the end (delta: 83.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (4 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function (39 + ((long long) -2 * c)) and consists of 4 locations. One deterministic module has affine ranking function length and consists of 2 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 22.1s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 21.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 7 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 44 mSDsluCounter, 130 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 71 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 71 IncrementalHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 59 mSDtfsCounter, 71 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU2 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital642 mio100 ax102 hnf100 lsp92 ukn33 mio100 lsp25 div100 bol100 ite100 ukn100 eq161 hnf93 smp100 dnf250 smp83 tf100 neg100 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-03-17 20:17:41,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-03-17 20:17:41,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-03-17 20:17:41,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE