./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 c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test17_1-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 50151fd5b174ebc91ead294b24e8609853135da34cf3135980023271fd7c21f6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 19:28:51,057 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 19:28:51,111 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-02-06 19:28:51,117 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 19:28:51,118 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 19:28:51,118 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-06 19:28:51,132 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 19:28:51,133 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 19:28:51,133 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 19:28:51,134 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 19:28:51,134 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 19:28:51,134 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 19:28:51,134 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 19:28:51,134 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 19:28:51,134 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-06 19:28:51,134 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-06 19:28:51,134 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-06 19:28:51,134 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-06 19:28:51,134 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-06 19:28:51,134 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-06 19:28:51,134 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 19:28:51,134 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-06 19:28:51,135 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 19:28:51,135 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 19:28:51,135 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 19:28:51,135 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 19:28:51,135 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-06 19:28:51,135 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-06 19:28:51,135 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-06 19:28:51,135 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 19:28:51,135 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 19:28:51,135 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 19:28:51,135 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-06 19:28:51,135 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 19:28:51,135 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 19:28:51,135 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 19:28:51,135 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 19:28:51,135 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 19:28:51,135 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 19:28:51,135 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-06 19:28:51,135 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 50151fd5b174ebc91ead294b24e8609853135da34cf3135980023271fd7c21f6 [2025-02-06 19:28:51,373 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 19:28:51,381 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 19:28:51,383 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 19:28:51,384 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 19:28:51,384 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 19:28:51,386 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test17_1-2.i [2025-02-06 19:28:52,546 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3c0f88b13/9828c8169e444518a063c29b5edd2cf8/FLAG1ddd7b052 [2025-02-06 19:28:52,862 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 19:28:52,862 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_1-2.i [2025-02-06 19:28:52,873 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3c0f88b13/9828c8169e444518a063c29b5edd2cf8/FLAG1ddd7b052 [2025-02-06 19:28:53,124 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3c0f88b13/9828c8169e444518a063c29b5edd2cf8 [2025-02-06 19:28:53,126 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 19:28:53,127 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 19:28:53,127 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 19:28:53,128 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 19:28:53,132 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 19:28:53,133 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:28:53" (1/1) ... [2025-02-06 19:28:53,133 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@442f0f05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:28:53, skipping insertion in model container [2025-02-06 19:28:53,135 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:28:53" (1/1) ... [2025-02-06 19:28:53,165 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 19:28:53,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:28:53,397 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 19:28:53,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:28:53,474 INFO L204 MainTranslator]: Completed translation [2025-02-06 19:28:53,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:28:53 WrapperNode [2025-02-06 19:28:53,475 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 19:28:53,475 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 19:28:53,475 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 19:28:53,475 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 19:28:53,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:28:53" (1/1) ... [2025-02-06 19:28:53,490 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:28:53" (1/1) ... [2025-02-06 19:28:53,509 INFO L138 Inliner]: procedures = 166, calls = 79, calls flagged for inlining = 30, calls inlined = 7, statements flattened = 89 [2025-02-06 19:28:53,510 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 19:28:53,510 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 19:28:53,510 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 19:28:53,510 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 19:28:53,516 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:28:53" (1/1) ... [2025-02-06 19:28:53,516 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:28:53" (1/1) ... [2025-02-06 19:28:53,518 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:28:53" (1/1) ... [2025-02-06 19:28:53,537 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-02-06 19:28:53,538 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:28:53" (1/1) ... [2025-02-06 19:28:53,538 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:28:53" (1/1) ... [2025-02-06 19:28:53,545 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:28:53" (1/1) ... [2025-02-06 19:28:53,547 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:28:53" (1/1) ... [2025-02-06 19:28:53,548 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:28:53" (1/1) ... [2025-02-06 19:28:53,548 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:28:53" (1/1) ... [2025-02-06 19:28:53,552 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 19:28:53,553 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 19:28:53,553 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 19:28:53,553 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 19:28:53,553 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:28:53" (1/1) ... [2025-02-06 19:28:53,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:28:53,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:28:53,582 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:28:53,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-02-06 19:28:53,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 19:28:53,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 19:28:53,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 19:28:53,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 19:28:53,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 19:28:53,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 19:28:53,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 19:28:53,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-06 19:28:53,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-06 19:28:53,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 19:28:53,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 19:28:53,683 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 19:28:53,685 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 19:28:53,832 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L527: havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; [2025-02-06 19:28:53,833 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L527-2: havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; [2025-02-06 19:28:53,842 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2025-02-06 19:28:53,843 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 19:28:53,849 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 19:28:53,849 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 19:28:53,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:28:53 BoogieIcfgContainer [2025-02-06 19:28:53,849 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 19:28:53,850 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-06 19:28:53,850 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-06 19:28:53,854 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-06 19:28:53,854 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:28:53,854 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.02 07:28:53" (1/3) ... [2025-02-06 19:28:53,855 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@521e50a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:28:53, skipping insertion in model container [2025-02-06 19:28:53,855 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:28:53,855 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:28:53" (2/3) ... [2025-02-06 19:28:53,855 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@521e50a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:28:53, skipping insertion in model container [2025-02-06 19:28:53,855 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:28:53,856 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:28:53" (3/3) ... [2025-02-06 19:28:53,856 INFO L363 chiAutomizerObserver]: Analyzing ICFG memleaks_test17_1-2.i [2025-02-06 19:28:53,889 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-06 19:28:53,890 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-06 19:28:53,890 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-06 19:28:53,890 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-06 19:28:53,890 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-06 19:28:53,890 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-06 19:28:53,890 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-06 19:28:53,890 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-06 19:28:53,895 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-02-06 19:28:53,907 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 7 [2025-02-06 19:28:53,907 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:28:53,907 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:28:53,911 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-06 19:28:53,912 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:28:53,912 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-06 19:28:53,912 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-02-06 19:28:53,914 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 7 [2025-02-06 19:28:53,914 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:28:53,914 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:28:53,915 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-06 19:28:53,915 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:28:53,919 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-02-06 19:28:53,921 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-02-06 19:28:53,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:28:53,927 INFO L85 PathProgramCache]: Analyzing trace with hash 61995965, now seen corresponding path program 1 times [2025-02-06 19:28:53,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:28:53,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726759860] [2025-02-06 19:28:53,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:28:53,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:28:53,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:28:54,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:28:54,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:54,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:54,014 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:28:54,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:28:54,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:28:54,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:54,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:54,045 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:28:54,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:28:54,047 INFO L85 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 1 times [2025-02-06 19:28:54,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:28:54,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333212542] [2025-02-06 19:28:54,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:28:54,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:28:54,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:28:54,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:28:54,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:54,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:54,064 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:28:54,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:28:54,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:28:54,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:54,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:54,076 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:28:54,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:28:54,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1921874940, now seen corresponding path program 1 times [2025-02-06 19:28:54,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:28:54,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175868024] [2025-02-06 19:28:54,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:28:54,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:28:54,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:28:54,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:28:54,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:54,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:54,112 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:28:54,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:28:54,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:28:54,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:54,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:54,141 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:28:54,528 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:28:54,529 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:28:54,529 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:28:54,529 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:28:54,529 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:28:54,529 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:28:54,529 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:28:54,529 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:28:54,530 INFO L132 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_1-2.i_Iteration1_Lasso [2025-02-06 19:28:54,530 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:28:54,530 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:28:54,544 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:28:54,549 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:28:54,551 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:28:54,563 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:28:54,565 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:28:54,567 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:28:54,569 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:28:54,570 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:28:54,573 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:28:54,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:28:54,577 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:28:54,672 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:28:54,675 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:28:54,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:28:54,679 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:28:54,682 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:28:54,684 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:28:54,693 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:28:54,696 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:28:54,698 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:28:54,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:28:54,928 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:28:54,930 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:28:54,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:28:54,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:28:54,933 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:28:54,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-02-06 19:28:54,936 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:28:54,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:28:54,948 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:28:54,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:28:54,948 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:28:54,948 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:28:54,951 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:28:54,951 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:28:54,953 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:28:54,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-02-06 19:28:54,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:28:54,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:28:54,962 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:28:54,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-02-06 19:28:54,964 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:28:54,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:28:54,974 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:28:54,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:28:54,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:28:54,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:28:54,975 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:28:54,975 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:28:54,976 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:28:54,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-02-06 19:28:54,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:28:54,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:28:54,985 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:28:54,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-02-06 19:28:54,987 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:28:54,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:28:54,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:28:54,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:28:54,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:28:55,000 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:28:55,000 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:28:55,002 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:28:55,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-02-06 19:28:55,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:28:55,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:28:55,011 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:28:55,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-02-06 19:28:55,013 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:28:55,023 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:28:55,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:28:55,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:28:55,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:28:55,025 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:28:55,025 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:28:55,028 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:28:55,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-02-06 19:28:55,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:28:55,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:28:55,036 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:28:55,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-02-06 19:28:55,038 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:28:55,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:28:55,048 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:28:55,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:28:55,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:28:55,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:28:55,048 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:28:55,048 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:28:55,050 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:28:55,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-02-06 19:28:55,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:28:55,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:28:55,058 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:28:55,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-02-06 19:28:55,060 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:28:55,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:28:55,070 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:28:55,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:28:55,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:28:55,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:28:55,071 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:28:55,071 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:28:55,072 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:28:55,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-02-06 19:28:55,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:28:55,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:28:55,079 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:28:55,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-02-06 19:28:55,081 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:28:55,090 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:28:55,090 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:28:55,090 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:28:55,090 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:28:55,090 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:28:55,091 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:28:55,091 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:28:55,092 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:28:55,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-02-06 19:28:55,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:28:55,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:28:55,098 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:28:55,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-02-06 19:28:55,100 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:28:55,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:28:55,109 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:28:55,110 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:28:55,110 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:28:55,110 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:28:55,111 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:28:55,111 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:28:55,112 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:28:55,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-02-06 19:28:55,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:28:55,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:28:55,119 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:28:55,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-02-06 19:28:55,120 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:28:55,130 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:28:55,130 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:28:55,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:28:55,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:28:55,131 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:28:55,131 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:28:55,134 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:28:55,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-02-06 19:28:55,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:28:55,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:28:55,142 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:28:55,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-02-06 19:28:55,154 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:28:55,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:28:55,164 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:28:55,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:28:55,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:28:55,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:28:55,164 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:28:55,165 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:28:55,166 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:28:55,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-02-06 19:28:55,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:28:55,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:28:55,173 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:28:55,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-02-06 19:28:55,175 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:28:55,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:28:55,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:28:55,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:28:55,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:28:55,190 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:28:55,190 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:28:55,193 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:28:55,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-02-06 19:28:55,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:28:55,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:28:55,203 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:28:55,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-02-06 19:28:55,206 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:28:55,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:28:55,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:28:55,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:28:55,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:28:55,219 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:28:55,219 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:28:55,222 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:28:55,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-02-06 19:28:55,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:28:55,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:28:55,231 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:28:55,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-02-06 19:28:55,233 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:28:55,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:28:55,243 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:28:55,243 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:28:55,243 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:28:55,243 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:28:55,244 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:28:55,244 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:28:55,245 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:28:55,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-02-06 19:28:55,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:28:55,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:28:55,253 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:28:55,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-02-06 19:28:55,255 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:28:55,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:28:55,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:28:55,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:28:55,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:28:55,269 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:28:55,269 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:28:55,275 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:28:55,291 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2025-02-06 19:28:55,295 INFO L444 ModelExtractionUtils]: 5 out of 16 variables were initially zero. Simplification set additionally 8 variables to zero. [2025-02-06 19:28:55,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:28:55,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:28:55,299 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:28:55,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-02-06 19:28:55,301 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:28:55,312 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:28:55,312 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:28:55,313 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-02-06 19:28:55,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-02-06 19:28:55,326 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2025-02-06 19:28:55,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:28:55,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:28:55,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:28:55,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:55,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:28:55,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:28:55,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:28:55,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:28:55,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:28:55,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:55,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:28:55,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 19:28:55,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:28:55,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:28:55,406 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-02-06 19:28:55,407 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-02-06 19:28:55,434 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-02-06 19:28:55,435 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-02-06 19:28:55,439 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-02-06 19:28:55,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 11 transitions. [2025-02-06 19:28:55,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 5 letters. Loop has 1 letters. [2025-02-06 19:28:55,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:28:55,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 6 letters. Loop has 1 letters. [2025-02-06 19:28:55,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:28:55,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 5 letters. Loop has 2 letters. [2025-02-06 19:28:55,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:28:55,447 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 33 transitions. [2025-02-06 19:28:55,448 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-02-06 19:28:55,449 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 16 states and 24 transitions. [2025-02-06 19:28:55,450 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2025-02-06 19:28:55,450 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2025-02-06 19:28:55,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 24 transitions. [2025-02-06 19:28:55,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:28:55,451 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 24 transitions. [2025-02-06 19:28:55,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 24 transitions. [2025-02-06 19:28:55,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2025-02-06 19:28:55,465 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-02-06 19:28:55,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2025-02-06 19:28:55,466 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 22 transitions. [2025-02-06 19:28:55,466 INFO L432 stractBuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2025-02-06 19:28:55,467 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-06 19:28:55,467 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 22 transitions. [2025-02-06 19:28:55,467 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-02-06 19:28:55,468 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:28:55,468 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:28:55,468 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-02-06 19:28:55,468 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-06 19:28:55,468 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-02-06 19:28:55,469 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-02-06 19:28:55,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:28:55,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1921874939, now seen corresponding path program 1 times [2025-02-06 19:28:55,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:28:55,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461529037] [2025-02-06 19:28:55,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:28:55,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:28:55,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:28:55,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:28:55,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:55,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:28:55,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:28:55,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:28:55,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461529037] [2025-02-06 19:28:55,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461529037] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:28:55,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:28:55,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 19:28:55,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585158243] [2025-02-06 19:28:55,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:28:55,544 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:28:55,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:28:55,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1628477, now seen corresponding path program 1 times [2025-02-06 19:28:55,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:28:55,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936699738] [2025-02-06 19:28:55,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:28:55,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:28:55,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:28:55,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:28:55,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:55,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:55,565 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:28:55,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:28:55,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:28:55,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:55,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:55,573 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:28:55,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:28:55,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 19:28:55,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 19:28:55,748 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-02-06 19:28:55,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:28:55,758 INFO L93 Difference]: Finished difference Result 15 states and 21 transitions. [2025-02-06 19:28:55,759 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 21 transitions. [2025-02-06 19:28:55,759 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-02-06 19:28:55,759 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 21 transitions. [2025-02-06 19:28:55,759 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2025-02-06 19:28:55,759 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2025-02-06 19:28:55,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 21 transitions. [2025-02-06 19:28:55,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:28:55,760 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 21 transitions. [2025-02-06 19:28:55,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 21 transitions. [2025-02-06 19:28:55,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-02-06 19:28:55,760 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-02-06 19:28:55,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2025-02-06 19:28:55,761 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 21 transitions. [2025-02-06 19:28:55,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 19:28:55,763 INFO L432 stractBuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2025-02-06 19:28:55,763 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-06 19:28:55,763 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2025-02-06 19:28:55,765 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-02-06 19:28:55,765 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:28:55,765 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:28:55,765 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:28:55,765 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-06 19:28:55,766 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-02-06 19:28:55,766 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-02-06 19:28:55,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:28:55,766 INFO L85 PathProgramCache]: Analyzing trace with hash -551418980, now seen corresponding path program 1 times [2025-02-06 19:28:55,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:28:55,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824533515] [2025-02-06 19:28:55,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:28:55,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:28:55,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:28:55,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:28:55,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:55,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:28:55,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:28:55,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:28:55,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824533515] [2025-02-06 19:28:55,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824533515] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:28:55,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815280985] [2025-02-06 19:28:55,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:28:55,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:28:55,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:28:55,847 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:28:55,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-02-06 19:28:55,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:28:55,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:28:55,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:55,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:28:55,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 19:28:55,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:28:55,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:28:55,924 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:28:55,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:28:55,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815280985] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:28:55,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:28:55,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-02-06 19:28:55,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918063816] [2025-02-06 19:28:55,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:28:55,951 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:28:55,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:28:55,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1628477, now seen corresponding path program 2 times [2025-02-06 19:28:55,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:28:55,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019783999] [2025-02-06 19:28:55,951 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:28:55,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:28:55,958 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:28:55,964 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:28:55,964 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:28:55,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:55,965 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:28:55,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:28:55,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:28:55,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:55,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:55,982 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:28:55,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-02-06 19:28:56,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:28:56,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 19:28:56,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-02-06 19:28:56,150 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-02-06 19:28:56,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:28:56,188 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. [2025-02-06 19:28:56,188 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 24 transitions. [2025-02-06 19:28:56,188 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-02-06 19:28:56,188 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 24 transitions. [2025-02-06 19:28:56,189 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2025-02-06 19:28:56,189 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2025-02-06 19:28:56,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions. [2025-02-06 19:28:56,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:28:56,189 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 24 transitions. [2025-02-06 19:28:56,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions. [2025-02-06 19:28:56,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-02-06 19:28:56,189 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-02-06 19:28:56,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2025-02-06 19:28:56,190 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 24 transitions. [2025-02-06 19:28:56,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 19:28:56,191 INFO L432 stractBuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2025-02-06 19:28:56,191 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-06 19:28:56,191 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2025-02-06 19:28:56,191 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-02-06 19:28:56,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:28:56,191 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:28:56,192 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 1, 1, 1, 1, 1, 1] [2025-02-06 19:28:56,192 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-06 19:28:56,192 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-02-06 19:28:56,192 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-02-06 19:28:56,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:28:56,192 INFO L85 PathProgramCache]: Analyzing trace with hash 927128635, now seen corresponding path program 2 times [2025-02-06 19:28:56,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:28:56,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873097124] [2025-02-06 19:28:56,192 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:28:56,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:28:56,201 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-02-06 19:28:56,217 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 19:28:56,220 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:28:56,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:28:56,336 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:28:56,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:28:56,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873097124] [2025-02-06 19:28:56,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873097124] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:28:56,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058080940] [2025-02-06 19:28:56,337 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:28:56,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:28:56,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:28:56,342 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:28:56,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-02-06 19:28:56,389 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-02-06 19:28:56,408 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 19:28:56,408 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:28:56,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:28:56,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 19:28:56,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:28:56,463 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:28:56,463 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:28:56,539 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:28:56,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058080940] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:28:56,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:28:56,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2025-02-06 19:28:56,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177175183] [2025-02-06 19:28:56,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:28:56,540 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:28:56,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:28:56,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1628477, now seen corresponding path program 3 times [2025-02-06 19:28:56,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:28:56,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293519250] [2025-02-06 19:28:56,540 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:28:56,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:28:56,548 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:28:56,551 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:28:56,551 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 19:28:56,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:56,552 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:28:56,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:28:56,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:28:56,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:56,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:56,559 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:28:56,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:28:56,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 19:28:56,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2025-02-06 19:28:56,722 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-02-06 19:28:56,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:28:56,795 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2025-02-06 19:28:56,795 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 30 transitions. [2025-02-06 19:28:56,796 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-02-06 19:28:56,797 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 30 transitions. [2025-02-06 19:28:56,797 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2025-02-06 19:28:56,797 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2025-02-06 19:28:56,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 30 transitions. [2025-02-06 19:28:56,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:28:56,797 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 30 transitions. [2025-02-06 19:28:56,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 30 transitions. [2025-02-06 19:28:56,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-02-06 19:28:56,798 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-02-06 19:28:56,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2025-02-06 19:28:56,799 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 30 transitions. [2025-02-06 19:28:56,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 19:28:56,803 INFO L432 stractBuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2025-02-06 19:28:56,803 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-06 19:28:56,803 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 30 transitions. [2025-02-06 19:28:56,804 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-02-06 19:28:56,804 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:28:56,804 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:28:56,804 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 1, 1, 1, 1, 1, 1] [2025-02-06 19:28:56,804 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-06 19:28:56,804 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-02-06 19:28:56,805 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-02-06 19:28:56,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:28:56,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1430720357, now seen corresponding path program 3 times [2025-02-06 19:28:56,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:28:56,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642999484] [2025-02-06 19:28:56,805 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:28:56,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:28:56,820 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 6 equivalence classes. [2025-02-06 19:28:56,854 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 19:28:56,854 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-02-06 19:28:56,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:56,854 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:28:56,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 19:28:56,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 19:28:56,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:56,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:56,887 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:28:56,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:28:56,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1628477, now seen corresponding path program 4 times [2025-02-06 19:28:56,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:28:56,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85687679] [2025-02-06 19:28:56,888 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:28:56,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:28:56,894 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 4 statements into 2 equivalence classes. [2025-02-06 19:28:56,898 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:28:56,900 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:28:56,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:56,900 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:28:56,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:28:56,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:28:56,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:56,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:56,910 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:28:56,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:28:56,911 INFO L85 PathProgramCache]: Analyzing trace with hash -850137897, now seen corresponding path program 1 times [2025-02-06 19:28:56,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:28:56,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070981162] [2025-02-06 19:28:56,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:28:56,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:28:56,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 19:28:56,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 19:28:56,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:56,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:56,960 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:28:56,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 19:28:56,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 19:28:56,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:56,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:56,996 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:30:13,463 WARN L286 SmtUtils]: Spent 1.27m 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-02-06 19:30:14,948 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:30:14,949 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:30:14,949 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:30:14,949 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:30:14,949 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:30:14,949 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:30:14,949 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:30:14,949 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:30:14,949 INFO L132 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_1-2.i_Iteration5_Lasso [2025-02-06 19:30:14,949 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:30:14,949 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:30:14,951 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:30:14,953 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:30:14,955 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:30:14,956 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:30:14,966 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:30:14,967 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:30:14,969 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:30:14,978 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:30:14,981 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:30:14,986 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:30:14,989 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:30:14,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:30:14,992 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:30:14,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:30:14,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:30:14,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:30:14,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:30:15,000 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:30:15,002 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:30:15,004 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:30:15,005 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:30:15,007 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:30:15,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:30:15,010 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:30:15,012 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:30:15,013 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:30:15,014 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:30:15,019 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:30:15,021 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:30:15,024 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:30:15,025 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:30:15,027 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:30:15,590 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:30:15,935 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:30:15,935 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:30:15,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:30:15,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:30:15,938 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:30:15,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-02-06 19:30:15,941 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:30:15,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:30:15,952 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:30:15,952 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:30:15,952 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:30:15,952 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:30:15,952 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:30:15,952 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:30:15,953 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:30:15,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-02-06 19:30:15,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:30:15,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:30:15,960 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:30:15,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-02-06 19:30:15,962 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:30:15,972 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:30:15,972 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:30:15,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:30:15,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:30:15,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:30:15,972 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:30:15,972 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:30:15,973 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:30:15,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-02-06 19:30:15,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:30:15,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:30:15,982 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:30:15,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-02-06 19:30:15,983 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:30:15,993 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:30:15,993 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:30:15,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:30:15,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:30:15,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:30:15,993 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:30:15,993 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:30:15,994 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:30:16,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-02-06 19:30:16,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:30:16,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:30:16,005 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:30:16,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-02-06 19:30:16,019 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:30:16,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:30:16,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:30:16,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:30:16,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:30:16,030 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:30:16,030 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:30:16,033 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:30:16,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-02-06 19:30:16,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:30:16,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:30:16,041 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:30:16,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-02-06 19:30:16,043 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:30:16,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:30:16,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:30:16,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:30:16,053 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:30:16,055 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:30:16,055 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:30:16,057 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:30:16,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-02-06 19:30:16,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:30:16,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:30:16,065 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:30:16,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-02-06 19:30:16,067 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:30:16,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:30:16,077 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:30:16,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:30:16,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:30:16,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:30:16,078 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:30:16,078 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:30:16,079 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:30:16,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-02-06 19:30:16,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:30:16,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:30:16,088 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:30:16,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-02-06 19:30:16,091 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:30:16,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:30:16,101 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:30:16,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:30:16,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:30:16,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:30:16,101 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:30:16,101 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:30:16,102 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:30:16,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-02-06 19:30:16,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:30:16,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:30:16,109 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:30:16,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-02-06 19:30:16,111 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:30:16,121 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:30:16,122 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:30:16,122 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:30:16,122 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:30:16,123 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:30:16,123 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:30:16,125 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:30:16,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-02-06 19:30:16,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:30:16,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:30:16,132 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:30:16,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-02-06 19:30:16,133 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:30:16,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:30:16,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:30:16,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:30:16,143 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:30:16,144 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:30:16,144 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:30:16,147 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:30:16,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-02-06 19:30:16,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:30:16,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:30:16,154 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:30:16,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-02-06 19:30:16,155 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:30:16,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:30:16,166 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:30:16,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:30:16,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:30:16,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:30:16,166 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:30:16,166 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:30:16,167 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:30:16,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-02-06 19:30:16,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:30:16,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:30:16,174 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:30:16,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-02-06 19:30:16,176 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:30:16,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:30:16,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:30:16,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:30:16,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:30:16,186 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:30:16,186 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:30:16,192 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:30:16,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-02-06 19:30:16,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:30:16,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:30:16,199 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:30:16,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-02-06 19:30:16,201 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:30:16,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:30:16,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:30:16,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:30:16,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:30:16,212 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:30:16,212 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:30:16,214 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:30:16,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-02-06 19:30:16,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:30:16,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:30:16,221 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:30:16,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-02-06 19:30:16,223 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:30:16,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:30:16,233 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:30:16,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:30:16,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:30:16,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:30:16,233 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:30:16,233 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:30:16,234 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:30:16,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-02-06 19:30:16,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:30:16,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:30:16,241 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:30:16,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-02-06 19:30:16,243 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:30:16,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:30:16,252 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:30:16,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:30:16,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:30:16,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:30:16,253 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:30:16,253 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:30:16,254 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:30:16,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2025-02-06 19:30:16,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:30:16,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:30:16,262 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:30:16,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-02-06 19:30:16,263 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:30:16,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:30:16,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:30:16,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:30:16,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:30:16,274 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:30:16,274 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:30:16,276 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:30:16,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-02-06 19:30:16,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:30:16,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:30:16,284 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:30:16,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-02-06 19:30:16,285 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:30:16,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:30:16,298 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:30:16,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:30:16,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:30:16,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:30:16,299 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:30:16,299 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:30:16,300 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:30:16,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-02-06 19:30:16,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:30:16,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:30:16,307 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:30:16,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-02-06 19:30:16,308 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:30:16,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:30:16,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:30:16,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:30:16,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:30:16,319 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:30:16,319 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:30:16,322 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:30:16,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-02-06 19:30:16,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:30:16,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:30:16,331 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:30:16,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-02-06 19:30:16,333 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:30:16,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:30:16,343 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:30:16,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:30:16,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:30:16,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:30:16,343 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:30:16,343 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:30:16,344 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:30:16,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2025-02-06 19:30:16,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:30:16,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:30:16,351 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:30:16,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-02-06 19:30:16,353 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:30:16,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:30:16,363 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:30:16,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:30:16,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:30:16,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:30:16,363 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:30:16,363 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:30:16,364 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:30:16,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-02-06 19:30:16,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:30:16,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:30:16,371 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:30:16,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-02-06 19:30:16,373 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:30:16,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:30:16,382 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:30:16,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:30:16,382 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:30:16,382 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:30:16,383 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:30:16,383 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:30:16,384 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:30:16,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-02-06 19:30:16,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:30:16,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:30:16,391 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:30:16,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-02-06 19:30:16,392 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:30:16,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:30:16,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:30:16,402 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:30:16,402 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:30:16,406 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:30:16,407 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:30:16,409 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:30:16,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2025-02-06 19:30:16,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:30:16,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:30:16,416 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:30:16,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-02-06 19:30:16,418 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:30:16,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:30:16,427 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:30:16,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:30:16,428 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:30:16,428 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:30:16,428 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:30:16,428 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:30:16,429 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:30:16,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2025-02-06 19:30:16,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:30:16,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:30:16,436 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:30:16,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-02-06 19:30:16,437 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:30:16,447 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:30:16,447 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:30:16,447 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:30:16,447 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:30:16,448 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:30:16,448 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:30:16,451 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:30:16,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-02-06 19:30:16,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:30:16,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:30:16,459 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:30:16,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-02-06 19:30:16,460 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:30:16,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:30:16,470 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:30:16,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:30:16,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:30:16,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:30:16,470 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:30:16,470 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:30:16,471 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:30:16,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-02-06 19:30:16,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:30:16,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:30:16,478 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:30:16,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-02-06 19:30:16,480 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:30:16,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:30:16,489 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:30:16,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:30:16,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:30:16,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:30:16,490 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:30:16,490 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:30:16,490 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:30:16,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2025-02-06 19:30:16,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:30:16,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:30:16,498 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:30:16,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-02-06 19:30:16,500 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:30:16,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:30:16,510 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:30:16,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:30:16,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:30:16,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:30:16,510 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:30:16,510 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:30:16,511 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:30:16,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2025-02-06 19:30:16,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:30:16,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:30:16,518 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:30:16,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-02-06 19:30:16,520 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:30:16,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:30:16,529 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:30:16,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:30:16,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:30:16,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:30:16,530 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:30:16,530 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:30:16,531 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:30:16,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2025-02-06 19:30:16,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:30:16,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:30:16,538 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:30:16,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-02-06 19:30:16,539 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:30:16,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:30:16,549 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:30:16,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:30:16,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:30:16,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:30:16,549 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:30:16,549 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:30:16,550 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:30:16,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2025-02-06 19:30:16,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:30:16,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:30:16,558 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:30:16,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-02-06 19:30:16,559 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:30:16,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:30:16,569 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:30:16,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:30:16,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:30:16,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:30:16,569 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:30:16,569 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:30:16,570 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:30:16,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2025-02-06 19:30:16,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:30:16,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:30:16,578 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:30:16,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-02-06 19:30:16,581 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:30:16,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:30:16,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:30:16,591 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:30:16,591 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:30:16,593 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:30:16,593 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:30:16,595 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:30:16,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2025-02-06 19:30:16,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:30:16,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:30:16,603 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:30:16,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-02-06 19:30:16,604 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:30:16,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:30:16,615 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:30:16,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:30:16,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:30:16,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:30:16,615 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:30:16,615 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:30:16,616 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:30:16,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2025-02-06 19:30:16,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:30:16,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:30:16,623 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:30:16,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-02-06 19:30:16,625 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:30:16,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:30:16,634 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:30:16,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:30:16,635 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:30:16,635 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:30:16,635 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:30:16,635 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:30:16,636 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:30:16,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2025-02-06 19:30:16,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:30:16,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:30:16,643 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:30:16,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-02-06 19:30:16,645 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:30:16,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:30:16,654 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:30:16,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:30:16,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:30:16,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:30:16,655 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:30:16,655 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:30:16,656 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:30:16,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-02-06 19:30:16,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:30:16,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:30:16,663 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:30:16,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-02-06 19:30:16,665 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:30:16,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:30:16,675 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:30:16,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:30:16,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:30:16,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:30:16,675 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:30:16,675 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:30:16,676 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:30:16,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2025-02-06 19:30:16,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:30:16,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:30:16,683 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:30:16,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-02-06 19:30:16,684 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:30:16,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:30:16,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:30:16,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:30:16,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:30:16,695 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:30:16,695 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:30:16,697 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:30:16,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-02-06 19:30:16,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:30:16,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:30:16,704 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:30:16,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-02-06 19:30:16,707 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:30:16,716 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:30:16,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:30:16,716 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:30:16,716 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:30:16,717 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:30:16,717 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:30:16,720 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:30:16,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-02-06 19:30:16,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:30:16,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:30:16,727 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:30:16,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-02-06 19:30:16,729 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:30:16,738 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:30:16,738 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:30:16,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:30:16,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:30:16,739 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:30:16,739 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:30:16,742 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:30:16,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2025-02-06 19:30:16,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:30:16,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:30:16,749 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:30:16,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-02-06 19:30:16,751 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:30:16,760 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:30:16,760 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:30:16,760 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:30:16,760 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:30:16,761 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:30:16,761 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:30:16,763 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:30:16,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2025-02-06 19:30:16,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:30:16,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:30:16,770 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:30:16,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-02-06 19:30:16,772 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:30:16,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:30:16,781 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:30:16,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:30:16,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:30:16,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:30:16,782 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:30:16,782 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:30:16,783 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:30:16,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2025-02-06 19:30:16,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:30:16,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:30:16,789 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:30:16,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-02-06 19:30:16,791 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:30:16,800 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:30:16,801 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:30:16,801 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:30:16,801 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:30:16,802 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:30:16,802 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:30:16,804 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:30:16,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2025-02-06 19:30:16,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:30:16,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:30:16,811 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:30:16,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-02-06 19:30:16,813 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:30:16,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:30:16,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:30:16,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:30:16,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:30:16,823 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:30:16,823 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:30:16,825 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:30:16,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2025-02-06 19:30:16,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:30:16,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:30:16,833 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:30:16,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-02-06 19:30:16,835 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:30:16,845 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:30:16,845 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-02-06 19:30:16,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:30:16,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:30:16,847 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-02-06 19:30:16,847 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:30:16,850 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:30:16,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2025-02-06 19:30:16,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:30:16,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:30:16,858 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:30:16,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-02-06 19:30:16,859 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:30:16,869 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:30:16,869 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:30:16,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:30:16,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:30:16,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:30:16,869 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:30:16,869 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:30:16,870 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:30:16,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2025-02-06 19:30:16,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:30:16,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:30:16,877 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:30:16,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-02-06 19:30:16,878 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:30:16,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:30:16,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:30:16,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:30:16,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:30:16,889 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:30:16,889 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:30:16,891 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:30:16,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2025-02-06 19:30:16,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:30:16,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:30:16,898 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:30:16,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-02-06 19:30:16,900 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:30:16,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:30:16,910 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:30:16,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:30:16,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:30:16,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:30:16,912 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:30:16,912 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:30:16,913 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:30:16,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2025-02-06 19:30:16,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:30:16,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:30:16,920 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:30:16,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-02-06 19:30:16,922 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:30:16,931 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:30:16,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:30:16,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:30:16,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:30:16,932 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:30:16,932 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:30:16,934 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:30:16,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2025-02-06 19:30:16,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:30:16,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:30:16,942 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:30:16,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-02-06 19:30:16,944 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:30:16,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:30:16,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:30:16,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:30:16,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:30:16,958 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:30:16,958 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:30:16,965 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:30:16,982 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-02-06 19:30:16,982 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 13 variables to zero. [2025-02-06 19:30:16,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:30:16,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:30:16,984 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:30:16,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-02-06 19:30:16,986 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:30:16,997 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:30:16,997 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:30:16,997 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-02-06 19:30:17,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2025-02-06 19:30:17,016 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2025-02-06 19:30:17,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:30:17,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 19:30:17,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 19:30:17,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:30:17,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:30:17,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:30:17,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:30:17,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:30:17,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:30:17,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:30:17,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:30:17,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 19:30:17,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:30:17,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:30:17,102 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-02-06 19:30:17,103 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-02-06 19:30:17,122 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-02-06 19:30:17,122 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-02-06 19:30:17,123 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-02-06 19:30:17,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2025-02-06 19:30:17,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 16 letters. Loop has 4 letters. [2025-02-06 19:30:17,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:30:17,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 20 letters. Loop has 4 letters. [2025-02-06 19:30:17,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:30:17,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 16 letters. Loop has 8 letters. [2025-02-06 19:30:17,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:30:17,123 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2025-02-06 19:30:17,124 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2025-02-06 19:30:17,124 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 29 states and 38 transitions. [2025-02-06 19:30:17,124 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-02-06 19:30:17,125 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2025-02-06 19:30:17,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 38 transitions. [2025-02-06 19:30:17,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:30:17,125 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 38 transitions. [2025-02-06 19:30:17,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 38 transitions. [2025-02-06 19:30:17,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2025-02-06 19:30:17,128 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-02-06 19:30:17,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2025-02-06 19:30:17,128 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 37 transitions. [2025-02-06 19:30:17,128 INFO L432 stractBuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2025-02-06 19:30:17,128 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-06 19:30:17,128 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. [2025-02-06 19:30:17,129 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2025-02-06 19:30:17,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:30:17,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:30:17,129 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:30:17,129 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:30:17,129 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-02-06 19:30:17,131 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-02-06 19:30:17,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:30:17,131 INFO L85 PathProgramCache]: Analyzing trace with hash -532728011, now seen corresponding path program 1 times [2025-02-06 19:30:17,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:30:17,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287456971] [2025-02-06 19:30:17,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:30:17,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:30:17,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 19:30:17,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 19:30:17,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:30:17,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:30:17,242 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-06 19:30:17,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:30:17,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287456971] [2025-02-06 19:30:17,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287456971] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:30:17,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:30:17,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 19:30:17,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301214006] [2025-02-06 19:30:17,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:30:17,243 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:30:17,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:30:17,243 INFO L85 PathProgramCache]: Analyzing trace with hash 34, now seen corresponding path program 1 times [2025-02-06 19:30:17,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:30:17,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714586465] [2025-02-06 19:30:17,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:30:17,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:30:17,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:30:17,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:30:17,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:30:17,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:30:17,247 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:30:17,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:30:17,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:30:17,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:30:17,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:30:17,251 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:30:17,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:30:17,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 19:30:17,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 19:30:17,282 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-02-06 19:30:17,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:30:17,299 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2025-02-06 19:30:17,299 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 45 transitions. [2025-02-06 19:30:17,300 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2025-02-06 19:30:17,300 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 45 transitions. [2025-02-06 19:30:17,300 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2025-02-06 19:30:17,300 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2025-02-06 19:30:17,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 45 transitions. [2025-02-06 19:30:17,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:30:17,300 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 45 transitions. [2025-02-06 19:30:17,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 45 transitions. [2025-02-06 19:30:17,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2025-02-06 19:30:17,301 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-02-06 19:30:17,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2025-02-06 19:30:17,302 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 36 transitions. [2025-02-06 19:30:17,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 19:30:17,302 INFO L432 stractBuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2025-02-06 19:30:17,302 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-06 19:30:17,303 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2025-02-06 19:30:17,303 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2025-02-06 19:30:17,303 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:30:17,303 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:30:17,303 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:30:17,303 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:30:17,304 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-02-06 19:30:17,304 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-02-06 19:30:17,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:30:17,304 INFO L85 PathProgramCache]: Analyzing trace with hash -584411502, now seen corresponding path program 1 times [2025-02-06 19:30:17,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:30:17,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247825091] [2025-02-06 19:30:17,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:30:17,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:30:17,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 19:30:17,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 19:30:17,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:30:17,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:30:17,327 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:30:17,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 19:30:17,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 19:30:17,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:30:17,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:30:17,350 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:30:17,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:30:17,350 INFO L85 PathProgramCache]: Analyzing trace with hash 39, now seen corresponding path program 1 times [2025-02-06 19:30:17,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:30:17,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597896243] [2025-02-06 19:30:17,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:30:17,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:30:17,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:30:17,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:30:17,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:30:17,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:30:17,358 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:30:17,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:30:17,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:30:17,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:30:17,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:30:17,363 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:30:17,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:30:17,365 INFO L85 PathProgramCache]: Analyzing trace with hash -936887370, now seen corresponding path program 1 times [2025-02-06 19:30:17,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:30:17,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902889839] [2025-02-06 19:30:17,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:30:17,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:30:17,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 19:30:17,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 19:30:17,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:30:17,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:30:17,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2025-02-06 19:30:17,460 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-06 19:30:17,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:30:17,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902889839] [2025-02-06 19:30:17,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902889839] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:30:17,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:30:17,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 19:30:17,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821533608] [2025-02-06 19:30:17,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:30:17,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:30:17,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 19:30:17,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 19:30:17,545 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-02-06 19:30:17,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:30:17,565 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2025-02-06 19:30:17,565 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 46 transitions. [2025-02-06 19:30:17,566 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2025-02-06 19:30:17,566 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 46 transitions. [2025-02-06 19:30:17,566 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2025-02-06 19:30:17,566 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2025-02-06 19:30:17,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 46 transitions. [2025-02-06 19:30:17,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:30:17,566 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 46 transitions. [2025-02-06 19:30:17,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 46 transitions. [2025-02-06 19:30:17,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2025-02-06 19:30:17,568 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-02-06 19:30:17,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2025-02-06 19:30:17,568 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 42 transitions. [2025-02-06 19:30:17,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 19:30:17,569 INFO L432 stractBuchiCegarLoop]: Abstraction has 33 states and 42 transitions. [2025-02-06 19:30:17,569 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-02-06 19:30:17,569 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 42 transitions. [2025-02-06 19:30:17,569 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2025-02-06 19:30:17,569 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:30:17,569 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:30:17,570 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:30:17,570 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:30:17,570 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-02-06 19:30:17,570 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-02-06 19:30:17,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:30:17,570 INFO L85 PathProgramCache]: Analyzing trace with hash -936885389, now seen corresponding path program 1 times [2025-02-06 19:30:17,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:30:17,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593876768] [2025-02-06 19:30:17,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:30:17,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:30:17,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 19:30:17,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 19:30:17,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:30:17,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:30:17,657 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-06 19:30:17,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:30:17,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593876768] [2025-02-06 19:30:17,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593876768] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:30:17,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:30:17,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 19:30:17,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523919110] [2025-02-06 19:30:17,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:30:17,658 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:30:17,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:30:17,658 INFO L85 PathProgramCache]: Analyzing trace with hash 34, now seen corresponding path program 2 times [2025-02-06 19:30:17,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:30:17,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870302693] [2025-02-06 19:30:17,658 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:30:17,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:30:17,661 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:30:17,661 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:30:17,661 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:30:17,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:30:17,662 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:30:17,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:30:17,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:30:17,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:30:17,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:30:17,664 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:30:17,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:30:17,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 19:30:17,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 19:30:17,695 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-02-06 19:30:17,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:30:17,715 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2025-02-06 19:30:17,715 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 48 transitions. [2025-02-06 19:30:17,715 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2025-02-06 19:30:17,716 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 38 states and 46 transitions. [2025-02-06 19:30:17,716 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2025-02-06 19:30:17,716 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2025-02-06 19:30:17,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 46 transitions. [2025-02-06 19:30:17,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:30:17,716 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 46 transitions. [2025-02-06 19:30:17,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 46 transitions. [2025-02-06 19:30:17,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 33. [2025-02-06 19:30:17,717 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-02-06 19:30:17,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2025-02-06 19:30:17,717 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 41 transitions. [2025-02-06 19:30:17,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 19:30:17,719 INFO L432 stractBuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2025-02-06 19:30:17,719 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-02-06 19:30:17,719 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 41 transitions. [2025-02-06 19:30:17,720 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2025-02-06 19:30:17,720 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:30:17,720 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:30:17,720 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:30:17,720 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:30:17,720 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-02-06 19:30:17,720 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-02-06 19:30:17,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:30:17,721 INFO L85 PathProgramCache]: Analyzing trace with hash -938732431, now seen corresponding path program 1 times [2025-02-06 19:30:17,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:30:17,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560218099] [2025-02-06 19:30:17,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:30:17,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:30:17,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 19:30:17,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 19:30:17,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:30:17,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:30:17,810 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-06 19:30:17,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:30:17,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560218099] [2025-02-06 19:30:17,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560218099] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:30:17,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557721255] [2025-02-06 19:30:17,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:30:17,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:30:17,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:30:17,813 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:30:17,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2025-02-06 19:30:17,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 19:30:17,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 19:30:17,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:30:17,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:30:17,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 19:30:17,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:30:17,960 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-06 19:30:17,960 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:30:18,012 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-06 19:30:18,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557721255] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:30:18,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:30:18,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-06 19:30:18,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402698465] [2025-02-06 19:30:18,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:30:18,013 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:30:18,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:30:18,013 INFO L85 PathProgramCache]: Analyzing trace with hash 34, now seen corresponding path program 3 times [2025-02-06 19:30:18,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:30:18,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344644379] [2025-02-06 19:30:18,013 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:30:18,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:30:18,017 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:30:18,018 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:30:18,018 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 19:30:18,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:30:18,018 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:30:18,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:30:18,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:30:18,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:30:18,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:30:18,020 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:30:18,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:30:18,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 19:30:18,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-06 19:30:18,051 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-02-06 19:30:18,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:30:18,104 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2025-02-06 19:30:18,104 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 66 transitions. [2025-02-06 19:30:18,104 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2025-02-06 19:30:18,105 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 53 states and 66 transitions. [2025-02-06 19:30:18,106 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2025-02-06 19:30:18,106 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2025-02-06 19:30:18,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 66 transitions. [2025-02-06 19:30:18,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:30:18,106 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53 states and 66 transitions. [2025-02-06 19:30:18,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 66 transitions. [2025-02-06 19:30:18,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 45. [2025-02-06 19:30:18,108 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-02-06 19:30:18,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2025-02-06 19:30:18,108 INFO L240 hiAutomatonCegarLoop]: Abstraction has 45 states and 56 transitions. [2025-02-06 19:30:18,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 19:30:18,109 INFO L432 stractBuchiCegarLoop]: Abstraction has 45 states and 56 transitions. [2025-02-06 19:30:18,109 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-02-06 19:30:18,109 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 56 transitions. [2025-02-06 19:30:18,109 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2025-02-06 19:30:18,109 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:30:18,109 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:30:18,109 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:30:18,110 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:30:18,110 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-02-06 19:30:18,110 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-02-06 19:30:18,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:30:18,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1021262576, now seen corresponding path program 1 times [2025-02-06 19:30:18,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:30:18,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320729832] [2025-02-06 19:30:18,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:30:18,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:30:18,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 19:30:18,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 19:30:18,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:30:18,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:30:18,129 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:30:18,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 19:30:18,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 19:30:18,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:30:18,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:30:18,148 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:30:18,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:30:18,150 INFO L85 PathProgramCache]: Analyzing trace with hash 34, now seen corresponding path program 4 times [2025-02-06 19:30:18,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:30:18,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841319909] [2025-02-06 19:30:18,150 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:30:18,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:30:18,153 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1 statements into 2 equivalence classes. [2025-02-06 19:30:18,154 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:30:18,154 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:30:18,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:30:18,155 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:30:18,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:30:18,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:30:18,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:30:18,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:30:18,158 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:30:18,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:30:18,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1594368787, now seen corresponding path program 1 times [2025-02-06 19:30:18,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:30:18,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350914768] [2025-02-06 19:30:18,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:30:18,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:30:18,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 19:30:18,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 19:30:18,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:30:18,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:30:18,183 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:30:18,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 19:30:18,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 19:30:18,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:30:18,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:30:18,205 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace