./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test17_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 798a7b37 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/ldv-memsafety/memleaks_test17_1-2.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 50151fd5b174ebc91ead294b24e8609853135da34cf3135980023271fd7c21f6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 16:01:08,127 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 16:01:08,178 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-04 16:01:08,181 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 16:01:08,181 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 16:01:08,181 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 16:01:08,203 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 16:01:08,204 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 16:01:08,204 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 16:01:08,205 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 16:01:08,205 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 16:01:08,206 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 16:01:08,206 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 16:01:08,206 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 16:01:08,206 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 16:01:08,206 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 16:01:08,206 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 16:01:08,206 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 16:01:08,207 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 16:01:08,207 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 16:01:08,207 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 16:01:08,207 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 16:01:08,207 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 16:01:08,207 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 16:01:08,207 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 16:01:08,207 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 16:01:08,207 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 16:01:08,207 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 16:01:08,207 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 16:01:08,207 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 16:01:08,208 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 16:01:08,208 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 16:01:08,208 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 16:01:08,208 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 16:01:08,208 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 16:01:08,208 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 16:01:08,208 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 16:01:08,208 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 16:01:08,208 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 16:01:08,209 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 16:01:08,209 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 -> 50151fd5b174ebc91ead294b24e8609853135da34cf3135980023271fd7c21f6 [2025-03-04 16:01:08,419 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 16:01:08,428 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 16:01:08,430 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 16:01:08,430 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 16:01:08,431 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 16:01:08,432 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test17_1-2.i [2025-03-04 16:01:09,526 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fda30fd73/90e9180eea6d43b1bea23a1650d43651/FLAG763887c9a [2025-03-04 16:01:09,796 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 16:01:09,797 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_1-2.i [2025-03-04 16:01:09,808 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fda30fd73/90e9180eea6d43b1bea23a1650d43651/FLAG763887c9a [2025-03-04 16:01:09,819 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fda30fd73/90e9180eea6d43b1bea23a1650d43651 [2025-03-04 16:01:09,820 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 16:01:09,821 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 16:01:09,822 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 16:01:09,822 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 16:01:09,825 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 16:01:09,826 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:01:09" (1/1) ... [2025-03-04 16:01:09,826 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a3c5206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:01:09, skipping insertion in model container [2025-03-04 16:01:09,826 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:01:09" (1/1) ... [2025-03-04 16:01:09,856 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 16:01:10,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 16:01:10,136 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 16:01:10,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 16:01:10,225 INFO L204 MainTranslator]: Completed translation [2025-03-04 16:01:10,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:01:10 WrapperNode [2025-03-04 16:01:10,226 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 16:01:10,227 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 16:01:10,227 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 16:01:10,228 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 16:01:10,233 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:01:10" (1/1) ... [2025-03-04 16:01:10,249 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:01:10" (1/1) ... [2025-03-04 16:01:10,269 INFO L138 Inliner]: procedures = 166, calls = 79, calls flagged for inlining = 30, calls inlined = 7, statements flattened = 89 [2025-03-04 16:01:10,271 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 16:01:10,271 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 16:01:10,271 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 16:01:10,271 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 16:01:10,277 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:01:10" (1/1) ... [2025-03-04 16:01:10,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:01:10" (1/1) ... [2025-03-04 16:01:10,279 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:01:10" (1/1) ... [2025-03-04 16:01:10,294 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-03-04 16:01:10,295 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:01:10" (1/1) ... [2025-03-04 16:01:10,297 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:01:10" (1/1) ... [2025-03-04 16:01:10,304 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:01:10" (1/1) ... [2025-03-04 16:01:10,304 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:01:10" (1/1) ... [2025-03-04 16:01:10,305 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:01:10" (1/1) ... [2025-03-04 16:01:10,305 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:01:10" (1/1) ... [2025-03-04 16:01:10,311 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 16:01:10,311 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 16:01:10,311 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 16:01:10,311 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 16:01:10,312 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:01:10" (1/1) ... [2025-03-04 16:01:10,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:10,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:10,339 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-04 16:01:10,341 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-04 16:01:10,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 16:01:10,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 16:01:10,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 16:01:10,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 16:01:10,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 16:01:10,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 16:01:10,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 16:01:10,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 16:01:10,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 16:01:10,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 16:01:10,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 16:01:10,441 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 16:01:10,443 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 16:01:10,542 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L527: havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; [2025-03-04 16:01:10,542 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L527-2: havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; [2025-03-04 16:01:10,554 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2025-03-04 16:01:10,554 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 16:01:10,560 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 16:01:10,560 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 16:01:10,560 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:01:10 BoogieIcfgContainer [2025-03-04 16:01:10,560 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 16:01:10,561 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 16:01:10,561 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 16:01:10,564 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 16:01:10,565 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:01:10,565 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 04:01:09" (1/3) ... [2025-03-04 16:01:10,566 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@72aaa02d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 04:01:10, skipping insertion in model container [2025-03-04 16:01:10,566 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:01:10,566 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:01:10" (2/3) ... [2025-03-04 16:01:10,566 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@72aaa02d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 04:01:10, skipping insertion in model container [2025-03-04 16:01:10,566 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:01:10,566 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:01:10" (3/3) ... [2025-03-04 16:01:10,567 INFO L363 chiAutomizerObserver]: Analyzing ICFG memleaks_test17_1-2.i [2025-03-04 16:01:10,602 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 16:01:10,602 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 16:01:10,602 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 16:01:10,602 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 16:01:10,602 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 16:01:10,603 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 16:01:10,603 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 16:01:10,603 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 16:01:10,609 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 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-04 16:01:10,620 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 7 [2025-03-04 16:01:10,621 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:01:10,621 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:01:10,624 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-04 16:01:10,624 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 16:01:10,624 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 16:01:10,624 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 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-04 16:01:10,625 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 7 [2025-03-04 16:01:10,626 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:01:10,626 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:01:10,626 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-04 16:01:10,626 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 16:01:10,630 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(8, 1);~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset, entry_point_#t~post49#1, entry_point_#t~ret50#1, entry_point_~i~2#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~2#1;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1;" "assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;" "entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset;" "assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0;" [2025-03-04 16:01:10,630 INFO L754 eck$LassoCheckResult]: Loop: "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" [2025-03-04 16:01:10,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:01:10,636 INFO L85 PathProgramCache]: Analyzing trace with hash 61995965, now seen corresponding path program 1 times [2025-03-04 16:01:10,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:01:10,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382358825] [2025-03-04 16:01:10,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:01:10,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:01:10,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:01:10,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:01:10,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:01:10,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:01:10,719 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:01:10,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:01:10,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:01:10,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:01:10,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:01:10,750 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:01:10,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:01:10,752 INFO L85 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 1 times [2025-03-04 16:01:10,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:01:10,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665776012] [2025-03-04 16:01:10,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:01:10,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:01:10,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 16:01:10,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 16:01:10,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:01:10,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:01:10,768 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:01:10,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 16:01:10,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 16:01:10,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:01:10,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:01:10,785 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:01:10,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:01:10,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1921874940, now seen corresponding path program 1 times [2025-03-04 16:01:10,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:01:10,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163583479] [2025-03-04 16:01:10,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:01:10,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:01:10,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 16:01:10,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 16:01:10,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:01:10,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:01:10,822 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:01:10,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 16:01:10,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 16:01:10,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:01:10,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:01:10,849 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:01:11,248 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:01:11,249 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:01:11,249 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:01:11,249 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:01:11,249 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 16:01:11,249 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:11,249 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:01:11,250 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:01:11,250 INFO L132 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_1-2.i_Iteration1_Lasso [2025-03-04 16:01:11,250 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:01:11,250 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:01:11,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:11,266 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:11,268 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:11,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:11,284 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:11,286 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:11,288 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:11,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:11,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:11,294 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:11,298 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:11,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:11,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:11,402 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:11,405 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:11,407 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:11,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:11,420 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:11,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:11,425 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:11,429 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:01:11,662 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:01:11,664 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 16:01:11,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:11,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:11,667 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-04 16:01:11,669 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-04 16:01:11,670 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-04 16:01:11,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:01:11,681 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:01:11,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:01:11,682 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:01:11,682 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:01:11,685 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:01:11,685 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:01:11,686 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:01:11,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-03-04 16:01:11,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:11,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:11,695 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-04 16:01:11,696 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-04 16:01:11,698 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-04 16:01:11,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:01:11,709 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:01:11,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:01:11,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:01:11,710 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:01:11,710 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:01:11,711 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:01:11,712 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:01:11,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-03-04 16:01:11,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:11,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:11,720 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-04 16:01:11,720 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-04 16:01:11,722 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-04 16:01:11,732 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:01:11,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:01:11,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:01:11,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:01:11,735 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:01:11,735 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:01:11,737 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:01:11,743 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-04 16:01:11,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:11,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:11,745 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-04 16:01:11,747 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-04 16:01:11,748 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-04 16:01:11,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:01:11,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:01:11,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:01:11,758 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:01:11,760 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:01:11,760 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:01:11,763 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:01:11,769 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-04 16:01:11,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:11,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:11,771 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-04 16:01:11,772 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-04 16:01:11,774 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-04 16:01:11,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:01:11,784 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:01:11,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:01:11,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:01:11,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:01:11,784 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:01:11,784 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:01:11,785 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:01:11,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-03-04 16:01:11,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:11,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:11,793 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-04 16:01:11,794 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-04 16:01:11,796 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-04 16:01:11,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:01:11,807 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:01:11,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:01:11,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:01:11,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:01:11,807 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:01:11,807 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:01:11,808 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:01:11,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-03-04 16:01:11,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:11,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:11,816 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-04 16:01:11,818 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-04 16:01:11,819 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-04 16:01:11,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:01:11,829 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:01:11,829 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:01:11,829 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:01:11,829 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:01:11,829 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:01:11,829 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:01:11,830 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:01:11,836 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-04 16:01:11,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:11,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:11,838 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-04 16:01:11,838 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-04 16:01:11,839 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-04 16:01:11,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:01:11,850 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:01:11,850 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:01:11,850 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:01:11,850 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:01:11,850 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:01:11,850 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:01:11,851 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:01:11,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-03-04 16:01:11,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:11,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:11,859 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-04 16:01:11,861 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-04 16:01:11,865 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:01:11,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:01:11,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:01:11,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:01:11,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:01:11,879 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:01:11,879 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:01:11,882 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:01:11,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-03-04 16:01:11,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:11,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:11,890 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-04 16:01:11,892 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-04 16:01:11,893 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-04 16:01:11,903 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:01:11,903 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:01:11,903 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:01:11,903 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:01:11,903 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:01:11,904 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:01:11,904 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:01:11,908 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:01:11,914 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-04 16:01:11,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:11,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:11,917 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-04 16:01:11,919 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-04 16:01:11,920 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-04 16:01:11,931 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:01:11,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:01:11,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:01:11,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:01:11,934 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:01:11,934 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:01:11,937 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:01:11,943 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-04 16:01:11,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:11,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:11,948 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-04 16:01:11,949 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-04 16:01:11,951 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-04 16:01:11,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:01:11,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:01:11,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:01:11,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:01:11,965 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:01:11,965 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:01:11,968 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:01:11,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-03-04 16:01:11,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:11,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:11,976 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-04 16:01:11,977 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-04 16:01:11,979 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-04 16:01:11,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:01:11,989 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:01:11,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:01:11,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:01:11,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:01:11,990 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:01:11,990 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:01:11,991 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:01:11,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-03-04 16:01:11,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:11,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:12,000 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-04 16:01:12,024 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-04 16:01:12,025 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-04 16:01:12,035 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:01:12,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:01:12,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:01:12,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:01:12,040 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:01:12,040 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:01:12,046 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 16:01:12,063 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2025-03-04 16:01:12,065 INFO L444 ModelExtractionUtils]: 5 out of 16 variables were initially zero. Simplification set additionally 8 variables to zero. [2025-03-04 16:01:12,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:01:12,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:12,068 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-04 16:01:12,070 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-04 16:01:12,072 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 16:01:12,083 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 16:01:12,083 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 16:01:12,084 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_entry_point_~i~2#1, ULTIMATE.start_entry_point_~len~0#1) = -1*ULTIMATE.start_entry_point_~i~2#1 + 1*ULTIMATE.start_entry_point_~len~0#1 Supporting invariants [] [2025-03-04 16:01:12,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-03-04 16:01:12,102 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2025-03-04 16:01:12,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:01:12,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 16:01:12,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 16:01:12,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:01:12,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:01:12,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 16:01:12,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:01:12,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 16:01:12,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 16:01:12,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:01:12,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:01:12,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 16:01:12,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:01:12,165 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-04 16:01:12,183 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-04 16:01:12,185 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 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 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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-04 16:01:12,206 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 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 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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) Result 25 states and 33 transitions. Complement of second has 3 states. [2025-03-04 16:01:12,208 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-04 16:01:12,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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-04 16:01:12,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 11 transitions. [2025-03-04 16:01:12,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 5 letters. Loop has 1 letters. [2025-03-04 16:01:12,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:01:12,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 6 letters. Loop has 1 letters. [2025-03-04 16:01:12,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:01:12,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 5 letters. Loop has 2 letters. [2025-03-04 16:01:12,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:01:12,218 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 33 transitions. [2025-03-04 16:01:12,219 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-03-04 16:01:12,222 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 16 states and 24 transitions. [2025-03-04 16:01:12,222 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2025-03-04 16:01:12,222 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2025-03-04 16:01:12,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 24 transitions. [2025-03-04 16:01:12,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:01:12,224 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 24 transitions. [2025-03-04 16:01:12,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 24 transitions. [2025-03-04 16:01:12,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2025-03-04 16:01:12,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 states have internal predecessors, (22), 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-04 16:01:12,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2025-03-04 16:01:12,240 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 22 transitions. [2025-03-04 16:01:12,240 INFO L432 stractBuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2025-03-04 16:01:12,240 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 16:01:12,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 22 transitions. [2025-03-04 16:01:12,240 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-03-04 16:01:12,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:01:12,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:01:12,241 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-04 16:01:12,241 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-04 16:01:12,241 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(8, 1);~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset, entry_point_#t~post49#1, entry_point_#t~ret50#1, entry_point_~i~2#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~2#1;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1;" "assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;" "entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset;" "assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0;" "assume !(entry_point_~i~2#1 < entry_point_~len~0#1);assume { :begin_inline_alloc_17 } true;alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset, alloc_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc alloc_17_#res#1;havoc alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset, alloc_17_#t~post43#1, alloc_17_#t~mem44#1.base, alloc_17_#t~mem44#1.offset, alloc_17_#t~post45#1, alloc_17_~array#1.base, alloc_17_~array#1.offset, alloc_17_~len#1, alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~i~0#1, alloc_17_~j~0#1;alloc_17_~array#1.base, alloc_17_~array#1.offset := alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset;alloc_17_~len#1 := alloc_17_#in~len#1;havoc alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset;alloc_17_~i~0#1 := 0;havoc alloc_17_~j~0#1;" [2025-03-04 16:01:12,241 INFO L754 eck$LassoCheckResult]: Loop: "assume alloc_17_~i~0#1 < alloc_17_~len#1;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1;" "assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;" "alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset := alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset;havoc alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset;" "assume !(alloc_17_~p~0#1.base == 0 && alloc_17_~p~0#1.offset == 0);call write~$Pointer$#1(alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~array#1.base, alloc_17_~array#1.offset + 4 * alloc_17_~i~0#1, 4);alloc_17_#t~post43#1 := alloc_17_~i~0#1;alloc_17_~i~0#1 := 1 + alloc_17_#t~post43#1;havoc alloc_17_#t~post43#1;" [2025-03-04 16:01:12,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:01:12,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1921874939, now seen corresponding path program 1 times [2025-03-04 16:01:12,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:01:12,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620174759] [2025-03-04 16:01:12,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:01:12,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:01:12,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 16:01:12,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 16:01:12,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:01:12,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:01:12,312 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-04 16:01:12,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:01:12,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620174759] [2025-03-04 16:01:12,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620174759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:01:12,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:01:12,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 16:01:12,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163122351] [2025-03-04 16:01:12,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:01:12,315 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 16:01:12,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:01:12,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1628477, now seen corresponding path program 1 times [2025-03-04 16:01:12,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:01:12,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869130702] [2025-03-04 16:01:12,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:01:12,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:01:12,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 16:01:12,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:01:12,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:01:12,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:01:12,325 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:01:12,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 16:01:12,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:01:12,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:01:12,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:01:12,340 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:01:12,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:01:12,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 16:01:12,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 16:01:12,509 INFO L87 Difference]: Start difference. First operand 15 states and 22 transitions. cyclomatic complexity: 11 Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-04 16:01:12,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:01:12,521 INFO L93 Difference]: Finished difference Result 15 states and 21 transitions. [2025-03-04 16:01:12,522 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 21 transitions. [2025-03-04 16:01:12,522 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-03-04 16:01:12,522 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 21 transitions. [2025-03-04 16:01:12,522 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2025-03-04 16:01:12,522 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2025-03-04 16:01:12,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 21 transitions. [2025-03-04 16:01:12,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:01:12,523 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 21 transitions. [2025-03-04 16:01:12,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 21 transitions. [2025-03-04 16:01:12,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-03-04 16:01:12,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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-04 16:01:12,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2025-03-04 16:01:12,524 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 21 transitions. [2025-03-04 16:01:12,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 16:01:12,525 INFO L432 stractBuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2025-03-04 16:01:12,525 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-04 16:01:12,525 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2025-03-04 16:01:12,525 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-03-04 16:01:12,525 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:01:12,525 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:01:12,526 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:01:12,526 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-04 16:01:12,526 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(8, 1);~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset, entry_point_#t~post49#1, entry_point_#t~ret50#1, entry_point_~i~2#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~2#1;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1;" "assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;" "entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset;" "assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume !(entry_point_~i~2#1 < entry_point_~len~0#1);assume { :begin_inline_alloc_17 } true;alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset, alloc_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc alloc_17_#res#1;havoc alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset, alloc_17_#t~post43#1, alloc_17_#t~mem44#1.base, alloc_17_#t~mem44#1.offset, alloc_17_#t~post45#1, alloc_17_~array#1.base, alloc_17_~array#1.offset, alloc_17_~len#1, alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~i~0#1, alloc_17_~j~0#1;alloc_17_~array#1.base, alloc_17_~array#1.offset := alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset;alloc_17_~len#1 := alloc_17_#in~len#1;havoc alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset;alloc_17_~i~0#1 := 0;havoc alloc_17_~j~0#1;" [2025-03-04 16:01:12,526 INFO L754 eck$LassoCheckResult]: Loop: "assume alloc_17_~i~0#1 < alloc_17_~len#1;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1;" "assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;" "alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset := alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset;havoc alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset;" "assume !(alloc_17_~p~0#1.base == 0 && alloc_17_~p~0#1.offset == 0);call write~$Pointer$#1(alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~array#1.base, alloc_17_~array#1.offset + 4 * alloc_17_~i~0#1, 4);alloc_17_#t~post43#1 := alloc_17_~i~0#1;alloc_17_~i~0#1 := 1 + alloc_17_#t~post43#1;havoc alloc_17_#t~post43#1;" [2025-03-04 16:01:12,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:01:12,526 INFO L85 PathProgramCache]: Analyzing trace with hash -551418980, now seen corresponding path program 1 times [2025-03-04 16:01:12,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:01:12,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259311735] [2025-03-04 16:01:12,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:01:12,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:01:12,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 16:01:12,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 16:01:12,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:01:12,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:01:12,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:01:12,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:01:12,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259311735] [2025-03-04 16:01:12,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259311735] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:01:12,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606464681] [2025-03-04 16:01:12,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:01:12,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:01:12,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:12,625 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 16:01:12,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 16:01:12,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 16:01:12,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 16:01:12,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:01:12,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:01:12,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 16:01:12,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:01:12,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:01:12,698 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:01:12,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:01:12,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606464681] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:01:12,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:01:12,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-04 16:01:12,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980181236] [2025-03-04 16:01:12,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:01:12,723 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 16:01:12,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:01:12,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1628477, now seen corresponding path program 2 times [2025-03-04 16:01:12,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:01:12,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670656661] [2025-03-04 16:01:12,724 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:01:12,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:01:12,730 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-03-04 16:01:12,735 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:01:12,735 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:01:12,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:01:12,735 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:01:12,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 16:01:12,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:01:12,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:01:12,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:01:12,744 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:01:12,836 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-04 16:01:12,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:01:12,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 16:01:12,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-04 16:01:12,907 INFO L87 Difference]: Start difference. First operand 15 states and 21 transitions. cyclomatic complexity: 10 Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:01:12,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:01:12,945 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. [2025-03-04 16:01:12,945 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 24 transitions. [2025-03-04 16:01:12,945 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-03-04 16:01:12,946 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 24 transitions. [2025-03-04 16:01:12,946 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2025-03-04 16:01:12,946 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2025-03-04 16:01:12,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions. [2025-03-04 16:01:12,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:01:12,946 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 24 transitions. [2025-03-04 16:01:12,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions. [2025-03-04 16:01:12,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-03-04 16:01:12,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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-04 16:01:12,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2025-03-04 16:01:12,947 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 24 transitions. [2025-03-04 16:01:12,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 16:01:12,948 INFO L432 stractBuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2025-03-04 16:01:12,948 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-04 16:01:12,948 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2025-03-04 16:01:12,948 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-03-04 16:01:12,948 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:01:12,948 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:01:12,948 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 1, 1, 1, 1, 1, 1] [2025-03-04 16:01:12,948 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-04 16:01:12,948 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(8, 1);~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset, entry_point_#t~post49#1, entry_point_#t~ret50#1, entry_point_~i~2#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~2#1;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1;" "assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;" "entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset;" "assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume !(entry_point_~i~2#1 < entry_point_~len~0#1);assume { :begin_inline_alloc_17 } true;alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset, alloc_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc alloc_17_#res#1;havoc alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset, alloc_17_#t~post43#1, alloc_17_#t~mem44#1.base, alloc_17_#t~mem44#1.offset, alloc_17_#t~post45#1, alloc_17_~array#1.base, alloc_17_~array#1.offset, alloc_17_~len#1, alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~i~0#1, alloc_17_~j~0#1;alloc_17_~array#1.base, alloc_17_~array#1.offset := alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset;alloc_17_~len#1 := alloc_17_#in~len#1;havoc alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset;alloc_17_~i~0#1 := 0;havoc alloc_17_~j~0#1;" [2025-03-04 16:01:12,948 INFO L754 eck$LassoCheckResult]: Loop: "assume alloc_17_~i~0#1 < alloc_17_~len#1;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1;" "assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;" "alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset := alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset;havoc alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset;" "assume !(alloc_17_~p~0#1.base == 0 && alloc_17_~p~0#1.offset == 0);call write~$Pointer$#1(alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~array#1.base, alloc_17_~array#1.offset + 4 * alloc_17_~i~0#1, 4);alloc_17_#t~post43#1 := alloc_17_~i~0#1;alloc_17_~i~0#1 := 1 + alloc_17_#t~post43#1;havoc alloc_17_#t~post43#1;" [2025-03-04 16:01:12,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:01:12,949 INFO L85 PathProgramCache]: Analyzing trace with hash 927128635, now seen corresponding path program 2 times [2025-03-04 16:01:12,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:01:12,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516237181] [2025-03-04 16:01:12,949 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:01:12,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:01:12,956 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-03-04 16:01:12,963 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 16:01:12,963 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 16:01:12,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:01:13,052 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:01:13,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:01:13,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516237181] [2025-03-04 16:01:13,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516237181] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:01:13,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922434734] [2025-03-04 16:01:13,053 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:01:13,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:01:13,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:01:13,055 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 16:01:13,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 16:01:13,094 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-03-04 16:01:13,109 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 16:01:13,109 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 16:01:13,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:01:13,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 16:01:13,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:01:13,163 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:01:13,163 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:01:13,223 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:01:13,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922434734] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:01:13,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:01:13,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2025-03-04 16:01:13,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154880829] [2025-03-04 16:01:13,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:01:13,224 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 16:01:13,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:01:13,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1628477, now seen corresponding path program 3 times [2025-03-04 16:01:13,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:01:13,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640761184] [2025-03-04 16:01:13,224 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 16:01:13,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:01:13,228 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 4 statements into 1 equivalence classes. [2025-03-04 16:01:13,233 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:01:13,233 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 16:01:13,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:01:13,233 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:01:13,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 16:01:13,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:01:13,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:01:13,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:01:13,238 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:01:13,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:01:13,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 16:01:13,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2025-03-04 16:01:13,418 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. cyclomatic complexity: 10 Second operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 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-04 16:01:13,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:01:13,492 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2025-03-04 16:01:13,492 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 30 transitions. [2025-03-04 16:01:13,493 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-03-04 16:01:13,493 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 30 transitions. [2025-03-04 16:01:13,493 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2025-03-04 16:01:13,493 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2025-03-04 16:01:13,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 30 transitions. [2025-03-04 16:01:13,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:01:13,493 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 30 transitions. [2025-03-04 16:01:13,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 30 transitions. [2025-03-04 16:01:13,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-03-04 16:01:13,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 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-04 16:01:13,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2025-03-04 16:01:13,495 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 30 transitions. [2025-03-04 16:01:13,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 16:01:13,495 INFO L432 stractBuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2025-03-04 16:01:13,495 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-04 16:01:13,496 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 30 transitions. [2025-03-04 16:01:13,496 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-03-04 16:01:13,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:01:13,496 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:01:13,496 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 1, 1, 1, 1, 1, 1] [2025-03-04 16:01:13,496 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-04 16:01:13,497 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(8, 1);~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset, entry_point_#t~post49#1, entry_point_#t~ret50#1, entry_point_~i~2#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~2#1;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1;" "assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;" "entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset;" "assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume !(entry_point_~i~2#1 < entry_point_~len~0#1);assume { :begin_inline_alloc_17 } true;alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset, alloc_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc alloc_17_#res#1;havoc alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset, alloc_17_#t~post43#1, alloc_17_#t~mem44#1.base, alloc_17_#t~mem44#1.offset, alloc_17_#t~post45#1, alloc_17_~array#1.base, alloc_17_~array#1.offset, alloc_17_~len#1, alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~i~0#1, alloc_17_~j~0#1;alloc_17_~array#1.base, alloc_17_~array#1.offset := alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset;alloc_17_~len#1 := alloc_17_#in~len#1;havoc alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset;alloc_17_~i~0#1 := 0;havoc alloc_17_~j~0#1;" [2025-03-04 16:01:13,497 INFO L754 eck$LassoCheckResult]: Loop: "assume alloc_17_~i~0#1 < alloc_17_~len#1;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1;" "assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;" "alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset := alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset;havoc alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset;" "assume !(alloc_17_~p~0#1.base == 0 && alloc_17_~p~0#1.offset == 0);call write~$Pointer$#1(alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~array#1.base, alloc_17_~array#1.offset + 4 * alloc_17_~i~0#1, 4);alloc_17_#t~post43#1 := alloc_17_~i~0#1;alloc_17_~i~0#1 := 1 + alloc_17_#t~post43#1;havoc alloc_17_#t~post43#1;" [2025-03-04 16:01:13,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:01:13,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1430720357, now seen corresponding path program 3 times [2025-03-04 16:01:13,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:01:13,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473116417] [2025-03-04 16:01:13,497 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 16:01:13,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:01:13,508 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 6 equivalence classes. [2025-03-04 16:01:13,528 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 16:01:13,528 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 16:01:13,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:01:13,529 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:01:13,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 16:01:13,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 16:01:13,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:01:13,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:01:13,552 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:01:13,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:01:13,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1628477, now seen corresponding path program 4 times [2025-03-04 16:01:13,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:01:13,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641471141] [2025-03-04 16:01:13,553 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 16:01:13,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:01:13,561 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 4 statements into 2 equivalence classes. [2025-03-04 16:01:13,567 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:01:13,567 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 16:01:13,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:01:13,567 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:01:13,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 16:01:13,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:01:13,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:01:13,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:01:13,579 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:01:13,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:01:13,579 INFO L85 PathProgramCache]: Analyzing trace with hash -850137897, now seen corresponding path program 1 times [2025-03-04 16:01:13,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:01:13,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470308682] [2025-03-04 16:01:13,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:01:13,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:01:13,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 16:01:13,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 16:01:13,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:01:13,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:01:13,626 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:01:13,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 16:01:13,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 16:01:13,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:01:13,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:01:13,660 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:02:29,269 WARN L286 SmtUtils]: Spent 1.26m on a formula simplification. DAG size of input: 342 DAG size of output: 295 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-03-04 16:02:30,685 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:02:30,685 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:02:30,685 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:02:30,685 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:02:30,685 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 16:02:30,685 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:30,685 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:02:30,685 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:02:30,686 INFO L132 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_1-2.i_Iteration5_Lasso [2025-03-04 16:02:30,686 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:02:30,686 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:02:30,688 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:30,690 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:30,691 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:30,693 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:30,704 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:30,706 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:30,707 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:30,717 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:30,719 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:30,721 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:30,724 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:30,725 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:30,727 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:30,729 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:30,731 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:30,733 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:30,735 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:30,737 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:30,739 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:30,741 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:30,742 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:30,745 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:30,746 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:30,748 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:30,749 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:30,751 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:30,753 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:30,754 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:30,756 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:30,758 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:30,760 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:30,761 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:31,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:02:31,728 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:02:31,728 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 16:02:31,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:31,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:31,731 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-04 16:02:31,739 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-04 16:02:31,740 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-04 16:02:31,750 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:31,750 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:02:31,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:31,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:31,751 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:31,751 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:02:31,751 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:02:31,752 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:31,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-03-04 16:02:31,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:31,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:31,760 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-04 16:02:31,760 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-04 16:02:31,762 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-04 16:02:31,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:31,771 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:02:31,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:31,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:31,771 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:31,772 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:02:31,772 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:02:31,773 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:31,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-03-04 16:02:31,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:31,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:31,780 INFO L229 MonitoredProcess]: Starting monitored process 21 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-04 16:02:31,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-03-04 16:02:31,783 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-04 16:02:31,793 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:31,793 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:02:31,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:31,793 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:31,793 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:31,793 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:02:31,793 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:02:31,794 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:31,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-03-04 16:02:31,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:31,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:31,802 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-04 16:02:31,803 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-04 16:02:31,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-04 16:02:31,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:31,814 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:31,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:31,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:31,815 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:02:31,815 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:02:31,817 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:31,823 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-04 16:02:31,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:31,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:31,825 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-04 16:02:31,826 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-04 16:02:31,827 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-04 16:02:31,837 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:31,837 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:31,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:31,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:31,838 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:02:31,838 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:02:31,840 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:31,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-03-04 16:02:31,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:31,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:31,848 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-04 16:02:31,848 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-04 16:02:31,849 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-04 16:02:31,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:31,859 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:02:31,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:31,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:31,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:31,860 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:02:31,860 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:02:31,861 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:31,867 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-04 16:02:31,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:31,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:31,869 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-04 16:02:31,870 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-04 16:02:31,871 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-04 16:02:31,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:31,882 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:02:31,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:31,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:31,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:31,884 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:02:31,884 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:02:31,885 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:31,891 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-04 16:02:31,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:31,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:31,893 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-04 16:02:31,894 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-04 16:02:31,894 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-04 16:02:31,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:31,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:31,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:31,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:31,905 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:02:31,905 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:02:31,907 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:31,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-03-04 16:02:31,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:31,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:31,915 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-04 16:02:31,917 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-04 16:02:31,918 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-04 16:02:31,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:31,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:31,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:31,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:31,929 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:02:31,929 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:02:31,931 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:31,937 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-04 16:02:31,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:31,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:31,939 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-04 16:02:31,941 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-04 16:02:31,942 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-04 16:02:31,952 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:31,952 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:02:31,952 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:31,952 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:31,952 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:31,953 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:02:31,953 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:02:31,955 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:31,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-03-04 16:02:31,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:31,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:31,964 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-04 16:02:31,966 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-04 16:02:31,967 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-04 16:02:31,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:31,977 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:31,977 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:31,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:31,978 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:02:31,978 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:02:31,980 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:31,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-03-04 16:02:31,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:31,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:31,989 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-04 16:02:31,991 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-04 16:02:31,992 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-04 16:02:32,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:32,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:32,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:32,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:32,003 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:02:32,003 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:02:32,006 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:32,012 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-04 16:02:32,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:32,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:32,014 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-04 16:02:32,015 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-04 16:02:32,016 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-04 16:02:32,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:32,026 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:02:32,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:32,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:32,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:32,026 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:02:32,026 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:02:32,027 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:32,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2025-03-04 16:02:32,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:32,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:32,035 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-04 16:02:32,036 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-04 16:02:32,037 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-04 16:02:32,046 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:32,047 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:02:32,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:32,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:32,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:32,047 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:02:32,047 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:02:32,048 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:32,053 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-04 16:02:32,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:32,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:32,055 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-04 16:02:32,056 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-04 16:02:32,057 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-04 16:02:32,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:32,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:32,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:32,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:32,068 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:02:32,068 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:02:32,070 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:32,075 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-04 16:02:32,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:32,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:32,077 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-04 16:02:32,079 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-04 16:02:32,079 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-04 16:02:32,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:32,089 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:02:32,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:32,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:32,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:32,090 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:02:32,090 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:02:32,091 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:32,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-03-04 16:02:32,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:32,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:32,098 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-04 16:02:32,100 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-04 16:02:32,101 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-04 16:02:32,110 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:32,110 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:32,110 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:32,110 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:32,111 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:02:32,111 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:02:32,113 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:32,119 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-04 16:02:32,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:32,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:32,121 INFO L229 MonitoredProcess]: Starting monitored process 36 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-04 16:02:32,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-03-04 16:02:32,123 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:02:32,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:32,132 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:02:32,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:32,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:32,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:32,132 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:02:32,132 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:02:32,133 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:32,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2025-03-04 16:02:32,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:32,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:32,141 INFO L229 MonitoredProcess]: Starting monitored process 37 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-04 16:02:32,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-03-04 16:02:32,142 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-04 16:02:32,152 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:32,152 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:02:32,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:32,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:32,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:32,152 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:02:32,152 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:02:32,153 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:32,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-03-04 16:02:32,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:32,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:32,160 INFO L229 MonitoredProcess]: Starting monitored process 38 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-04 16:02:32,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-03-04 16:02:32,162 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-04 16:02:32,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:32,171 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:02:32,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:32,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:32,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:32,176 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:02:32,176 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:02:32,177 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:32,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-03-04 16:02:32,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:32,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:32,185 INFO L229 MonitoredProcess]: Starting monitored process 39 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-04 16:02:32,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-03-04 16:02:32,188 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-04 16:02:32,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:32,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:32,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:32,198 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:32,200 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:02:32,200 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:02:32,205 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:32,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2025-03-04 16:02:32,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:32,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:32,212 INFO L229 MonitoredProcess]: Starting monitored process 40 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-04 16:02:32,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-03-04 16:02:32,215 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-04 16:02:32,225 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:32,225 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:02:32,225 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:32,225 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:32,225 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:32,225 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:02:32,225 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:02:32,226 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:32,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2025-03-04 16:02:32,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:32,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:32,233 INFO L229 MonitoredProcess]: Starting monitored process 41 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-04 16:02:32,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-03-04 16:02:32,235 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-04 16:02:32,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:32,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:32,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:32,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:32,245 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:02:32,245 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:02:32,251 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:32,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-03-04 16:02:32,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:32,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:32,258 INFO L229 MonitoredProcess]: Starting monitored process 42 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-04 16:02:32,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-03-04 16:02:32,260 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-04 16:02:32,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:32,269 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:02:32,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:32,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:32,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:32,270 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:02:32,270 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:02:32,270 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:32,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-03-04 16:02:32,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:32,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:32,278 INFO L229 MonitoredProcess]: Starting monitored process 43 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-04 16:02:32,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-03-04 16:02:32,279 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-04 16:02:32,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:32,289 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:02:32,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:32,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:32,289 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:32,289 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:02:32,289 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:02:32,290 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:32,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-03-04 16:02:32,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:32,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:32,297 INFO L229 MonitoredProcess]: Starting monitored process 44 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-04 16:02:32,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-03-04 16:02:32,299 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-04 16:02:32,309 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:32,309 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:02:32,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:32,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:32,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:32,309 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:02:32,309 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:02:32,310 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:32,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2025-03-04 16:02:32,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:32,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:32,317 INFO L229 MonitoredProcess]: Starting monitored process 45 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-04 16:02:32,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-03-04 16:02:32,319 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-04 16:02:32,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:32,328 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:02:32,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:32,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:32,328 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:32,329 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:02:32,329 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:02:32,330 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:32,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-03-04 16:02:32,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:32,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:32,337 INFO L229 MonitoredProcess]: Starting monitored process 46 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-04 16:02:32,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-03-04 16:02:32,338 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-04 16:02:32,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:32,348 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:02:32,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:32,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:32,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:32,348 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:02:32,348 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:02:32,349 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:32,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2025-03-04 16:02:32,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:32,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:32,357 INFO L229 MonitoredProcess]: Starting monitored process 47 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-04 16:02:32,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-03-04 16:02:32,361 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-04 16:02:32,370 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:32,370 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:02:32,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:32,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:32,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:32,370 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:02:32,371 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:02:32,371 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:32,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2025-03-04 16:02:32,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:32,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:32,379 INFO L229 MonitoredProcess]: Starting monitored process 48 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-04 16:02:32,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-03-04 16:02:32,380 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-04 16:02:32,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:32,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:32,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:32,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:32,393 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:02:32,393 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:02:32,395 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:32,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2025-03-04 16:02:32,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:32,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:32,403 INFO L229 MonitoredProcess]: Starting monitored process 49 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-04 16:02:32,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-03-04 16:02:32,405 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-04 16:02:32,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:32,414 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:02:32,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:32,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:32,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:32,414 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:02:32,414 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:02:32,415 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:32,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2025-03-04 16:02:32,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:32,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:32,423 INFO L229 MonitoredProcess]: Starting monitored process 50 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-04 16:02:32,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-03-04 16:02:32,424 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-04 16:02:32,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:32,434 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:02:32,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:32,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:32,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:32,435 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:02:32,435 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:02:32,436 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:32,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2025-03-04 16:02:32,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:32,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:32,442 INFO L229 MonitoredProcess]: Starting monitored process 51 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-04 16:02:32,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-03-04 16:02:32,444 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-04 16:02:32,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:32,454 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:02:32,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:32,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:32,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:32,454 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:02:32,454 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:02:32,455 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:32,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-03-04 16:02:32,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:32,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:32,462 INFO L229 MonitoredProcess]: Starting monitored process 52 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-04 16:02:32,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-03-04 16:02:32,464 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-04 16:02:32,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:32,474 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:02:32,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:32,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:32,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:32,474 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:02:32,474 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:02:32,475 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:32,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2025-03-04 16:02:32,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:32,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:32,482 INFO L229 MonitoredProcess]: Starting monitored process 53 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-04 16:02:32,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-03-04 16:02:32,484 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-04 16:02:32,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:32,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:32,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:32,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:32,494 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:02:32,494 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:02:32,496 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:32,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-03-04 16:02:32,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:32,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:32,504 INFO L229 MonitoredProcess]: Starting monitored process 54 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-04 16:02:32,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-03-04 16:02:32,505 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-04 16:02:32,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:32,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:32,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:32,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:32,516 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:02:32,516 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:02:32,518 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:32,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-03-04 16:02:32,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:32,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:32,524 INFO L229 MonitoredProcess]: Starting monitored process 55 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-04 16:02:32,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-03-04 16:02:32,526 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-04 16:02:32,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:32,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:32,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:32,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:32,537 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:02:32,537 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:02:32,539 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:32,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2025-03-04 16:02:32,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:32,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:32,546 INFO L229 MonitoredProcess]: Starting monitored process 56 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-04 16:02:32,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-03-04 16:02:32,548 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-04 16:02:32,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:32,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:32,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:32,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:32,561 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:02:32,561 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:02:32,563 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:32,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2025-03-04 16:02:32,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:32,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:32,570 INFO L229 MonitoredProcess]: Starting monitored process 57 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-04 16:02:32,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-03-04 16:02:32,572 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-04 16:02:32,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:32,581 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:02:32,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:32,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:32,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:32,582 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:02:32,582 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:02:32,583 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:32,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2025-03-04 16:02:32,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:32,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:32,590 INFO L229 MonitoredProcess]: Starting monitored process 58 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-04 16:02:32,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-03-04 16:02:32,592 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-04 16:02:32,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:32,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:32,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:32,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:32,602 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:02:32,602 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:02:32,604 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:32,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2025-03-04 16:02:32,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:32,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:32,612 INFO L229 MonitoredProcess]: Starting monitored process 59 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-04 16:02:32,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-03-04 16:02:32,613 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-04 16:02:32,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:32,623 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:32,623 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:32,623 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:32,624 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:02:32,624 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:02:32,626 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:32,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2025-03-04 16:02:32,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:32,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:32,633 INFO L229 MonitoredProcess]: Starting monitored process 60 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-04 16:02:32,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-03-04 16:02:32,635 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-04 16:02:32,644 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:32,644 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-03-04 16:02:32,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:32,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:32,646 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-03-04 16:02:32,646 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:02:32,650 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:32,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2025-03-04 16:02:32,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:32,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:32,657 INFO L229 MonitoredProcess]: Starting monitored process 61 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-04 16:02:32,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-03-04 16:02:32,658 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-04 16:02:32,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:32,668 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:02:32,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:32,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:32,668 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:32,668 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:02:32,668 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:02:32,669 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:32,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2025-03-04 16:02:32,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:32,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:32,677 INFO L229 MonitoredProcess]: Starting monitored process 62 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-04 16:02:32,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-03-04 16:02:32,678 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-04 16:02:32,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:32,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:32,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:32,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:32,689 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:02:32,689 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:02:32,691 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:32,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2025-03-04 16:02:32,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:32,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:32,698 INFO L229 MonitoredProcess]: Starting monitored process 63 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-04 16:02:32,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-03-04 16:02:32,700 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-04 16:02:32,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:32,710 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:02:32,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:32,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:32,710 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:32,710 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:02:32,710 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:02:32,711 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:32,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2025-03-04 16:02:32,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:32,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:32,718 INFO L229 MonitoredProcess]: Starting monitored process 64 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-04 16:02:32,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-03-04 16:02:32,720 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-04 16:02:32,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:32,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:32,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:32,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:32,730 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:02:32,730 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:02:32,732 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:02:32,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2025-03-04 16:02:32,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:32,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:32,751 INFO L229 MonitoredProcess]: Starting monitored process 65 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-04 16:02:32,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-03-04 16:02:32,753 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-04 16:02:32,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:02:32,762 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:02:32,762 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:02:32,762 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:02:32,766 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 16:02:32,766 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 16:02:32,774 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 16:02:32,795 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-03-04 16:02:32,795 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 13 variables to zero. [2025-03-04 16:02:32,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:02:32,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:32,797 INFO L229 MonitoredProcess]: Starting monitored process 66 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-04 16:02:32,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-03-04 16:02:32,798 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 16:02:32,809 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 16:02:32,809 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 16:02:32,810 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_alloc_17_~len#1, ULTIMATE.start_alloc_17_~i~0#1) = 1*ULTIMATE.start_alloc_17_~len#1 - 1*ULTIMATE.start_alloc_17_~i~0#1 Supporting invariants [] [2025-03-04 16:02:32,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2025-03-04 16:02:32,828 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2025-03-04 16:02:32,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:32,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 16:02:32,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 16:02:32,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:32,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:02:32,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 16:02:32,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:02:32,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 16:02:32,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 16:02:32,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:32,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:02:32,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 16:02:32,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:02:32,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2025-03-04 16:02:32,932 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-04 16:02:32,933 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-04 16:02:32,933 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:02:32,951 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 10. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 30 states and 39 transitions. Complement of second has 5 states. [2025-03-04 16:02:32,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-04 16:02:32,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:02:32,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2025-03-04 16:02:32,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 16 letters. Loop has 4 letters. [2025-03-04 16:02:32,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:02:32,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 20 letters. Loop has 4 letters. [2025-03-04 16:02:32,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:02:32,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 16 letters. Loop has 8 letters. [2025-03-04 16:02:32,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:02:32,952 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2025-03-04 16:02:32,953 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2025-03-04 16:02:32,953 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 29 states and 38 transitions. [2025-03-04 16:02:32,953 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-03-04 16:02:32,953 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2025-03-04 16:02:32,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 38 transitions. [2025-03-04 16:02:32,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:02:32,953 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 38 transitions. [2025-03-04 16:02:32,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 38 transitions. [2025-03-04 16:02:32,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2025-03-04 16:02:32,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 27 states have internal predecessors, (37), 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-04 16:02:32,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2025-03-04 16:02:32,956 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 37 transitions. [2025-03-04 16:02:32,956 INFO L432 stractBuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2025-03-04 16:02:32,956 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-04 16:02:32,956 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. [2025-03-04 16:02:32,956 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2025-03-04 16:02:32,956 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:02:32,956 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:02:32,956 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:02:32,956 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 16:02:32,956 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(8, 1);~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset, entry_point_#t~post49#1, entry_point_#t~ret50#1, entry_point_~i~2#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~2#1;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1;" "assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;" "entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset;" "assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume !(entry_point_~i~2#1 < entry_point_~len~0#1);assume { :begin_inline_alloc_17 } true;alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset, alloc_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc alloc_17_#res#1;havoc alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset, alloc_17_#t~post43#1, alloc_17_#t~mem44#1.base, alloc_17_#t~mem44#1.offset, alloc_17_#t~post45#1, alloc_17_~array#1.base, alloc_17_~array#1.offset, alloc_17_~len#1, alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~i~0#1, alloc_17_~j~0#1;alloc_17_~array#1.base, alloc_17_~array#1.offset := alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset;alloc_17_~len#1 := alloc_17_#in~len#1;havoc alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset;alloc_17_~i~0#1 := 0;havoc alloc_17_~j~0#1;" "assume !(alloc_17_~i~0#1 < alloc_17_~len#1);alloc_17_#res#1 := 0;" "entry_point_#t~ret50#1 := alloc_17_#res#1;havoc alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset, alloc_17_#t~post43#1, alloc_17_#t~mem44#1.base, alloc_17_#t~mem44#1.offset, alloc_17_#t~post45#1, alloc_17_~array#1.base, alloc_17_~array#1.offset, alloc_17_~len#1, alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~i~0#1, alloc_17_~j~0#1;havoc alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset, alloc_17_#in~len#1;assume { :end_inline_alloc_17 } true;havoc entry_point_#t~ret50#1;assume { :begin_inline_free_17 } true;free_17_#in~array#1.base, free_17_#in~array#1.offset, free_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc free_17_#t~mem46#1.base, free_17_#t~mem46#1.offset, free_17_#t~post47#1, free_17_~array#1.base, free_17_~array#1.offset, free_17_~len#1, free_17_~i~1#1;free_17_~array#1.base, free_17_~array#1.offset := free_17_#in~array#1.base, free_17_#in~array#1.offset;free_17_~len#1 := free_17_#in~len#1;havoc free_17_~i~1#1;free_17_~i~1#1 := 0;" [2025-03-04 16:02:32,957 INFO L754 eck$LassoCheckResult]: Loop: "assume free_17_~i~1#1 < free_17_~len#1;call free_17_#t~mem46#1.base, free_17_#t~mem46#1.offset := read~$Pointer$#1(free_17_~array#1.base, free_17_~array#1.offset + 4 * free_17_~i~1#1, 4);call ULTIMATE.dealloc(free_17_#t~mem46#1.base, free_17_#t~mem46#1.offset);havoc free_17_#t~mem46#1.base, free_17_#t~mem46#1.offset;free_17_#t~post47#1 := free_17_~i~1#1;free_17_~i~1#1 := 1 + free_17_#t~post47#1;havoc free_17_#t~post47#1;" [2025-03-04 16:02:32,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:32,957 INFO L85 PathProgramCache]: Analyzing trace with hash -532728011, now seen corresponding path program 1 times [2025-03-04 16:02:32,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:32,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196710263] [2025-03-04 16:02:32,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:02:32,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:32,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 16:02:32,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 16:02:32,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:32,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:02:33,059 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 16:02:33,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:02:33,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196710263] [2025-03-04 16:02:33,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196710263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:02:33,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:02:33,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 16:02:33,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733631777] [2025-03-04 16:02:33,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:02:33,060 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 16:02:33,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:33,060 INFO L85 PathProgramCache]: Analyzing trace with hash 34, now seen corresponding path program 1 times [2025-03-04 16:02:33,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:33,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862161287] [2025-03-04 16:02:33,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:02:33,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:33,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 16:02:33,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 16:02:33,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:33,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:33,064 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:02:33,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 16:02:33,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 16:02:33,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:33,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:33,066 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:02:33,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:02:33,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 16:02:33,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 16:02:33,098 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. cyclomatic complexity: 13 Second operand has 4 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-04 16:02:33,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:02:33,116 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2025-03-04 16:02:33,116 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 45 transitions. [2025-03-04 16:02:33,117 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2025-03-04 16:02:33,117 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 45 transitions. [2025-03-04 16:02:33,117 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2025-03-04 16:02:33,117 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2025-03-04 16:02:33,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 45 transitions. [2025-03-04 16:02:33,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:02:33,117 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 45 transitions. [2025-03-04 16:02:33,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 45 transitions. [2025-03-04 16:02:33,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2025-03-04 16:02:33,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 27 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:02:33,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2025-03-04 16:02:33,119 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 36 transitions. [2025-03-04 16:02:33,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 16:02:33,122 INFO L432 stractBuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2025-03-04 16:02:33,122 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-04 16:02:33,122 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2025-03-04 16:02:33,122 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2025-03-04 16:02:33,122 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:02:33,122 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:02:33,123 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:02:33,123 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 16:02:33,123 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(8, 1);~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset, entry_point_#t~post49#1, entry_point_#t~ret50#1, entry_point_~i~2#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~2#1;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1;" "assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;" "entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset;" "assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume !(entry_point_~i~2#1 < entry_point_~len~0#1);assume { :begin_inline_alloc_17 } true;alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset, alloc_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc alloc_17_#res#1;havoc alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset, alloc_17_#t~post43#1, alloc_17_#t~mem44#1.base, alloc_17_#t~mem44#1.offset, alloc_17_#t~post45#1, alloc_17_~array#1.base, alloc_17_~array#1.offset, alloc_17_~len#1, alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~i~0#1, alloc_17_~j~0#1;alloc_17_~array#1.base, alloc_17_~array#1.offset := alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset;alloc_17_~len#1 := alloc_17_#in~len#1;havoc alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset;alloc_17_~i~0#1 := 0;havoc alloc_17_~j~0#1;" "assume alloc_17_~i~0#1 < alloc_17_~len#1;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1;" "assume !(0 != ldv_malloc_#t~nondet11#1);havoc ldv_malloc_#t~nondet11#1;ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := 0, 0;" "alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset := alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset;havoc alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset;" "assume alloc_17_~p~0#1.base == 0 && alloc_17_~p~0#1.offset == 0;" "alloc_17_~j~0#1 := alloc_17_~i~0#1 - 1;" [2025-03-04 16:02:33,123 INFO L754 eck$LassoCheckResult]: Loop: "assume alloc_17_~j~0#1 >= 0;call alloc_17_#t~mem44#1.base, alloc_17_#t~mem44#1.offset := read~$Pointer$#1(alloc_17_~array#1.base, alloc_17_~array#1.offset + 4 * alloc_17_~j~0#1, 4);call ULTIMATE.dealloc(alloc_17_#t~mem44#1.base, alloc_17_#t~mem44#1.offset);havoc alloc_17_#t~mem44#1.base, alloc_17_#t~mem44#1.offset;call write~$Pointer$#1(0, 0, alloc_17_~array#1.base, alloc_17_~array#1.offset + 4 * alloc_17_~j~0#1, 4);alloc_17_#t~post45#1 := alloc_17_~j~0#1;alloc_17_~j~0#1 := alloc_17_#t~post45#1 - 1;havoc alloc_17_#t~post45#1;" [2025-03-04 16:02:33,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:33,123 INFO L85 PathProgramCache]: Analyzing trace with hash -584411502, now seen corresponding path program 1 times [2025-03-04 16:02:33,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:33,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019285229] [2025-03-04 16:02:33,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:02:33,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:33,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 16:02:33,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 16:02:33,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:33,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:33,149 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:02:33,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 16:02:33,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 16:02:33,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:33,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:33,170 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:02:33,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:33,172 INFO L85 PathProgramCache]: Analyzing trace with hash 39, now seen corresponding path program 1 times [2025-03-04 16:02:33,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:33,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781252506] [2025-03-04 16:02:33,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:02:33,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:33,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 16:02:33,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 16:02:33,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:33,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:33,178 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:02:33,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 16:02:33,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 16:02:33,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:33,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:33,184 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:02:33,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:33,185 INFO L85 PathProgramCache]: Analyzing trace with hash -936887370, now seen corresponding path program 1 times [2025-03-04 16:02:33,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:33,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013802166] [2025-03-04 16:02:33,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:02:33,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:33,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 16:02:33,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 16:02:33,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:33,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:02:33,256 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 16:02:33,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:02:33,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013802166] [2025-03-04 16:02:33,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013802166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:02:33,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:02:33,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 16:02:33,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375117596] [2025-03-04 16:02:33,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:02:33,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:02:33,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 16:02:33,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 16:02:33,332 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. cyclomatic complexity: 12 Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:02:33,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:02:33,351 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2025-03-04 16:02:33,351 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 46 transitions. [2025-03-04 16:02:33,352 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2025-03-04 16:02:33,352 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 46 transitions. [2025-03-04 16:02:33,352 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2025-03-04 16:02:33,352 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2025-03-04 16:02:33,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 46 transitions. [2025-03-04 16:02:33,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:02:33,352 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 46 transitions. [2025-03-04 16:02:33,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 46 transitions. [2025-03-04 16:02:33,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2025-03-04 16:02:33,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 32 states have internal predecessors, (42), 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-04 16:02:33,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2025-03-04 16:02:33,354 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 42 transitions. [2025-03-04 16:02:33,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 16:02:33,383 INFO L432 stractBuchiCegarLoop]: Abstraction has 33 states and 42 transitions. [2025-03-04 16:02:33,383 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-04 16:02:33,383 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 42 transitions. [2025-03-04 16:02:33,383 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2025-03-04 16:02:33,383 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:02:33,383 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:02:33,384 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:02:33,384 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 16:02:33,384 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(8, 1);~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset, entry_point_#t~post49#1, entry_point_#t~ret50#1, entry_point_~i~2#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~2#1;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1;" "assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;" "entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset;" "assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume !(entry_point_~i~2#1 < entry_point_~len~0#1);assume { :begin_inline_alloc_17 } true;alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset, alloc_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc alloc_17_#res#1;havoc alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset, alloc_17_#t~post43#1, alloc_17_#t~mem44#1.base, alloc_17_#t~mem44#1.offset, alloc_17_#t~post45#1, alloc_17_~array#1.base, alloc_17_~array#1.offset, alloc_17_~len#1, alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~i~0#1, alloc_17_~j~0#1;alloc_17_~array#1.base, alloc_17_~array#1.offset := alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset;alloc_17_~len#1 := alloc_17_#in~len#1;havoc alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset;alloc_17_~i~0#1 := 0;havoc alloc_17_~j~0#1;" "assume alloc_17_~i~0#1 < alloc_17_~len#1;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1;" "assume !(0 != ldv_malloc_#t~nondet11#1);havoc ldv_malloc_#t~nondet11#1;ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := 0, 0;" "alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset := alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset;havoc alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset;" "assume !(alloc_17_~p~0#1.base == 0 && alloc_17_~p~0#1.offset == 0);call write~$Pointer$#1(alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~array#1.base, alloc_17_~array#1.offset + 4 * alloc_17_~i~0#1, 4);alloc_17_#t~post43#1 := alloc_17_~i~0#1;alloc_17_~i~0#1 := 1 + alloc_17_#t~post43#1;havoc alloc_17_#t~post43#1;" "assume !(alloc_17_~i~0#1 < alloc_17_~len#1);alloc_17_#res#1 := 0;" "entry_point_#t~ret50#1 := alloc_17_#res#1;havoc alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset, alloc_17_#t~post43#1, alloc_17_#t~mem44#1.base, alloc_17_#t~mem44#1.offset, alloc_17_#t~post45#1, alloc_17_~array#1.base, alloc_17_~array#1.offset, alloc_17_~len#1, alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~i~0#1, alloc_17_~j~0#1;havoc alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset, alloc_17_#in~len#1;assume { :end_inline_alloc_17 } true;havoc entry_point_#t~ret50#1;assume { :begin_inline_free_17 } true;free_17_#in~array#1.base, free_17_#in~array#1.offset, free_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc free_17_#t~mem46#1.base, free_17_#t~mem46#1.offset, free_17_#t~post47#1, free_17_~array#1.base, free_17_~array#1.offset, free_17_~len#1, free_17_~i~1#1;free_17_~array#1.base, free_17_~array#1.offset := free_17_#in~array#1.base, free_17_#in~array#1.offset;free_17_~len#1 := free_17_#in~len#1;havoc free_17_~i~1#1;free_17_~i~1#1 := 0;" [2025-03-04 16:02:33,385 INFO L754 eck$LassoCheckResult]: Loop: "assume free_17_~i~1#1 < free_17_~len#1;call free_17_#t~mem46#1.base, free_17_#t~mem46#1.offset := read~$Pointer$#1(free_17_~array#1.base, free_17_~array#1.offset + 4 * free_17_~i~1#1, 4);call ULTIMATE.dealloc(free_17_#t~mem46#1.base, free_17_#t~mem46#1.offset);havoc free_17_#t~mem46#1.base, free_17_#t~mem46#1.offset;free_17_#t~post47#1 := free_17_~i~1#1;free_17_~i~1#1 := 1 + free_17_#t~post47#1;havoc free_17_#t~post47#1;" [2025-03-04 16:02:33,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:33,386 INFO L85 PathProgramCache]: Analyzing trace with hash -936885389, now seen corresponding path program 1 times [2025-03-04 16:02:33,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:33,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507816751] [2025-03-04 16:02:33,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:02:33,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:33,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 16:02:33,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 16:02:33,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:33,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:02:33,474 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 16:02:33,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:02:33,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507816751] [2025-03-04 16:02:33,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507816751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:02:33,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:02:33,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 16:02:33,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006466412] [2025-03-04 16:02:33,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:02:33,475 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 16:02:33,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:33,475 INFO L85 PathProgramCache]: Analyzing trace with hash 34, now seen corresponding path program 2 times [2025-03-04 16:02:33,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:33,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116975468] [2025-03-04 16:02:33,475 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:02:33,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:33,478 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-03-04 16:02:33,478 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 16:02:33,478 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:02:33,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:33,478 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:02:33,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 16:02:33,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 16:02:33,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:33,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:33,482 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:02:33,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:02:33,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 16:02:33,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 16:02:33,511 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. cyclomatic complexity: 13 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:02:33,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:02:33,527 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2025-03-04 16:02:33,527 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 48 transitions. [2025-03-04 16:02:33,528 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2025-03-04 16:02:33,528 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 38 states and 46 transitions. [2025-03-04 16:02:33,528 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2025-03-04 16:02:33,528 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2025-03-04 16:02:33,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 46 transitions. [2025-03-04 16:02:33,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:02:33,528 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 46 transitions. [2025-03-04 16:02:33,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 46 transitions. [2025-03-04 16:02:33,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 33. [2025-03-04 16:02:33,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 32 states have internal predecessors, (41), 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-04 16:02:33,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2025-03-04 16:02:33,530 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 41 transitions. [2025-03-04 16:02:33,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 16:02:33,531 INFO L432 stractBuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2025-03-04 16:02:33,531 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-04 16:02:33,531 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 41 transitions. [2025-03-04 16:02:33,532 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2025-03-04 16:02:33,532 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:02:33,532 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:02:33,533 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:02:33,533 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 16:02:33,533 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(8, 1);~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset, entry_point_#t~post49#1, entry_point_#t~ret50#1, entry_point_~i~2#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~2#1;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1;" "assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;" "entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset;" "assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume !(entry_point_~i~2#1 < entry_point_~len~0#1);assume { :begin_inline_alloc_17 } true;alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset, alloc_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc alloc_17_#res#1;havoc alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset, alloc_17_#t~post43#1, alloc_17_#t~mem44#1.base, alloc_17_#t~mem44#1.offset, alloc_17_#t~post45#1, alloc_17_~array#1.base, alloc_17_~array#1.offset, alloc_17_~len#1, alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~i~0#1, alloc_17_~j~0#1;alloc_17_~array#1.base, alloc_17_~array#1.offset := alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset;alloc_17_~len#1 := alloc_17_#in~len#1;havoc alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset;alloc_17_~i~0#1 := 0;havoc alloc_17_~j~0#1;" "assume alloc_17_~i~0#1 < alloc_17_~len#1;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1;" "assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;" "alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset := alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset;havoc alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset;" "assume !(alloc_17_~p~0#1.base == 0 && alloc_17_~p~0#1.offset == 0);call write~$Pointer$#1(alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~array#1.base, alloc_17_~array#1.offset + 4 * alloc_17_~i~0#1, 4);alloc_17_#t~post43#1 := alloc_17_~i~0#1;alloc_17_~i~0#1 := 1 + alloc_17_#t~post43#1;havoc alloc_17_#t~post43#1;" "assume !(alloc_17_~i~0#1 < alloc_17_~len#1);alloc_17_#res#1 := 0;" "entry_point_#t~ret50#1 := alloc_17_#res#1;havoc alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset, alloc_17_#t~post43#1, alloc_17_#t~mem44#1.base, alloc_17_#t~mem44#1.offset, alloc_17_#t~post45#1, alloc_17_~array#1.base, alloc_17_~array#1.offset, alloc_17_~len#1, alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~i~0#1, alloc_17_~j~0#1;havoc alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset, alloc_17_#in~len#1;assume { :end_inline_alloc_17 } true;havoc entry_point_#t~ret50#1;assume { :begin_inline_free_17 } true;free_17_#in~array#1.base, free_17_#in~array#1.offset, free_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc free_17_#t~mem46#1.base, free_17_#t~mem46#1.offset, free_17_#t~post47#1, free_17_~array#1.base, free_17_~array#1.offset, free_17_~len#1, free_17_~i~1#1;free_17_~array#1.base, free_17_~array#1.offset := free_17_#in~array#1.base, free_17_#in~array#1.offset;free_17_~len#1 := free_17_#in~len#1;havoc free_17_~i~1#1;free_17_~i~1#1 := 0;" [2025-03-04 16:02:33,534 INFO L754 eck$LassoCheckResult]: Loop: "assume free_17_~i~1#1 < free_17_~len#1;call free_17_#t~mem46#1.base, free_17_#t~mem46#1.offset := read~$Pointer$#1(free_17_~array#1.base, free_17_~array#1.offset + 4 * free_17_~i~1#1, 4);call ULTIMATE.dealloc(free_17_#t~mem46#1.base, free_17_#t~mem46#1.offset);havoc free_17_#t~mem46#1.base, free_17_#t~mem46#1.offset;free_17_#t~post47#1 := free_17_~i~1#1;free_17_~i~1#1 := 1 + free_17_#t~post47#1;havoc free_17_#t~post47#1;" [2025-03-04 16:02:33,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:33,534 INFO L85 PathProgramCache]: Analyzing trace with hash -938732431, now seen corresponding path program 1 times [2025-03-04 16:02:33,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:33,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707456317] [2025-03-04 16:02:33,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:02:33,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:33,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 16:02:33,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 16:02:33,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:33,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:02:33,633 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 16:02:33,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:02:33,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707456317] [2025-03-04 16:02:33,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707456317] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:02:33,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150523188] [2025-03-04 16:02:33,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:02:33,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:02:33,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:02:33,635 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 16:02:33,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2025-03-04 16:02:33,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 16:02:33,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 16:02:33,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:33,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:02:33,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 16:02:33,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:02:33,776 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 16:02:33,776 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:02:33,820 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 16:02:33,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150523188] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:02:33,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:02:33,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 16:02:33,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093030184] [2025-03-04 16:02:33,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:02:33,820 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 16:02:33,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:33,821 INFO L85 PathProgramCache]: Analyzing trace with hash 34, now seen corresponding path program 3 times [2025-03-04 16:02:33,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:33,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748979233] [2025-03-04 16:02:33,821 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 16:02:33,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:33,823 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1 statements into 1 equivalence classes. [2025-03-04 16:02:33,824 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 16:02:33,824 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 16:02:33,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:33,824 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:02:33,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 16:02:33,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 16:02:33,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:33,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:33,826 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:02:33,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:02:33,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 16:02:33,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-04 16:02:33,870 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 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-04 16:02:33,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:02:33,923 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2025-03-04 16:02:33,923 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 66 transitions. [2025-03-04 16:02:33,924 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2025-03-04 16:02:33,925 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 53 states and 66 transitions. [2025-03-04 16:02:33,925 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2025-03-04 16:02:33,925 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2025-03-04 16:02:33,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 66 transitions. [2025-03-04 16:02:33,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:02:33,925 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53 states and 66 transitions. [2025-03-04 16:02:33,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 66 transitions. [2025-03-04 16:02:33,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 45. [2025-03-04 16:02:33,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 44 states have internal predecessors, (56), 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-04 16:02:33,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2025-03-04 16:02:33,927 INFO L240 hiAutomatonCegarLoop]: Abstraction has 45 states and 56 transitions. [2025-03-04 16:02:33,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 16:02:33,928 INFO L432 stractBuchiCegarLoop]: Abstraction has 45 states and 56 transitions. [2025-03-04 16:02:33,928 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-04 16:02:33,928 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 56 transitions. [2025-03-04 16:02:33,928 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2025-03-04 16:02:33,928 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:02:33,928 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:02:33,928 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:02:33,928 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 16:02:33,928 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(8, 1);~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset, entry_point_#t~post49#1, entry_point_#t~ret50#1, entry_point_~i~2#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~2#1;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1;" "assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;" "entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset;" "assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume entry_point_~i~2#1 < entry_point_~len~0#1;call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4);entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1;" "assume !(entry_point_~i~2#1 < entry_point_~len~0#1);assume { :begin_inline_alloc_17 } true;alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset, alloc_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc alloc_17_#res#1;havoc alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset, alloc_17_#t~post43#1, alloc_17_#t~mem44#1.base, alloc_17_#t~mem44#1.offset, alloc_17_#t~post45#1, alloc_17_~array#1.base, alloc_17_~array#1.offset, alloc_17_~len#1, alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~i~0#1, alloc_17_~j~0#1;alloc_17_~array#1.base, alloc_17_~array#1.offset := alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset;alloc_17_~len#1 := alloc_17_#in~len#1;havoc alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset;alloc_17_~i~0#1 := 0;havoc alloc_17_~j~0#1;" "assume alloc_17_~i~0#1 < alloc_17_~len#1;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1;" "assume !(0 != ldv_malloc_#t~nondet11#1);havoc ldv_malloc_#t~nondet11#1;ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := 0, 0;" "alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset := alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset;havoc alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset;" "assume alloc_17_~p~0#1.base == 0 && alloc_17_~p~0#1.offset == 0;" "alloc_17_~j~0#1 := alloc_17_~i~0#1 - 1;" "assume !(alloc_17_~j~0#1 >= 0);alloc_17_#res#1 := 3;" "entry_point_#t~ret50#1 := alloc_17_#res#1;havoc alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset, alloc_17_#t~post43#1, alloc_17_#t~mem44#1.base, alloc_17_#t~mem44#1.offset, alloc_17_#t~post45#1, alloc_17_~array#1.base, alloc_17_~array#1.offset, alloc_17_~len#1, alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~i~0#1, alloc_17_~j~0#1;havoc alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset, alloc_17_#in~len#1;assume { :end_inline_alloc_17 } true;havoc entry_point_#t~ret50#1;assume { :begin_inline_free_17 } true;free_17_#in~array#1.base, free_17_#in~array#1.offset, free_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc free_17_#t~mem46#1.base, free_17_#t~mem46#1.offset, free_17_#t~post47#1, free_17_~array#1.base, free_17_~array#1.offset, free_17_~len#1, free_17_~i~1#1;free_17_~array#1.base, free_17_~array#1.offset := free_17_#in~array#1.base, free_17_#in~array#1.offset;free_17_~len#1 := free_17_#in~len#1;havoc free_17_~i~1#1;free_17_~i~1#1 := 0;" [2025-03-04 16:02:33,929 INFO L754 eck$LassoCheckResult]: Loop: "assume free_17_~i~1#1 < free_17_~len#1;call free_17_#t~mem46#1.base, free_17_#t~mem46#1.offset := read~$Pointer$#1(free_17_~array#1.base, free_17_~array#1.offset + 4 * free_17_~i~1#1, 4);call ULTIMATE.dealloc(free_17_#t~mem46#1.base, free_17_#t~mem46#1.offset);havoc free_17_#t~mem46#1.base, free_17_#t~mem46#1.offset;free_17_#t~post47#1 := free_17_~i~1#1;free_17_~i~1#1 := 1 + free_17_#t~post47#1;havoc free_17_#t~post47#1;" [2025-03-04 16:02:33,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:33,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1021262576, now seen corresponding path program 1 times [2025-03-04 16:02:33,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:33,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446524802] [2025-03-04 16:02:33,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:02:33,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:33,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 16:02:33,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 16:02:33,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:33,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:33,950 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:02:33,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 16:02:33,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 16:02:33,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:33,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:33,965 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:02:33,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:33,965 INFO L85 PathProgramCache]: Analyzing trace with hash 34, now seen corresponding path program 4 times [2025-03-04 16:02:33,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:33,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374004410] [2025-03-04 16:02:33,965 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 16:02:33,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:33,968 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1 statements into 2 equivalence classes. [2025-03-04 16:02:33,969 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 16:02:33,969 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 16:02:33,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:33,969 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:02:33,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 16:02:33,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 16:02:33,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:33,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:33,971 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:02:33,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:02:33,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1594368787, now seen corresponding path program 1 times [2025-03-04 16:02:33,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:02:33,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369552656] [2025-03-04 16:02:33,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:02:33,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:02:33,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 16:02:33,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 16:02:33,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:33,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:33,995 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:02:33,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 16:02:34,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 16:02:34,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:02:34,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:02:34,017 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace