./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/reducercommutativity/sep.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/reducercommutativity/sep.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 54d2da4a9e5a645ffa7361038eff25cc32e29a265e0324de9bda9a6d773becac --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:44:02,844 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:44:02,901 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-04 15:44:02,908 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:44:02,908 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:44:02,908 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 15:44:02,930 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:44:02,931 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:44:02,931 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:44:02,931 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:44:02,932 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:44:02,932 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:44:02,932 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:44:02,932 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:44:02,932 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 15:44:02,932 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 15:44:02,932 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 15:44:02,932 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 15:44:02,932 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 15:44:02,932 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 15:44:02,932 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:44:02,933 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 15:44:02,933 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:44:02,933 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:44:02,933 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:44:02,933 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:44:02,933 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 15:44:02,933 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 15:44:02,933 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 15:44:02,933 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:44:02,933 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:44:02,933 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:44:02,933 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 15:44:02,933 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:44:02,933 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:44:02,933 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:44:02,933 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:44:02,933 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:44:02,933 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:44:02,934 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 15:44:02,934 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 54d2da4a9e5a645ffa7361038eff25cc32e29a265e0324de9bda9a6d773becac [2025-03-04 15:44:03,157 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:44:03,165 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:44:03,166 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:44:03,168 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:44:03,168 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:44:03,170 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/sep.i [2025-03-04 15:44:04,313 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/714d22272/f415572643194879b6d414fb292835b9/FLAG28fe6b79e [2025-03-04 15:44:04,509 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:44:04,510 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sep.i [2025-03-04 15:44:04,515 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/714d22272/f415572643194879b6d414fb292835b9/FLAG28fe6b79e [2025-03-04 15:44:04,526 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/714d22272/f415572643194879b6d414fb292835b9 [2025-03-04 15:44:04,527 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:44:04,528 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:44:04,529 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:44:04,529 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:44:04,532 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:44:04,532 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:44:04" (1/1) ... [2025-03-04 15:44:04,533 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@356106e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:44:04, skipping insertion in model container [2025-03-04 15:44:04,533 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:44:04" (1/1) ... [2025-03-04 15:44:04,542 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:44:04,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:44:04,679 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:44:04,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:44:04,709 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:44:04,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:44:04 WrapperNode [2025-03-04 15:44:04,710 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:44:04,710 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:44:04,711 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:44:04,711 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:44:04,715 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:44:04" (1/1) ... [2025-03-04 15:44:04,720 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:44:04" (1/1) ... [2025-03-04 15:44:04,737 INFO L138 Inliner]: procedures = 16, calls = 27, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 116 [2025-03-04 15:44:04,737 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:44:04,738 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:44:04,738 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:44:04,738 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:44:04,743 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:44:04" (1/1) ... [2025-03-04 15:44:04,743 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:44:04" (1/1) ... [2025-03-04 15:44:04,749 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:44:04" (1/1) ... [2025-03-04 15:44:04,763 INFO L175 MemorySlicer]: Split 19 memory accesses to 3 slices as follows [2, 6, 11]. 58 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6, 0]. The 4 writes are split as follows [0, 0, 4]. [2025-03-04 15:44:04,763 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:44:04" (1/1) ... [2025-03-04 15:44:04,764 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:44:04" (1/1) ... [2025-03-04 15:44:04,770 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:44:04" (1/1) ... [2025-03-04 15:44:04,773 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:44:04" (1/1) ... [2025-03-04 15:44:04,776 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:44:04" (1/1) ... [2025-03-04 15:44:04,776 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:44:04" (1/1) ... [2025-03-04 15:44:04,781 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:44:04,781 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:44:04,782 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:44:04,782 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:44:04,782 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:44:04" (1/1) ... [2025-03-04 15:44:04,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:04,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:04,805 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:04,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-04 15:44:04,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:44:04,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:44:04,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:44:04,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 15:44:04,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 15:44:04,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:44:04,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:44:04,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 15:44:04,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:44:04,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:44:04,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:44:04,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:44:04,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 15:44:04,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 15:44:04,891 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:44:04,892 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:44:05,086 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-03-04 15:44:05,086 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:44:05,092 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:44:05,095 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:44:05,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:44:05 BoogieIcfgContainer [2025-03-04 15:44:05,096 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:44:05,096 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 15:44:05,096 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 15:44:05,100 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 15:44:05,101 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:44:05,101 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 03:44:04" (1/3) ... [2025-03-04 15:44:05,102 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c30693a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:44:05, skipping insertion in model container [2025-03-04 15:44:05,102 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:44:05,103 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:44:04" (2/3) ... [2025-03-04 15:44:05,103 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c30693a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:44:05, skipping insertion in model container [2025-03-04 15:44:05,103 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:44:05,103 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:44:05" (3/3) ... [2025-03-04 15:44:05,104 INFO L363 chiAutomizerObserver]: Analyzing ICFG sep.i [2025-03-04 15:44:05,142 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 15:44:05,142 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 15:44:05,142 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 15:44:05,142 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 15:44:05,142 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 15:44:05,143 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 15:44:05,143 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 15:44:05,143 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 15:44:05,147 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:44:05,156 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2025-03-04 15:44:05,156 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:44:05,156 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:44:05,160 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 15:44:05,160 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:44:05,160 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 15:44:05,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:44:05,162 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2025-03-04 15:44:05,162 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:44:05,162 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:44:05,162 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 15:44:05,162 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:44:05,167 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int#1(115, 2, 0, 1);call write~init~int#1(101, 2, 1, 1);call write~init~int#1(112, 2, 2, 1);call write~init~int#1(46, 2, 3, 1);call write~init~int#1(99, 2, 4, 1);call write~init~int#1(0, 2, 5, 1);~N~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post12#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;havoc main_#t~nondet5#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0 % 4294967296);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem1#1, sep_#t~post2#1, sep_#t~post3#1, sep_#t~post4#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0;" [2025-03-04 15:44:05,167 INFO L754 eck$LassoCheckResult]: Loop: "assume sep_~i~0#1 < ~N~0;call sep_#t~mem1#1 := read~int#2(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4);" "assume 0 == (if sep_#t~mem1#1 < 0 && 0 != sep_#t~mem1#1 % 2 then sep_#t~mem1#1 % 2 - 2 else sep_#t~mem1#1 % 2);havoc sep_#t~mem1#1;sep_#t~post2#1 := sep_~ret~0#1;sep_~ret~0#1 := 1 + sep_#t~post2#1;" "sep_#t~post4#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post4#1;havoc sep_#t~post4#1;" [2025-03-04 15:44:05,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:05,172 INFO L85 PathProgramCache]: Analyzing trace with hash 64512, now seen corresponding path program 1 times [2025-03-04 15:44:05,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:05,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39208692] [2025-03-04 15:44:05,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:44:05,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:05,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:44:05,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:44:05,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:05,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:05,252 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:05,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:44:05,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:44:05,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:05,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:05,278 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:05,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:05,281 INFO L85 PathProgramCache]: Analyzing trace with hash 60509, now seen corresponding path program 1 times [2025-03-04 15:44:05,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:05,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633673720] [2025-03-04 15:44:05,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:44:05,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:05,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:44:05,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:44:05,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:05,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:05,297 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:05,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:44:05,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:44:05,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:05,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:05,311 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:05,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:05,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1921907710, now seen corresponding path program 1 times [2025-03-04 15:44:05,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:05,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955616765] [2025-03-04 15:44:05,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:44:05,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:05,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:44:05,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:44:05,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:05,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:05,333 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:05,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:44:05,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:44:05,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:05,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:05,352 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:05,788 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:44:05,790 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:44:05,790 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:44:05,790 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:44:05,790 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:44:05,791 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:05,791 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:44:05,791 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:44:05,792 INFO L132 ssoRankerPreferences]: Filename of dumped script: sep.i_Iteration1_Lasso [2025-03-04 15:44:05,792 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:44:05,792 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:44:05,804 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:05,809 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:05,811 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:05,813 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:05,863 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:05,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:05,866 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:05,868 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:05,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:05,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:05,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:05,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:06,040 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:06,043 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:06,045 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:06,052 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:06,054 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:06,055 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:06,057 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:06,059 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:06,062 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:06,064 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:06,065 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:06,067 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:06,069 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:06,391 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:44:06,394 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:44:06,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:06,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:06,398 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:06,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-04 15:44:06,400 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:06,411 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:06,411 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:06,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:06,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:06,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:06,414 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:06,414 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:06,416 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:06,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-03-04 15:44:06,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:06,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:06,424 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:06,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-04 15:44:06,428 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:06,438 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:06,438 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:06,438 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:06,438 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:06,438 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:06,440 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:06,440 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:06,441 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:06,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-03-04 15:44:06,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:06,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:06,448 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:06,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-04 15:44:06,450 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:06,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:06,459 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:06,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:06,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:06,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:06,459 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:06,459 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:06,460 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:06,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-03-04 15:44:06,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:06,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:06,467 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:06,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-04 15:44:06,470 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:06,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:06,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:06,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:06,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:06,481 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:06,481 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:06,484 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:06,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:06,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:06,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:06,492 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:06,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-04 15:44:06,495 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:06,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:06,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:06,505 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:06,505 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:06,507 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:06,507 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:06,512 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:06,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:06,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:06,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:06,519 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:06,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-04 15:44:06,522 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:06,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:06,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:06,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:06,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:06,534 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:06,534 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:06,536 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:06,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-03-04 15:44:06,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:06,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:06,545 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:06,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-04 15:44:06,547 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:06,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:06,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:06,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:06,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:06,559 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:06,559 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:06,562 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:06,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:06,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:06,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:06,569 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:06,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-04 15:44:06,572 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:06,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:06,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:06,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:06,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:06,585 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:06,585 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:06,587 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:06,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:06,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:06,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:06,596 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:06,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-04 15:44:06,599 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:06,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:06,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:06,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:06,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:06,612 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:06,613 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:06,615 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:06,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:06,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:06,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:06,623 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:06,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-04 15:44:06,626 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:06,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:06,636 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:06,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:06,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:06,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:06,636 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:06,636 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:06,637 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:06,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:06,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:06,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:06,645 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:06,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-03-04 15:44:06,647 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:06,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:06,656 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:06,656 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:06,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:06,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:06,657 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:06,657 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:06,658 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:06,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-03-04 15:44:06,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:06,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:06,665 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:06,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-03-04 15:44:06,667 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:06,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:06,676 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:06,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:06,676 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:06,676 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:06,677 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:06,677 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:06,678 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:06,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-03-04 15:44:06,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:06,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:06,684 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:06,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-03-04 15:44:06,686 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:06,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:06,695 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:06,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:06,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:06,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:06,696 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:06,696 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:06,697 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:06,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-03-04 15:44:06,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:06,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:06,703 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:06,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-03-04 15:44:06,705 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:06,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:06,714 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:06,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:06,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:06,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:06,715 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:06,715 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:06,716 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:06,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:06,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:06,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:06,723 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:06,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-03-04 15:44:06,725 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:06,737 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:06,738 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:06,738 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:06,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:06,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:06,738 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:06,738 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:06,740 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:06,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-03-04 15:44:06,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:06,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:06,747 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:06,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-03-04 15:44:06,748 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:06,757 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:06,757 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:06,757 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:06,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:06,758 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:06,758 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:06,758 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:06,759 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:06,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-03-04 15:44:06,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:06,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:06,766 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:06,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-03-04 15:44:06,767 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:06,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:06,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:06,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:06,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:06,778 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:06,778 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:06,781 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:06,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-03-04 15:44:06,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:06,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:06,789 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:06,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-03-04 15:44:06,793 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:06,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:06,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:06,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:06,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:06,811 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:06,811 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:06,819 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:44:06,849 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-03-04 15:44:06,850 INFO L444 ModelExtractionUtils]: 3 out of 19 variables were initially zero. Simplification set additionally 13 variables to zero. [2025-03-04 15:44:06,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:06,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:06,853 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:06,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-03-04 15:44:06,856 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:44:06,867 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:44:06,867 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:44:06,867 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~N~0, ULTIMATE.start_sep_~i~0#1) = 1*~N~0 - 1*ULTIMATE.start_sep_~i~0#1 Supporting invariants [] [2025-03-04 15:44:06,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-03-04 15:44:06,888 INFO L156 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2025-03-04 15:44:06,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:06,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:44:06,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:44:06,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:06,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:06,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:44:06,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:06,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:44:06,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:44:06,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:06,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:06,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:44:06,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:06,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:44:06,981 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-04 15:44:06,983 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:44:07,015 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 31 states and 42 transitions. Complement of second has 5 states. [2025-03-04 15:44:07,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-04 15:44:07,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:44:07,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2025-03-04 15:44:07,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 3 letters. Loop has 3 letters. [2025-03-04 15:44:07,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:07,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 6 letters. Loop has 3 letters. [2025-03-04 15:44:07,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:07,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 3 letters. Loop has 6 letters. [2025-03-04 15:44:07,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:07,026 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 42 transitions. [2025-03-04 15:44:07,027 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2025-03-04 15:44:07,029 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 16 states and 23 transitions. [2025-03-04 15:44:07,029 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2025-03-04 15:44:07,029 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-03-04 15:44:07,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 23 transitions. [2025-03-04 15:44:07,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:44:07,030 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 23 transitions. [2025-03-04 15:44:07,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 23 transitions. [2025-03-04 15:44:07,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-03-04 15:44:07,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.4375) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:44:07,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2025-03-04 15:44:07,046 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 23 transitions. [2025-03-04 15:44:07,046 INFO L432 stractBuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2025-03-04 15:44:07,046 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 15:44:07,046 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 23 transitions. [2025-03-04 15:44:07,047 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2025-03-04 15:44:07,047 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:44:07,047 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:44:07,047 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-04 15:44:07,047 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:44:07,047 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int#1(115, 2, 0, 1);call write~init~int#1(101, 2, 1, 1);call write~init~int#1(112, 2, 2, 1);call write~init~int#1(46, 2, 3, 1);call write~init~int#1(99, 2, 4, 1);call write~init~int#1(0, 2, 5, 1);~N~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post12#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;havoc main_#t~nondet5#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0 % 4294967296);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem1#1, sep_#t~post2#1, sep_#t~post3#1, sep_#t~post4#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0;" "assume !(sep_~i~0#1 < ~N~0);havoc sep_~i~0#1;sep_#res#1 := (if sep_~ret~0#1 % 4294967296 <= 2147483647 then sep_~ret~0#1 % 4294967296 else sep_~ret~0#1 % 4294967296 - 4294967296);" "main_#t~ret6#1 := sep_#res#1;havoc sep_#t~mem1#1, sep_#t~post2#1, sep_#t~post3#1, sep_#t~post4#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;havoc sep_#in~x#1.base, sep_#in~x#1.offset;assume { :end_inline_sep } true;main_~ret~1#1 := main_#t~ret6#1;havoc main_#t~ret6#1;call main_#t~mem7#1 := read~int#2(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#2(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#2(main_#t~mem8#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem8#1;call write~int#2(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem1#1, sep_#t~post2#1, sep_#t~post3#1, sep_#t~post4#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0;" [2025-03-04 15:44:07,047 INFO L754 eck$LassoCheckResult]: Loop: "assume sep_~i~0#1 < ~N~0;call sep_#t~mem1#1 := read~int#2(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4);" "assume 0 == (if sep_#t~mem1#1 < 0 && 0 != sep_#t~mem1#1 % 2 then sep_#t~mem1#1 % 2 - 2 else sep_#t~mem1#1 % 2);havoc sep_#t~mem1#1;sep_#t~post2#1 := sep_~ret~0#1;sep_~ret~0#1 := 1 + sep_#t~post2#1;" "sep_#t~post4#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post4#1;havoc sep_#t~post4#1;" [2025-03-04 15:44:07,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:07,048 INFO L85 PathProgramCache]: Analyzing trace with hash 61996894, now seen corresponding path program 1 times [2025-03-04 15:44:07,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:07,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496595144] [2025-03-04 15:44:07,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:44:07,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:07,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:44:07,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:44:07,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:07,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:07,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:44:07,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:44:07,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496595144] [2025-03-04 15:44:07,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496595144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:44:07,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:44:07,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:44:07,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785967734] [2025-03-04 15:44:07,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:44:07,158 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:44:07,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:07,158 INFO L85 PathProgramCache]: Analyzing trace with hash 53558, now seen corresponding path program 1 times [2025-03-04 15:44:07,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:07,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090898984] [2025-03-04 15:44:07,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:44:07,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:07,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:44:07,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:44:07,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:07,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:07,164 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:07,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:44:07,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:44:07,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:07,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:07,168 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:07,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-03-04 15:44:07,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:44:07,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:44:07,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:44:07,242 INFO L87 Difference]: Start difference. First operand 16 states and 23 transitions. cyclomatic complexity: 11 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:44:07,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:44:07,264 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2025-03-04 15:44:07,264 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 25 transitions. [2025-03-04 15:44:07,265 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2025-03-04 15:44:07,265 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 25 transitions. [2025-03-04 15:44:07,265 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-03-04 15:44:07,265 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-03-04 15:44:07,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2025-03-04 15:44:07,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:44:07,265 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 25 transitions. [2025-03-04 15:44:07,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2025-03-04 15:44:07,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2025-03-04 15:44:07,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:44:07,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2025-03-04 15:44:07,266 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 22 transitions. [2025-03-04 15:44:07,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:44:07,267 INFO L432 stractBuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2025-03-04 15:44:07,267 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-04 15:44:07,267 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2025-03-04 15:44:07,267 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2025-03-04 15:44:07,267 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:44:07,267 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:44:07,267 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:44:07,267 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:44:07,267 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int#1(115, 2, 0, 1);call write~init~int#1(101, 2, 1, 1);call write~init~int#1(112, 2, 2, 1);call write~init~int#1(46, 2, 3, 1);call write~init~int#1(99, 2, 4, 1);call write~init~int#1(0, 2, 5, 1);~N~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post12#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;havoc main_#t~nondet5#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0 % 4294967296);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem1#1, sep_#t~post2#1, sep_#t~post3#1, sep_#t~post4#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0;" "assume sep_~i~0#1 < ~N~0;call sep_#t~mem1#1 := read~int#2(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4);" "assume !(0 == (if sep_#t~mem1#1 < 0 && 0 != sep_#t~mem1#1 % 2 then sep_#t~mem1#1 % 2 - 2 else sep_#t~mem1#1 % 2));havoc sep_#t~mem1#1;sep_#t~post3#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post3#1 - 1;" "sep_#t~post4#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post4#1;havoc sep_#t~post4#1;" "assume !(sep_~i~0#1 < ~N~0);havoc sep_~i~0#1;sep_#res#1 := (if sep_~ret~0#1 % 4294967296 <= 2147483647 then sep_~ret~0#1 % 4294967296 else sep_~ret~0#1 % 4294967296 - 4294967296);" "main_#t~ret6#1 := sep_#res#1;havoc sep_#t~mem1#1, sep_#t~post2#1, sep_#t~post3#1, sep_#t~post4#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;havoc sep_#in~x#1.base, sep_#in~x#1.offset;assume { :end_inline_sep } true;main_~ret~1#1 := main_#t~ret6#1;havoc main_#t~ret6#1;call main_#t~mem7#1 := read~int#2(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#2(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#2(main_#t~mem8#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem8#1;call write~int#2(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem1#1, sep_#t~post2#1, sep_#t~post3#1, sep_#t~post4#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0;" [2025-03-04 15:44:07,267 INFO L754 eck$LassoCheckResult]: Loop: "assume sep_~i~0#1 < ~N~0;call sep_#t~mem1#1 := read~int#2(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4);" "assume 0 == (if sep_#t~mem1#1 < 0 && 0 != sep_#t~mem1#1 % 2 then sep_#t~mem1#1 % 2 - 2 else sep_#t~mem1#1 % 2);havoc sep_#t~mem1#1;sep_#t~post2#1 := sep_~ret~0#1;sep_~ret~0#1 := 1 + sep_#t~post2#1;" "sep_#t~post4#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post4#1;havoc sep_#t~post4#1;" [2025-03-04 15:44:07,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:07,268 INFO L85 PathProgramCache]: Analyzing trace with hash 117402683, now seen corresponding path program 1 times [2025-03-04 15:44:07,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:07,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937862456] [2025-03-04 15:44:07,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:44:07,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:07,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:44:07,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:44:07,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:07,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:07,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:44:07,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:44:07,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937862456] [2025-03-04 15:44:07,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937862456] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:44:07,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261975482] [2025-03-04 15:44:07,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:44:07,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:44:07,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:07,345 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:44:07,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 15:44:07,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:44:07,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:44:07,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:07,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:07,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:44:07,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:07,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:44:07,428 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:44:07,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:44:07,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261975482] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:44:07,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:44:07,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 15:44:07,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63047553] [2025-03-04 15:44:07,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:44:07,451 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:44:07,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:07,451 INFO L85 PathProgramCache]: Analyzing trace with hash 53558, now seen corresponding path program 2 times [2025-03-04 15:44:07,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:07,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478839623] [2025-03-04 15:44:07,451 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:44:07,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:07,455 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:44:07,460 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:44:07,460 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:44:07,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:07,460 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:07,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:44:07,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:44:07,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:07,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:07,464 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:07,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:44:07,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 15:44:07,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:44:07,514 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 10 Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:44:07,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:44:07,549 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2025-03-04 15:44:07,549 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 29 transitions. [2025-03-04 15:44:07,549 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2025-03-04 15:44:07,550 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 29 transitions. [2025-03-04 15:44:07,550 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-03-04 15:44:07,550 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-03-04 15:44:07,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 29 transitions. [2025-03-04 15:44:07,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:44:07,550 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 29 transitions. [2025-03-04 15:44:07,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 29 transitions. [2025-03-04 15:44:07,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2025-03-04 15:44:07,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:44:07,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2025-03-04 15:44:07,551 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 26 transitions. [2025-03-04 15:44:07,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:44:07,552 INFO L432 stractBuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2025-03-04 15:44:07,552 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-04 15:44:07,552 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2025-03-04 15:44:07,553 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2025-03-04 15:44:07,553 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:44:07,553 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:44:07,553 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 15:44:07,553 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:44:07,553 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int#1(115, 2, 0, 1);call write~init~int#1(101, 2, 1, 1);call write~init~int#1(112, 2, 2, 1);call write~init~int#1(46, 2, 3, 1);call write~init~int#1(99, 2, 4, 1);call write~init~int#1(0, 2, 5, 1);~N~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post12#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;havoc main_#t~nondet5#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0 % 4294967296);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem1#1, sep_#t~post2#1, sep_#t~post3#1, sep_#t~post4#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0;" "assume sep_~i~0#1 < ~N~0;call sep_#t~mem1#1 := read~int#2(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4);" "assume !(0 == (if sep_#t~mem1#1 < 0 && 0 != sep_#t~mem1#1 % 2 then sep_#t~mem1#1 % 2 - 2 else sep_#t~mem1#1 % 2));havoc sep_#t~mem1#1;sep_#t~post3#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post3#1 - 1;" "sep_#t~post4#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post4#1;havoc sep_#t~post4#1;" "assume sep_~i~0#1 < ~N~0;call sep_#t~mem1#1 := read~int#2(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4);" "assume !(0 == (if sep_#t~mem1#1 < 0 && 0 != sep_#t~mem1#1 % 2 then sep_#t~mem1#1 % 2 - 2 else sep_#t~mem1#1 % 2));havoc sep_#t~mem1#1;sep_#t~post3#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post3#1 - 1;" "sep_#t~post4#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post4#1;havoc sep_#t~post4#1;" "assume !(sep_~i~0#1 < ~N~0);havoc sep_~i~0#1;sep_#res#1 := (if sep_~ret~0#1 % 4294967296 <= 2147483647 then sep_~ret~0#1 % 4294967296 else sep_~ret~0#1 % 4294967296 - 4294967296);" "main_#t~ret6#1 := sep_#res#1;havoc sep_#t~mem1#1, sep_#t~post2#1, sep_#t~post3#1, sep_#t~post4#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;havoc sep_#in~x#1.base, sep_#in~x#1.offset;assume { :end_inline_sep } true;main_~ret~1#1 := main_#t~ret6#1;havoc main_#t~ret6#1;call main_#t~mem7#1 := read~int#2(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#2(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#2(main_#t~mem8#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem8#1;call write~int#2(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem1#1, sep_#t~post2#1, sep_#t~post3#1, sep_#t~post4#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0;" [2025-03-04 15:44:07,553 INFO L754 eck$LassoCheckResult]: Loop: "assume sep_~i~0#1 < ~N~0;call sep_#t~mem1#1 := read~int#2(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4);" "assume 0 == (if sep_#t~mem1#1 < 0 && 0 != sep_#t~mem1#1 % 2 then sep_#t~mem1#1 % 2 - 2 else sep_#t~mem1#1 % 2);havoc sep_#t~mem1#1;sep_#t~post2#1 := sep_~ret~0#1;sep_~ret~0#1 := 1 + sep_#t~post2#1;" "sep_#t~post4#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post4#1;havoc sep_#t~post4#1;" [2025-03-04 15:44:07,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:07,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1443821118, now seen corresponding path program 2 times [2025-03-04 15:44:07,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:07,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704695328] [2025-03-04 15:44:07,554 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:44:07,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:07,560 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-04 15:44:07,579 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:44:07,579 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:44:07,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:07,579 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:07,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:44:07,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:44:07,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:07,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:07,599 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:07,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:07,600 INFO L85 PathProgramCache]: Analyzing trace with hash 53558, now seen corresponding path program 3 times [2025-03-04 15:44:07,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:07,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305680145] [2025-03-04 15:44:07,600 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:44:07,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:07,607 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:44:07,610 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:44:07,610 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:44:07,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:07,611 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:07,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:44:07,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:44:07,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:07,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:07,617 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:07,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:07,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1222519335, now seen corresponding path program 1 times [2025-03-04 15:44:07,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:07,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444323936] [2025-03-04 15:44:07,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:44:07,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:07,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:44:07,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:44:07,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:07,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:08,138 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:44:08,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:44:08,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444323936] [2025-03-04 15:44:08,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444323936] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:44:08,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156996455] [2025-03-04 15:44:08,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:44:08,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:44:08,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:08,140 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:44:08,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-04 15:44:08,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:44:08,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:44:08,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:08,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:08,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 15:44:08,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:08,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 15 [2025-03-04 15:44:08,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-04 15:44:08,305 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:44:08,305 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:44:08,382 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2025-03-04 15:44:08,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2025-03-04 15:44:08,428 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:44:08,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156996455] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:44:08,428 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:44:08,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-03-04 15:44:08,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441366598] [2025-03-04 15:44:08,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:44:08,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:44:08,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 15:44:08,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-03-04 15:44:08,474 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 11 Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:44:08,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:44:08,861 INFO L93 Difference]: Finished difference Result 50 states and 73 transitions. [2025-03-04 15:44:08,861 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 73 transitions. [2025-03-04 15:44:08,862 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2025-03-04 15:44:08,863 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 50 states and 73 transitions. [2025-03-04 15:44:08,864 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2025-03-04 15:44:08,864 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2025-03-04 15:44:08,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 73 transitions. [2025-03-04 15:44:08,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:44:08,864 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 73 transitions. [2025-03-04 15:44:08,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 73 transitions. [2025-03-04 15:44:08,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 26. [2025-03-04 15:44:08,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 25 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:44:08,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2025-03-04 15:44:08,866 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 37 transitions. [2025-03-04 15:44:08,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 15:44:08,867 INFO L432 stractBuchiCegarLoop]: Abstraction has 26 states and 37 transitions. [2025-03-04 15:44:08,867 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-04 15:44:08,867 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 37 transitions. [2025-03-04 15:44:08,867 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2025-03-04 15:44:08,867 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:44:08,867 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:44:08,867 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:44:08,868 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:44:08,868 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int#1(115, 2, 0, 1);call write~init~int#1(101, 2, 1, 1);call write~init~int#1(112, 2, 2, 1);call write~init~int#1(46, 2, 3, 1);call write~init~int#1(99, 2, 4, 1);call write~init~int#1(0, 2, 5, 1);~N~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post12#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;havoc main_#t~nondet5#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0 % 4294967296);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem1#1, sep_#t~post2#1, sep_#t~post3#1, sep_#t~post4#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0;" "assume sep_~i~0#1 < ~N~0;call sep_#t~mem1#1 := read~int#2(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4);" "assume !(0 == (if sep_#t~mem1#1 < 0 && 0 != sep_#t~mem1#1 % 2 then sep_#t~mem1#1 % 2 - 2 else sep_#t~mem1#1 % 2));havoc sep_#t~mem1#1;sep_#t~post3#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post3#1 - 1;" "sep_#t~post4#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post4#1;havoc sep_#t~post4#1;" "assume sep_~i~0#1 < ~N~0;call sep_#t~mem1#1 := read~int#2(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4);" "assume 0 == (if sep_#t~mem1#1 < 0 && 0 != sep_#t~mem1#1 % 2 then sep_#t~mem1#1 % 2 - 2 else sep_#t~mem1#1 % 2);havoc sep_#t~mem1#1;sep_#t~post2#1 := sep_~ret~0#1;sep_~ret~0#1 := 1 + sep_#t~post2#1;" "sep_#t~post4#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post4#1;havoc sep_#t~post4#1;" "assume !(sep_~i~0#1 < ~N~0);havoc sep_~i~0#1;sep_#res#1 := (if sep_~ret~0#1 % 4294967296 <= 2147483647 then sep_~ret~0#1 % 4294967296 else sep_~ret~0#1 % 4294967296 - 4294967296);" "main_#t~ret6#1 := sep_#res#1;havoc sep_#t~mem1#1, sep_#t~post2#1, sep_#t~post3#1, sep_#t~post4#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;havoc sep_#in~x#1.base, sep_#in~x#1.offset;assume { :end_inline_sep } true;main_~ret~1#1 := main_#t~ret6#1;havoc main_#t~ret6#1;call main_#t~mem7#1 := read~int#2(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#2(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#2(main_#t~mem8#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem8#1;call write~int#2(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem1#1, sep_#t~post2#1, sep_#t~post3#1, sep_#t~post4#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0;" [2025-03-04 15:44:08,868 INFO L754 eck$LassoCheckResult]: Loop: "assume sep_~i~0#1 < ~N~0;call sep_#t~mem1#1 := read~int#2(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4);" "assume 0 == (if sep_#t~mem1#1 < 0 && 0 != sep_#t~mem1#1 % 2 then sep_#t~mem1#1 % 2 - 2 else sep_#t~mem1#1 % 2);havoc sep_#t~mem1#1;sep_#t~post2#1 := sep_~ret~0#1;sep_~ret~0#1 := 1 + sep_#t~post2#1;" "sep_#t~post4#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post4#1;havoc sep_#t~post4#1;" [2025-03-04 15:44:08,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:08,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1443791327, now seen corresponding path program 1 times [2025-03-04 15:44:08,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:08,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559683129] [2025-03-04 15:44:08,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:44:08,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:08,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:44:08,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:44:08,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:08,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:08,890 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:08,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:44:08,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:44:08,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:08,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:08,903 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:08,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:08,903 INFO L85 PathProgramCache]: Analyzing trace with hash 53558, now seen corresponding path program 4 times [2025-03-04 15:44:08,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:08,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869289508] [2025-03-04 15:44:08,903 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:44:08,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:08,908 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-03-04 15:44:08,910 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:44:08,910 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:44:08,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:08,910 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:08,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:44:08,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:44:08,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:08,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:08,914 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:08,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:08,914 INFO L85 PathProgramCache]: Analyzing trace with hash -2110023016, now seen corresponding path program 1 times [2025-03-04 15:44:08,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:08,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71556471] [2025-03-04 15:44:08,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:44:08,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:08,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:44:08,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:44:08,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:08,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:08,929 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:08,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:44:08,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:44:08,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:08,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:08,956 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:09,464 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:44:09,464 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:44:09,465 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:44:09,465 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:44:09,465 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:44:09,465 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:09,465 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:44:09,465 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:44:09,465 INFO L132 ssoRankerPreferences]: Filename of dumped script: sep.i_Iteration5_Lasso [2025-03-04 15:44:09,465 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:44:09,465 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:44:09,466 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:09,469 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:09,514 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:09,516 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:09,518 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:09,520 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:09,521 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:09,523 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:09,524 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:09,526 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:09,528 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:09,529 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:09,532 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:09,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:09,685 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:09,686 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:09,687 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:09,688 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:09,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:09,690 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:09,693 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:09,694 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:09,695 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:09,696 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:09,697 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:09,963 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:44:09,963 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:44:09,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:09,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:09,984 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:09,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-03-04 15:44:09,985 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:09,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:09,995 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:09,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:09,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:09,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:09,996 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:09,996 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:09,997 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:10,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:10,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:10,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:10,004 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:10,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-03-04 15:44:10,006 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:10,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:10,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:10,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:10,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:10,016 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:10,016 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:10,019 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:10,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-03-04 15:44:10,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:10,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:10,026 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:10,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-03-04 15:44:10,028 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:10,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:10,038 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:10,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:10,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:10,039 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:10,039 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:10,041 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:10,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-03-04 15:44:10,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:10,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:10,048 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:10,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-03-04 15:44:10,065 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:10,075 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:10,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:10,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:10,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:10,076 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:10,076 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:10,078 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:10,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-03-04 15:44:10,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:10,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:10,085 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:10,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-03-04 15:44:10,090 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:10,099 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:10,099 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:10,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:10,100 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:10,100 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:10,100 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:10,102 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:10,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-03-04 15:44:10,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:10,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:10,109 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:10,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-03-04 15:44:10,110 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:10,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:10,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:10,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:10,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:10,120 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:10,120 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:10,122 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:10,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-03-04 15:44:10,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:10,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:10,129 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:10,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-03-04 15:44:10,131 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:10,140 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:10,140 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:10,140 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:10,140 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:10,141 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:10,141 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:10,143 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:10,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:10,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:10,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:10,151 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:10,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-03-04 15:44:10,153 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:10,163 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:10,163 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:10,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:10,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:10,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:10,163 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:10,163 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:10,164 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:10,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-03-04 15:44:10,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:10,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:10,171 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:10,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-03-04 15:44:10,172 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:10,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:10,181 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:10,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:10,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:10,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:10,182 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:10,182 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:10,183 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:10,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:10,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:10,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:10,190 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:10,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-03-04 15:44:10,192 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:10,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:10,201 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:10,201 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:10,201 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:10,201 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:10,202 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:10,202 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:10,203 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:10,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:10,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:10,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:10,210 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:10,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-03-04 15:44:10,213 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:10,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:10,222 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:10,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:10,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:10,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:10,222 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:10,222 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:10,223 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:10,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:10,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:10,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:10,230 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:10,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-03-04 15:44:10,232 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:10,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:10,241 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:10,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:10,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:10,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:10,241 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:10,241 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:10,242 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:10,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:10,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:10,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:10,249 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:10,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-03-04 15:44:10,251 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:10,260 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:10,260 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:10,260 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:10,260 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:10,260 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:10,260 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:10,260 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:10,261 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:10,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-03-04 15:44:10,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:10,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:10,268 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:10,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-03-04 15:44:10,270 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:10,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:10,279 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:10,279 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:10,279 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:10,280 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:10,280 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:10,282 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:10,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-03-04 15:44:10,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:10,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:10,290 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:10,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-03-04 15:44:10,292 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:10,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:10,301 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:10,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:10,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:10,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:10,302 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:10,302 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:10,306 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:10,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-03-04 15:44:10,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:10,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:10,314 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:10,316 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:10,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-03-04 15:44:10,325 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:10,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:10,326 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:10,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:10,327 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:10,327 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:10,329 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:10,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:10,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:10,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:10,337 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:10,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-03-04 15:44:10,340 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:10,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:10,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:10,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:10,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:10,350 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:10,350 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:10,352 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:10,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:10,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:10,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:10,361 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:10,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-03-04 15:44:10,363 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:10,372 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:10,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:10,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:10,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:10,373 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:10,373 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:10,375 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:10,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2025-03-04 15:44:10,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:10,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:10,382 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:10,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-03-04 15:44:10,384 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:10,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:10,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:10,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:10,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:10,395 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:10,395 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:10,398 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:10,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-03-04 15:44:10,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:10,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:10,405 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:10,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-03-04 15:44:10,407 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:10,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:10,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:10,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:10,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:10,419 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:10,419 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:10,426 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:44:10,443 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2025-03-04 15:44:10,443 INFO L444 ModelExtractionUtils]: 3 out of 19 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-03-04 15:44:10,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:10,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:10,445 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:10,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-03-04 15:44:10,446 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:44:10,456 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-03-04 15:44:10,457 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:44:10,457 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sep_~i~0#1) = -4*ULTIMATE.start_sep_~i~0#1 + 5 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_2 + 1*ULTIMATE.start_sep_~x#1.offset + 8 >= 0] [2025-03-04 15:44:10,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:10,476 INFO L156 tatePredicateManager]: 7 out of 9 supporting invariants were superfluous and have been removed [2025-03-04 15:44:10,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:10,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:44:10,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:44:10,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:10,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:10,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 15:44:10,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:10,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 15:44:10,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:44:10,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:44:10,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:10,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:10,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 15:44:10,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:10,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:44:10,663 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2025-03-04 15:44:10,663 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 37 transitions. cyclomatic complexity: 16 Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:44:10,740 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 37 transitions. cyclomatic complexity: 16. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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 48 states and 72 transitions. Complement of second has 10 states. [2025-03-04 15:44:10,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 5 stem states 1 non-accepting loop states 2 accepting loop states [2025-03-04 15:44:10,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:44:10,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 27 transitions. [2025-03-04 15:44:10,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 27 transitions. Stem has 11 letters. Loop has 3 letters. [2025-03-04 15:44:10,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:10,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 27 transitions. Stem has 14 letters. Loop has 3 letters. [2025-03-04 15:44:10,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:10,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 27 transitions. Stem has 11 letters. Loop has 6 letters. [2025-03-04 15:44:10,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:10,742 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 72 transitions. [2025-03-04 15:44:10,743 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2025-03-04 15:44:10,743 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 45 states and 66 transitions. [2025-03-04 15:44:10,743 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2025-03-04 15:44:10,744 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2025-03-04 15:44:10,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 66 transitions. [2025-03-04 15:44:10,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:44:10,744 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 66 transitions. [2025-03-04 15:44:10,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 66 transitions. [2025-03-04 15:44:10,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2025-03-04 15:44:10,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 37 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:44:10,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 55 transitions. [2025-03-04 15:44:10,745 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 55 transitions. [2025-03-04 15:44:10,745 INFO L432 stractBuchiCegarLoop]: Abstraction has 38 states and 55 transitions. [2025-03-04 15:44:10,745 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-04 15:44:10,745 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 55 transitions. [2025-03-04 15:44:10,746 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2025-03-04 15:44:10,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:44:10,746 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:44:10,746 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:44:10,746 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 15:44:10,746 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int#1(115, 2, 0, 1);call write~init~int#1(101, 2, 1, 1);call write~init~int#1(112, 2, 2, 1);call write~init~int#1(46, 2, 3, 1);call write~init~int#1(99, 2, 4, 1);call write~init~int#1(0, 2, 5, 1);~N~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post12#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;havoc main_#t~nondet5#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0 % 4294967296);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem1#1, sep_#t~post2#1, sep_#t~post3#1, sep_#t~post4#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0;" "assume sep_~i~0#1 < ~N~0;call sep_#t~mem1#1 := read~int#2(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4);" "assume !(0 == (if sep_#t~mem1#1 < 0 && 0 != sep_#t~mem1#1 % 2 then sep_#t~mem1#1 % 2 - 2 else sep_#t~mem1#1 % 2));havoc sep_#t~mem1#1;sep_#t~post3#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post3#1 - 1;" "sep_#t~post4#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post4#1;havoc sep_#t~post4#1;" "assume sep_~i~0#1 < ~N~0;call sep_#t~mem1#1 := read~int#2(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4);" "assume 0 == (if sep_#t~mem1#1 < 0 && 0 != sep_#t~mem1#1 % 2 then sep_#t~mem1#1 % 2 - 2 else sep_#t~mem1#1 % 2);havoc sep_#t~mem1#1;sep_#t~post2#1 := sep_~ret~0#1;sep_~ret~0#1 := 1 + sep_#t~post2#1;" "sep_#t~post4#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post4#1;havoc sep_#t~post4#1;" "assume !(sep_~i~0#1 < ~N~0);havoc sep_~i~0#1;sep_#res#1 := (if sep_~ret~0#1 % 4294967296 <= 2147483647 then sep_~ret~0#1 % 4294967296 else sep_~ret~0#1 % 4294967296 - 4294967296);" "main_#t~ret6#1 := sep_#res#1;havoc sep_#t~mem1#1, sep_#t~post2#1, sep_#t~post3#1, sep_#t~post4#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;havoc sep_#in~x#1.base, sep_#in~x#1.offset;assume { :end_inline_sep } true;main_~ret~1#1 := main_#t~ret6#1;havoc main_#t~ret6#1;call main_#t~mem7#1 := read~int#2(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#2(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#2(main_#t~mem8#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem8#1;call write~int#2(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem1#1, sep_#t~post2#1, sep_#t~post3#1, sep_#t~post4#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0;" "assume !(sep_~i~0#1 < ~N~0);havoc sep_~i~0#1;sep_#res#1 := (if sep_~ret~0#1 % 4294967296 <= 2147483647 then sep_~ret~0#1 % 4294967296 else sep_~ret~0#1 % 4294967296 - 4294967296);" "main_#t~ret9#1 := sep_#res#1;havoc sep_#t~mem1#1, sep_#t~post2#1, sep_#t~post3#1, sep_#t~post4#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;havoc sep_#in~x#1.base, sep_#in~x#1.offset;assume { :end_inline_sep } true;main_~ret2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;call main_#t~mem10#1 := read~int#2(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem10#1;havoc main_#t~mem10#1;main_~i~1#1 := 0;" [2025-03-04 15:44:10,746 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~1#1 < ~N~0 - 1;call main_#t~mem11#1 := read~int#2(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~1#1), 4);call write~int#2(main_#t~mem11#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~mem11#1;main_#t~post12#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1;" [2025-03-04 15:44:10,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:10,747 INFO L85 PathProgramCache]: Analyzing trace with hash 209029277, now seen corresponding path program 1 times [2025-03-04 15:44:10,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:10,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424628543] [2025-03-04 15:44:10,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:44:10,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:10,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:44:10,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:44:10,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:10,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:10,798 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 15:44:10,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:44:10,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424628543] [2025-03-04 15:44:10,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424628543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:44:10,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:44:10,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:44:10,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333849561] [2025-03-04 15:44:10,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:44:10,798 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:44:10,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:10,799 INFO L85 PathProgramCache]: Analyzing trace with hash 48, now seen corresponding path program 1 times [2025-03-04 15:44:10,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:10,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206077081] [2025-03-04 15:44:10,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:44:10,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:10,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:44:10,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:44:10,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:10,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:10,803 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:10,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:44:10,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:44:10,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:10,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:10,805 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:10,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:44:10,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:44:10,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:44:10,846 INFO L87 Difference]: Start difference. First operand 38 states and 55 transitions. cyclomatic complexity: 23 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:44:10,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:44:10,868 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2025-03-04 15:44:10,868 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 63 transitions. [2025-03-04 15:44:10,869 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2025-03-04 15:44:10,869 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 63 transitions. [2025-03-04 15:44:10,870 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2025-03-04 15:44:10,870 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2025-03-04 15:44:10,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 63 transitions. [2025-03-04 15:44:10,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:44:10,870 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 63 transitions. [2025-03-04 15:44:10,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 63 transitions. [2025-03-04 15:44:10,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2025-03-04 15:44:10,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.358974358974359) internal successors, (53), 38 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:44:10,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2025-03-04 15:44:10,872 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 53 transitions. [2025-03-04 15:44:10,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:44:10,874 INFO L432 stractBuchiCegarLoop]: Abstraction has 39 states and 53 transitions. [2025-03-04 15:44:10,876 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-04 15:44:10,876 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 53 transitions. [2025-03-04 15:44:10,876 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2025-03-04 15:44:10,876 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:44:10,876 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:44:10,876 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:44:10,877 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:44:10,877 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int#1(115, 2, 0, 1);call write~init~int#1(101, 2, 1, 1);call write~init~int#1(112, 2, 2, 1);call write~init~int#1(46, 2, 3, 1);call write~init~int#1(99, 2, 4, 1);call write~init~int#1(0, 2, 5, 1);~N~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post12#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;havoc main_#t~nondet5#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0 % 4294967296);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem1#1, sep_#t~post2#1, sep_#t~post3#1, sep_#t~post4#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0;" "assume sep_~i~0#1 < ~N~0;call sep_#t~mem1#1 := read~int#2(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4);" "assume !(0 == (if sep_#t~mem1#1 < 0 && 0 != sep_#t~mem1#1 % 2 then sep_#t~mem1#1 % 2 - 2 else sep_#t~mem1#1 % 2));havoc sep_#t~mem1#1;sep_#t~post3#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post3#1 - 1;" "sep_#t~post4#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post4#1;havoc sep_#t~post4#1;" "assume sep_~i~0#1 < ~N~0;call sep_#t~mem1#1 := read~int#2(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4);" "assume 0 == (if sep_#t~mem1#1 < 0 && 0 != sep_#t~mem1#1 % 2 then sep_#t~mem1#1 % 2 - 2 else sep_#t~mem1#1 % 2);havoc sep_#t~mem1#1;sep_#t~post2#1 := sep_~ret~0#1;sep_~ret~0#1 := 1 + sep_#t~post2#1;" "sep_#t~post4#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post4#1;havoc sep_#t~post4#1;" "assume sep_~i~0#1 < ~N~0;call sep_#t~mem1#1 := read~int#2(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4);" "assume !(0 == (if sep_#t~mem1#1 < 0 && 0 != sep_#t~mem1#1 % 2 then sep_#t~mem1#1 % 2 - 2 else sep_#t~mem1#1 % 2));havoc sep_#t~mem1#1;sep_#t~post3#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post3#1 - 1;" "sep_#t~post4#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post4#1;havoc sep_#t~post4#1;" "assume !(sep_~i~0#1 < ~N~0);havoc sep_~i~0#1;sep_#res#1 := (if sep_~ret~0#1 % 4294967296 <= 2147483647 then sep_~ret~0#1 % 4294967296 else sep_~ret~0#1 % 4294967296 - 4294967296);" "main_#t~ret6#1 := sep_#res#1;havoc sep_#t~mem1#1, sep_#t~post2#1, sep_#t~post3#1, sep_#t~post4#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;havoc sep_#in~x#1.base, sep_#in~x#1.offset;assume { :end_inline_sep } true;main_~ret~1#1 := main_#t~ret6#1;havoc main_#t~ret6#1;call main_#t~mem7#1 := read~int#2(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#2(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#2(main_#t~mem8#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem8#1;call write~int#2(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem1#1, sep_#t~post2#1, sep_#t~post3#1, sep_#t~post4#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0;" "assume sep_~i~0#1 < ~N~0;call sep_#t~mem1#1 := read~int#2(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4);" [2025-03-04 15:44:10,877 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 == (if sep_#t~mem1#1 < 0 && 0 != sep_#t~mem1#1 % 2 then sep_#t~mem1#1 % 2 - 2 else sep_#t~mem1#1 % 2);havoc sep_#t~mem1#1;sep_#t~post2#1 := sep_~ret~0#1;sep_~ret~0#1 := 1 + sep_#t~post2#1;" "sep_#t~post4#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post4#1;havoc sep_#t~post4#1;" "assume sep_~i~0#1 < ~N~0;call sep_#t~mem1#1 := read~int#2(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4);" [2025-03-04 15:44:10,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:10,877 INFO L85 PathProgramCache]: Analyzing trace with hash -866945730, now seen corresponding path program 1 times [2025-03-04 15:44:10,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:10,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113917179] [2025-03-04 15:44:10,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:44:10,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:10,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:44:10,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:44:10,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:10,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:10,898 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:10,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:44:10,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:44:10,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:10,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:10,913 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:10,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:10,914 INFO L85 PathProgramCache]: Analyzing trace with hash 51608, now seen corresponding path program 5 times [2025-03-04 15:44:10,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:10,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273076143] [2025-03-04 15:44:10,914 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:44:10,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:10,916 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:44:10,918 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:44:10,918 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:44:10,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:10,918 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:10,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:44:10,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:44:10,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:10,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:10,920 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:10,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:10,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1541869765, now seen corresponding path program 2 times [2025-03-04 15:44:10,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:10,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240766526] [2025-03-04 15:44:10,921 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:44:10,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:10,927 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 15:44:10,943 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:44:10,944 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:44:10,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:10,944 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:10,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:44:10,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:44:10,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:10,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:10,962 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:11,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-03-04 15:44:11,621 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:44:11,621 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:44:11,621 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:44:11,622 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:44:11,622 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:44:11,622 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:11,622 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:44:11,622 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:44:11,622 INFO L132 ssoRankerPreferences]: Filename of dumped script: sep.i_Iteration7_Lasso [2025-03-04 15:44:11,622 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:44:11,622 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:44:11,623 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:11,625 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:11,627 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:11,629 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:11,631 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:11,633 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:11,634 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:11,635 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:11,637 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:11,638 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:11,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:11,642 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:11,649 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:11,650 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:11,653 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:11,656 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:11,657 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:11,658 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:11,660 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:11,661 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:11,694 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:11,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:11,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:11,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:12,164 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:44:12,164 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:44:12,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:12,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:12,166 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:12,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-03-04 15:44:12,168 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:12,177 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:12,177 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:12,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:12,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:12,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:12,178 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:12,178 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:12,179 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:12,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2025-03-04 15:44:12,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:12,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:12,185 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:12,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-03-04 15:44:12,187 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:12,196 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:12,196 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:12,196 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:12,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:12,196 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:12,197 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:12,197 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:12,197 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:12,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-03-04 15:44:12,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:12,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:12,204 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:12,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-03-04 15:44:12,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-03-04 15:44:12,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:12,215 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:12,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:12,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:12,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:12,216 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:12,216 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:12,217 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:12,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2025-03-04 15:44:12,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:12,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:12,223 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:12,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-03-04 15:44:12,225 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:12,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:12,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:12,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:12,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:12,235 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:12,235 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:12,237 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:12,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:12,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:12,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:12,244 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:12,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-03-04 15:44:12,245 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:12,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:12,254 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:12,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:12,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:12,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:12,255 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:12,255 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:12,256 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:12,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2025-03-04 15:44:12,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:12,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:12,263 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:12,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-03-04 15:44:12,266 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:12,276 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:12,276 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:12,276 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:12,276 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:12,276 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:12,276 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:12,276 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:12,277 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:12,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-03-04 15:44:12,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:12,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:12,284 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:12,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-03-04 15:44:12,286 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:12,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:12,295 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:12,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:12,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:12,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:12,295 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:12,295 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:12,296 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:12,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2025-03-04 15:44:12,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:12,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:12,302 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:12,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-03-04 15:44:12,304 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:12,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:12,313 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:12,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:12,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:12,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:12,313 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:12,313 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:12,314 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:12,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-03-04 15:44:12,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:12,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:12,321 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:12,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-03-04 15:44:12,322 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:12,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:12,332 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:12,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:12,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:12,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:12,332 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:12,332 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:12,333 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:12,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2025-03-04 15:44:12,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:12,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:12,339 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:12,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-03-04 15:44:12,341 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:12,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:12,350 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:12,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:12,350 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:12,350 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:12,350 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:12,350 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:12,351 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:12,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-03-04 15:44:12,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:12,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:12,358 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:12,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-03-04 15:44:12,361 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:12,370 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:12,370 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:12,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:12,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:12,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:12,370 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:12,370 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:12,371 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:12,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-03-04 15:44:12,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:12,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:12,378 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:12,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-03-04 15:44:12,379 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:12,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:12,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:12,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:12,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:12,390 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:12,390 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:12,392 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:12,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2025-03-04 15:44:12,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:12,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:12,399 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:12,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-03-04 15:44:12,400 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:12,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:12,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:12,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:12,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:12,410 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:12,410 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:12,412 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:12,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2025-03-04 15:44:12,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:12,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:12,418 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:12,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-03-04 15:44:12,420 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:12,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:12,429 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:12,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:12,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:12,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:12,430 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:12,430 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:12,431 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:12,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:12,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:12,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:12,438 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:12,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-03-04 15:44:12,439 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:12,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:12,448 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:12,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:12,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:12,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:12,448 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:12,448 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:12,449 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:12,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2025-03-04 15:44:12,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:12,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:12,456 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:12,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-03-04 15:44:12,458 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:12,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:12,467 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:12,467 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:12,467 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:12,468 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:12,468 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:12,471 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:12,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2025-03-04 15:44:12,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:12,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:12,477 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:12,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-03-04 15:44:12,479 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:12,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:12,488 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:12,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:12,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:12,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:12,488 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:12,488 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:12,489 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:12,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2025-03-04 15:44:12,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:12,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:12,496 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:12,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-03-04 15:44:12,498 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:12,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:12,507 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:12,507 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:12,507 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:12,507 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:12,507 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:12,507 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:12,508 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:12,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2025-03-04 15:44:12,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:12,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:12,515 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:12,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-03-04 15:44:12,516 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:12,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:12,525 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:12,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:12,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:12,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:12,525 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:12,526 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:12,526 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:12,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2025-03-04 15:44:12,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:12,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:12,534 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:12,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-03-04 15:44:12,535 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:12,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:12,544 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:12,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:12,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:12,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:12,544 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:12,544 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:12,545 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:12,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2025-03-04 15:44:12,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:12,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:12,552 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:12,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-03-04 15:44:12,554 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:12,563 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:12,563 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:12,563 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:12,563 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:12,564 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:12,564 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:12,566 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:12,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2025-03-04 15:44:12,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:12,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:12,573 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:12,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-03-04 15:44:12,575 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:12,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:12,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:12,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:12,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:12,586 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:12,586 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:12,588 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:12,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2025-03-04 15:44:12,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:12,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:12,597 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:12,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-03-04 15:44:12,601 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:12,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:12,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:12,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:12,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:12,612 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:12,612 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:12,614 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:12,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:12,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:12,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:12,622 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:12,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2025-03-04 15:44:12,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-03-04 15:44:12,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:12,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:12,635 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:12,635 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:12,635 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:12,636 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:12,638 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:12,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:12,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:12,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:12,646 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:12,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2025-03-04 15:44:12,648 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:12,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:12,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:12,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:12,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:12,660 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:12,660 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:12,662 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:12,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:12,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:12,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:12,670 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:12,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2025-03-04 15:44:12,672 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:12,682 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:12,682 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:12,682 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:12,682 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:12,684 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:12,684 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:12,686 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:12,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2025-03-04 15:44:12,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:12,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:12,693 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:12,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2025-03-04 15:44:12,695 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:12,704 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:12,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:12,705 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:12,705 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:12,705 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:12,705 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:12,708 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:12,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2025-03-04 15:44:12,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:12,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:12,715 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:12,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2025-03-04 15:44:12,717 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:12,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:12,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:12,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:12,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:12,727 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:12,727 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:12,730 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:12,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:12,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:12,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:12,737 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:12,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2025-03-04 15:44:12,738 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:12,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:12,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:12,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:12,747 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:12,749 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:12,749 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:12,752 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:12,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2025-03-04 15:44:12,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:12,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:12,759 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:12,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2025-03-04 15:44:12,761 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:12,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:12,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:12,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:12,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:12,771 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:12,771 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:12,774 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:12,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:12,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:12,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:12,794 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:12,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2025-03-04 15:44:12,797 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:12,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:12,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:12,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:12,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:12,810 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:12,810 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:12,817 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:44:12,834 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-03-04 15:44:12,835 INFO L444 ModelExtractionUtils]: 4 out of 19 variables were initially zero. Simplification set additionally 12 variables to zero. [2025-03-04 15:44:12,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:12,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:12,837 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:12,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2025-03-04 15:44:12,839 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:44:12,848 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:44:12,849 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:44:12,849 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sep_~i~0#1, ~N~0) = -1*ULTIMATE.start_sep_~i~0#1 + 1*~N~0 Supporting invariants [] [2025-03-04 15:44:12,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:12,866 INFO L156 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2025-03-04 15:44:12,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:12,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:44:12,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:44:12,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:12,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:12,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:44:12,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:12,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:44:12,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:44:12,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:12,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:12,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:44:12,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:12,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:44:12,915 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-04 15:44:12,915 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 53 transitions. cyclomatic complexity: 20 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:44:12,926 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 53 transitions. cyclomatic complexity: 20. 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) Result 44 states and 65 transitions. Complement of second has 7 states. [2025-03-04 15:44:12,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-04 15:44:12,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:44:12,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2025-03-04 15:44:12,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 15 letters. Loop has 3 letters. [2025-03-04 15:44:12,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:12,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 18 letters. Loop has 3 letters. [2025-03-04 15:44:12,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:12,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 15 letters. Loop has 6 letters. [2025-03-04 15:44:12,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:12,930 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 65 transitions. [2025-03-04 15:44:12,930 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-04 15:44:12,931 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 65 transitions. [2025-03-04 15:44:12,931 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2025-03-04 15:44:12,931 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2025-03-04 15:44:12,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 65 transitions. [2025-03-04 15:44:12,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:44:12,931 INFO L218 hiAutomatonCegarLoop]: Abstraction has 44 states and 65 transitions. [2025-03-04 15:44:12,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 65 transitions. [2025-03-04 15:44:12,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2025-03-04 15:44:12,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.4615384615384615) internal successors, (57), 38 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:44:12,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 57 transitions. [2025-03-04 15:44:12,932 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 57 transitions. [2025-03-04 15:44:12,932 INFO L432 stractBuchiCegarLoop]: Abstraction has 39 states and 57 transitions. [2025-03-04 15:44:12,932 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-04 15:44:12,933 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 57 transitions. [2025-03-04 15:44:12,933 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-04 15:44:12,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:44:12,933 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:44:12,933 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:44:12,933 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 15:44:12,934 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int#1(115, 2, 0, 1);call write~init~int#1(101, 2, 1, 1);call write~init~int#1(112, 2, 2, 1);call write~init~int#1(46, 2, 3, 1);call write~init~int#1(99, 2, 4, 1);call write~init~int#1(0, 2, 5, 1);~N~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post12#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;havoc main_#t~nondet5#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0 % 4294967296);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem1#1, sep_#t~post2#1, sep_#t~post3#1, sep_#t~post4#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0;" "assume sep_~i~0#1 < ~N~0;call sep_#t~mem1#1 := read~int#2(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4);" "assume !(0 == (if sep_#t~mem1#1 < 0 && 0 != sep_#t~mem1#1 % 2 then sep_#t~mem1#1 % 2 - 2 else sep_#t~mem1#1 % 2));havoc sep_#t~mem1#1;sep_#t~post3#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post3#1 - 1;" "sep_#t~post4#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post4#1;havoc sep_#t~post4#1;" "assume sep_~i~0#1 < ~N~0;call sep_#t~mem1#1 := read~int#2(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4);" "assume 0 == (if sep_#t~mem1#1 < 0 && 0 != sep_#t~mem1#1 % 2 then sep_#t~mem1#1 % 2 - 2 else sep_#t~mem1#1 % 2);havoc sep_#t~mem1#1;sep_#t~post2#1 := sep_~ret~0#1;sep_~ret~0#1 := 1 + sep_#t~post2#1;" "sep_#t~post4#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post4#1;havoc sep_#t~post4#1;" "assume !(sep_~i~0#1 < ~N~0);havoc sep_~i~0#1;sep_#res#1 := (if sep_~ret~0#1 % 4294967296 <= 2147483647 then sep_~ret~0#1 % 4294967296 else sep_~ret~0#1 % 4294967296 - 4294967296);" "main_#t~ret6#1 := sep_#res#1;havoc sep_#t~mem1#1, sep_#t~post2#1, sep_#t~post3#1, sep_#t~post4#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;havoc sep_#in~x#1.base, sep_#in~x#1.offset;assume { :end_inline_sep } true;main_~ret~1#1 := main_#t~ret6#1;havoc main_#t~ret6#1;call main_#t~mem7#1 := read~int#2(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#2(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#2(main_#t~mem8#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem8#1;call write~int#2(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem1#1, sep_#t~post2#1, sep_#t~post3#1, sep_#t~post4#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0;" "assume sep_~i~0#1 < ~N~0;call sep_#t~mem1#1 := read~int#2(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4);" "assume !(0 == (if sep_#t~mem1#1 < 0 && 0 != sep_#t~mem1#1 % 2 then sep_#t~mem1#1 % 2 - 2 else sep_#t~mem1#1 % 2));havoc sep_#t~mem1#1;sep_#t~post3#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post3#1 - 1;" "sep_#t~post4#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post4#1;havoc sep_#t~post4#1;" "assume !(sep_~i~0#1 < ~N~0);havoc sep_~i~0#1;sep_#res#1 := (if sep_~ret~0#1 % 4294967296 <= 2147483647 then sep_~ret~0#1 % 4294967296 else sep_~ret~0#1 % 4294967296 - 4294967296);" "main_#t~ret9#1 := sep_#res#1;havoc sep_#t~mem1#1, sep_#t~post2#1, sep_#t~post3#1, sep_#t~post4#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;havoc sep_#in~x#1.base, sep_#in~x#1.offset;assume { :end_inline_sep } true;main_~ret2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;call main_#t~mem10#1 := read~int#2(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem10#1;havoc main_#t~mem10#1;main_~i~1#1 := 0;" [2025-03-04 15:44:12,934 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~1#1 < ~N~0 - 1;call main_#t~mem11#1 := read~int#2(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~1#1), 4);call write~int#2(main_#t~mem11#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~mem11#1;main_#t~post12#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1;" [2025-03-04 15:44:12,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:12,934 INFO L85 PathProgramCache]: Analyzing trace with hash -507524235, now seen corresponding path program 1 times [2025-03-04 15:44:12,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:12,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589480162] [2025-03-04 15:44:12,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:44:12,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:12,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:44:12,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:44:12,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:12,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:12,993 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 15:44:12,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:44:12,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589480162] [2025-03-04 15:44:12,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589480162] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:44:12,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144415384] [2025-03-04 15:44:12,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:44:12,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:44:12,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:12,996 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:44:12,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2025-03-04 15:44:13,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:44:13,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:44:13,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:13,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:13,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:44:13,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:13,072 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 15:44:13,072 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:44:13,094 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 15:44:13,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2144415384] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:44:13,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:44:13,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-04 15:44:13,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673372966] [2025-03-04 15:44:13,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:44:13,094 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:44:13,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:13,095 INFO L85 PathProgramCache]: Analyzing trace with hash 48, now seen corresponding path program 2 times [2025-03-04 15:44:13,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:13,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57299522] [2025-03-04 15:44:13,095 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:44:13,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:13,096 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:44:13,097 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:44:13,097 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:44:13,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:13,097 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:13,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:44:13,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:44:13,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:13,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:13,099 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:13,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:44:13,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 15:44:13,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:44:13,135 INFO L87 Difference]: Start difference. First operand 39 states and 57 transitions. cyclomatic complexity: 23 Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:44:13,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:44:13,177 INFO L93 Difference]: Finished difference Result 53 states and 78 transitions. [2025-03-04 15:44:13,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 78 transitions. [2025-03-04 15:44:13,177 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-04 15:44:13,177 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 51 states and 71 transitions. [2025-03-04 15:44:13,178 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2025-03-04 15:44:13,178 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2025-03-04 15:44:13,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 71 transitions. [2025-03-04 15:44:13,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:44:13,178 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 71 transitions. [2025-03-04 15:44:13,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 71 transitions. [2025-03-04 15:44:13,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. [2025-03-04 15:44:13,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.375) internal successors, (55), 39 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:44:13,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 55 transitions. [2025-03-04 15:44:13,179 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 55 transitions. [2025-03-04 15:44:13,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:44:13,180 INFO L432 stractBuchiCegarLoop]: Abstraction has 40 states and 55 transitions. [2025-03-04 15:44:13,180 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-04 15:44:13,181 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 55 transitions. [2025-03-04 15:44:13,181 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-04 15:44:13,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:44:13,181 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:44:13,181 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:44:13,181 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 15:44:13,181 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int#1(115, 2, 0, 1);call write~init~int#1(101, 2, 1, 1);call write~init~int#1(112, 2, 2, 1);call write~init~int#1(46, 2, 3, 1);call write~init~int#1(99, 2, 4, 1);call write~init~int#1(0, 2, 5, 1);~N~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post12#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;havoc main_#t~nondet5#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0 % 4294967296);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem1#1, sep_#t~post2#1, sep_#t~post3#1, sep_#t~post4#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0;" "assume sep_~i~0#1 < ~N~0;call sep_#t~mem1#1 := read~int#2(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4);" "assume !(0 == (if sep_#t~mem1#1 < 0 && 0 != sep_#t~mem1#1 % 2 then sep_#t~mem1#1 % 2 - 2 else sep_#t~mem1#1 % 2));havoc sep_#t~mem1#1;sep_#t~post3#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post3#1 - 1;" "sep_#t~post4#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post4#1;havoc sep_#t~post4#1;" "assume sep_~i~0#1 < ~N~0;call sep_#t~mem1#1 := read~int#2(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4);" "assume 0 == (if sep_#t~mem1#1 < 0 && 0 != sep_#t~mem1#1 % 2 then sep_#t~mem1#1 % 2 - 2 else sep_#t~mem1#1 % 2);havoc sep_#t~mem1#1;sep_#t~post2#1 := sep_~ret~0#1;sep_~ret~0#1 := 1 + sep_#t~post2#1;" "sep_#t~post4#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post4#1;havoc sep_#t~post4#1;" "assume !(sep_~i~0#1 < ~N~0);havoc sep_~i~0#1;sep_#res#1 := (if sep_~ret~0#1 % 4294967296 <= 2147483647 then sep_~ret~0#1 % 4294967296 else sep_~ret~0#1 % 4294967296 - 4294967296);" "main_#t~ret6#1 := sep_#res#1;havoc sep_#t~mem1#1, sep_#t~post2#1, sep_#t~post3#1, sep_#t~post4#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;havoc sep_#in~x#1.base, sep_#in~x#1.offset;assume { :end_inline_sep } true;main_~ret~1#1 := main_#t~ret6#1;havoc main_#t~ret6#1;call main_#t~mem7#1 := read~int#2(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#2(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#2(main_#t~mem8#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem8#1;call write~int#2(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem1#1, sep_#t~post2#1, sep_#t~post3#1, sep_#t~post4#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0;" "assume sep_~i~0#1 < ~N~0;call sep_#t~mem1#1 := read~int#2(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4);" "assume !(0 == (if sep_#t~mem1#1 < 0 && 0 != sep_#t~mem1#1 % 2 then sep_#t~mem1#1 % 2 - 2 else sep_#t~mem1#1 % 2));havoc sep_#t~mem1#1;sep_#t~post3#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post3#1 - 1;" "sep_#t~post4#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post4#1;havoc sep_#t~post4#1;" "assume sep_~i~0#1 < ~N~0;call sep_#t~mem1#1 := read~int#2(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4);" "assume !(0 == (if sep_#t~mem1#1 < 0 && 0 != sep_#t~mem1#1 % 2 then sep_#t~mem1#1 % 2 - 2 else sep_#t~mem1#1 % 2));havoc sep_#t~mem1#1;sep_#t~post3#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post3#1 - 1;" "sep_#t~post4#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post4#1;havoc sep_#t~post4#1;" "assume !(sep_~i~0#1 < ~N~0);havoc sep_~i~0#1;sep_#res#1 := (if sep_~ret~0#1 % 4294967296 <= 2147483647 then sep_~ret~0#1 % 4294967296 else sep_~ret~0#1 % 4294967296 - 4294967296);" "main_#t~ret9#1 := sep_#res#1;havoc sep_#t~mem1#1, sep_#t~post2#1, sep_#t~post3#1, sep_#t~post4#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;havoc sep_#in~x#1.base, sep_#in~x#1.offset;assume { :end_inline_sep } true;main_~ret2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;call main_#t~mem10#1 := read~int#2(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem10#1;havoc main_#t~mem10#1;main_~i~1#1 := 0;" [2025-03-04 15:44:13,181 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~1#1 < ~N~0 - 1;call main_#t~mem11#1 := read~int#2(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~1#1), 4);call write~int#2(main_#t~mem11#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~mem11#1;main_#t~post12#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1;" [2025-03-04 15:44:13,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:13,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1365739107, now seen corresponding path program 2 times [2025-03-04 15:44:13,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:13,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098782684] [2025-03-04 15:44:13,182 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:44:13,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:13,186 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 15:44:13,208 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 15:44:13,208 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:44:13,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:13,539 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:44:13,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:44:13,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098782684] [2025-03-04 15:44:13,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098782684] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:44:13,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572146783] [2025-03-04 15:44:13,540 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:44:13,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:44:13,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:13,543 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:44:13,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2025-03-04 15:44:13,579 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 15:44:13,595 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 15:44:13,595 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:44:13,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:13,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 15:44:13,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:13,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2025-03-04 15:44:13,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 13 [2025-03-04 15:44:13,700 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:44:13,700 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:44:13,767 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2025-03-04 15:44:13,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2025-03-04 15:44:13,802 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:44:13,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572146783] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:44:13,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:44:13,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2025-03-04 15:44:13,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845790499] [2025-03-04 15:44:13,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:44:13,802 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:44:13,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:13,802 INFO L85 PathProgramCache]: Analyzing trace with hash 48, now seen corresponding path program 3 times [2025-03-04 15:44:13,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:13,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456567626] [2025-03-04 15:44:13,803 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:44:13,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:13,806 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:44:13,807 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:44:13,807 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:44:13,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:13,807 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:13,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:44:13,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:44:13,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:13,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:13,808 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:13,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:44:13,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 15:44:13,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-03-04 15:44:13,844 INFO L87 Difference]: Start difference. First operand 40 states and 55 transitions. cyclomatic complexity: 20 Second operand has 16 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:44:14,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:44:14,043 INFO L93 Difference]: Finished difference Result 68 states and 95 transitions. [2025-03-04 15:44:14,043 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 95 transitions. [2025-03-04 15:44:14,043 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-04 15:44:14,044 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 68 states and 95 transitions. [2025-03-04 15:44:14,044 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2025-03-04 15:44:14,044 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2025-03-04 15:44:14,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 95 transitions. [2025-03-04 15:44:14,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:44:14,044 INFO L218 hiAutomatonCegarLoop]: Abstraction has 68 states and 95 transitions. [2025-03-04 15:44:14,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 95 transitions. [2025-03-04 15:44:14,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 40. [2025-03-04 15:44:14,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.325) internal successors, (53), 39 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:44:14,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 53 transitions. [2025-03-04 15:44:14,046 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 53 transitions. [2025-03-04 15:44:14,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 15:44:14,047 INFO L432 stractBuchiCegarLoop]: Abstraction has 40 states and 53 transitions. [2025-03-04 15:44:14,047 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-04 15:44:14,047 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 53 transitions. [2025-03-04 15:44:14,047 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-04 15:44:14,048 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:44:14,048 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:44:14,048 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:44:14,048 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 15:44:14,048 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int#1(115, 2, 0, 1);call write~init~int#1(101, 2, 1, 1);call write~init~int#1(112, 2, 2, 1);call write~init~int#1(46, 2, 3, 1);call write~init~int#1(99, 2, 4, 1);call write~init~int#1(0, 2, 5, 1);~N~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post12#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;havoc main_#t~nondet5#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0 % 4294967296);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem1#1, sep_#t~post2#1, sep_#t~post3#1, sep_#t~post4#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0;" "assume sep_~i~0#1 < ~N~0;call sep_#t~mem1#1 := read~int#2(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4);" "assume !(0 == (if sep_#t~mem1#1 < 0 && 0 != sep_#t~mem1#1 % 2 then sep_#t~mem1#1 % 2 - 2 else sep_#t~mem1#1 % 2));havoc sep_#t~mem1#1;sep_#t~post3#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post3#1 - 1;" "sep_#t~post4#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post4#1;havoc sep_#t~post4#1;" "assume sep_~i~0#1 < ~N~0;call sep_#t~mem1#1 := read~int#2(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4);" "assume 0 == (if sep_#t~mem1#1 < 0 && 0 != sep_#t~mem1#1 % 2 then sep_#t~mem1#1 % 2 - 2 else sep_#t~mem1#1 % 2);havoc sep_#t~mem1#1;sep_#t~post2#1 := sep_~ret~0#1;sep_~ret~0#1 := 1 + sep_#t~post2#1;" "sep_#t~post4#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post4#1;havoc sep_#t~post4#1;" "assume !(sep_~i~0#1 < ~N~0);havoc sep_~i~0#1;sep_#res#1 := (if sep_~ret~0#1 % 4294967296 <= 2147483647 then sep_~ret~0#1 % 4294967296 else sep_~ret~0#1 % 4294967296 - 4294967296);" "main_#t~ret6#1 := sep_#res#1;havoc sep_#t~mem1#1, sep_#t~post2#1, sep_#t~post3#1, sep_#t~post4#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;havoc sep_#in~x#1.base, sep_#in~x#1.offset;assume { :end_inline_sep } true;main_~ret~1#1 := main_#t~ret6#1;havoc main_#t~ret6#1;call main_#t~mem7#1 := read~int#2(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#2(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#2(main_#t~mem8#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem8#1;call write~int#2(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem1#1, sep_#t~post2#1, sep_#t~post3#1, sep_#t~post4#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0;" "assume sep_~i~0#1 < ~N~0;call sep_#t~mem1#1 := read~int#2(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4);" "assume 0 == (if sep_#t~mem1#1 < 0 && 0 != sep_#t~mem1#1 % 2 then sep_#t~mem1#1 % 2 - 2 else sep_#t~mem1#1 % 2);havoc sep_#t~mem1#1;sep_#t~post2#1 := sep_~ret~0#1;sep_~ret~0#1 := 1 + sep_#t~post2#1;" "sep_#t~post4#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post4#1;havoc sep_#t~post4#1;" "assume sep_~i~0#1 < ~N~0;call sep_#t~mem1#1 := read~int#2(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4);" "assume !(0 == (if sep_#t~mem1#1 < 0 && 0 != sep_#t~mem1#1 % 2 then sep_#t~mem1#1 % 2 - 2 else sep_#t~mem1#1 % 2));havoc sep_#t~mem1#1;sep_#t~post3#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post3#1 - 1;" "sep_#t~post4#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post4#1;havoc sep_#t~post4#1;" "assume !(sep_~i~0#1 < ~N~0);havoc sep_~i~0#1;sep_#res#1 := (if sep_~ret~0#1 % 4294967296 <= 2147483647 then sep_~ret~0#1 % 4294967296 else sep_~ret~0#1 % 4294967296 - 4294967296);" "main_#t~ret9#1 := sep_#res#1;havoc sep_#t~mem1#1, sep_#t~post2#1, sep_#t~post3#1, sep_#t~post4#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;havoc sep_#in~x#1.base, sep_#in~x#1.offset;assume { :end_inline_sep } true;main_~ret2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;call main_#t~mem10#1 := read~int#2(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem10#1;havoc main_#t~mem10#1;main_~i~1#1 := 0;" [2025-03-04 15:44:14,048 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~1#1 < ~N~0 - 1;call main_#t~mem11#1 := read~int#2(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~1#1), 4);call write~int#2(main_#t~mem11#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~mem11#1;main_#t~post12#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1;" [2025-03-04 15:44:14,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:14,048 INFO L85 PathProgramCache]: Analyzing trace with hash 2041724508, now seen corresponding path program 1 times [2025-03-04 15:44:14,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:14,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787443690] [2025-03-04 15:44:14,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:44:14,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:14,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 15:44:14,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 15:44:14,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:14,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:14,070 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:14,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 15:44:14,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 15:44:14,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:14,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:14,088 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:14,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:14,088 INFO L85 PathProgramCache]: Analyzing trace with hash 48, now seen corresponding path program 4 times [2025-03-04 15:44:14,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:14,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247403961] [2025-03-04 15:44:14,089 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:44:14,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:14,094 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1 statements into 2 equivalence classes. [2025-03-04 15:44:14,095 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:44:14,095 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:44:14,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:14,095 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:14,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:44:14,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:44:14,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:14,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:14,096 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:14,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:14,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1131049675, now seen corresponding path program 1 times [2025-03-04 15:44:14,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:14,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061863222] [2025-03-04 15:44:14,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:44:14,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:14,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:44:14,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:44:14,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:14,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:14,120 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:14,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:44:14,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:44:14,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:14,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:14,132 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:15,349 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:44:15,349 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:44:15,349 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:44:15,349 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:44:15,349 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:44:15,349 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:15,349 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:44:15,349 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:44:15,349 INFO L132 ssoRankerPreferences]: Filename of dumped script: sep.i_Iteration10_Lasso [2025-03-04 15:44:15,349 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:44:15,349 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:44:15,351 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:15,513 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:15,514 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:15,516 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:15,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:15,518 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:15,520 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:15,521 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:15,522 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:15,523 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:15,525 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:15,526 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:15,533 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:15,534 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:15,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:15,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:15,538 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:15,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:15,540 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:15,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:15,585 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:15,586 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:15,588 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:15,589 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:15,590 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:15,591 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:15,593 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:15,812 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:44:15,812 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:44:15,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:15,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:15,814 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:15,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2025-03-04 15:44:15,815 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:15,824 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:15,825 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:15,825 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:15,825 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:15,826 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:15,826 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:15,829 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:15,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2025-03-04 15:44:15,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:15,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:15,835 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:15,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2025-03-04 15:44:15,837 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:15,846 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:15,846 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:15,846 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:15,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:15,848 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:15,848 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:15,854 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:44:15,871 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-03-04 15:44:15,871 INFO L444 ModelExtractionUtils]: 5 out of 16 variables were initially zero. Simplification set additionally 8 variables to zero. [2025-03-04 15:44:15,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:15,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:15,873 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:15,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2025-03-04 15:44:15,874 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:44:15,884 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:44:15,884 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:44:15,884 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~N~0, ULTIMATE.start_main_~i~1#1) = 1*~N~0 - 1*ULTIMATE.start_main_~i~1#1 Supporting invariants [] [2025-03-04 15:44:15,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2025-03-04 15:44:15,895 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2025-03-04 15:44:15,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:15,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 15:44:15,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 15:44:15,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:15,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:15,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:44:15,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:15,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:44:15,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:44:15,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:15,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:15,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:44:15,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:15,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:44:15,948 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-03-04 15:44:15,948 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 53 transitions. cyclomatic complexity: 18 Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:44:15,954 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 53 transitions. cyclomatic complexity: 18. Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 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) Result 42 states and 56 transitions. Complement of second has 3 states. [2025-03-04 15:44:15,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-04 15:44:15,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:44:15,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 16 transitions. [2025-03-04 15:44:15,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 16 transitions. Stem has 19 letters. Loop has 1 letters. [2025-03-04 15:44:15,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:15,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 16 transitions. Stem has 20 letters. Loop has 1 letters. [2025-03-04 15:44:15,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:15,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 16 transitions. Stem has 19 letters. Loop has 2 letters. [2025-03-04 15:44:15,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:15,955 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 56 transitions. [2025-03-04 15:44:15,955 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:44:15,956 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 56 transitions. [2025-03-04 15:44:15,956 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2025-03-04 15:44:15,956 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2025-03-04 15:44:15,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 56 transitions. [2025-03-04 15:44:15,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:44:15,956 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 56 transitions. [2025-03-04 15:44:15,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 56 transitions. [2025-03-04 15:44:15,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2025-03-04 15:44:15,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 40 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:44:15,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2025-03-04 15:44:15,957 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 55 transitions. [2025-03-04 15:44:15,957 INFO L432 stractBuchiCegarLoop]: Abstraction has 41 states and 55 transitions. [2025-03-04 15:44:15,957 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-04 15:44:15,957 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 55 transitions. [2025-03-04 15:44:15,958 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:44:15,958 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:44:15,958 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:44:15,958 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:44:15,958 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:44:15,959 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int#1(115, 2, 0, 1);call write~init~int#1(101, 2, 1, 1);call write~init~int#1(112, 2, 2, 1);call write~init~int#1(46, 2, 3, 1);call write~init~int#1(99, 2, 4, 1);call write~init~int#1(0, 2, 5, 1);~N~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post12#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;havoc main_#t~nondet5#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0 % 4294967296);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem1#1, sep_#t~post2#1, sep_#t~post3#1, sep_#t~post4#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0;" "assume sep_~i~0#1 < ~N~0;call sep_#t~mem1#1 := read~int#2(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4);" "assume !(0 == (if sep_#t~mem1#1 < 0 && 0 != sep_#t~mem1#1 % 2 then sep_#t~mem1#1 % 2 - 2 else sep_#t~mem1#1 % 2));havoc sep_#t~mem1#1;sep_#t~post3#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post3#1 - 1;" "sep_#t~post4#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post4#1;havoc sep_#t~post4#1;" "assume sep_~i~0#1 < ~N~0;call sep_#t~mem1#1 := read~int#2(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4);" "assume 0 == (if sep_#t~mem1#1 < 0 && 0 != sep_#t~mem1#1 % 2 then sep_#t~mem1#1 % 2 - 2 else sep_#t~mem1#1 % 2);havoc sep_#t~mem1#1;sep_#t~post2#1 := sep_~ret~0#1;sep_~ret~0#1 := 1 + sep_#t~post2#1;" "sep_#t~post4#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post4#1;havoc sep_#t~post4#1;" "assume !(sep_~i~0#1 < ~N~0);havoc sep_~i~0#1;sep_#res#1 := (if sep_~ret~0#1 % 4294967296 <= 2147483647 then sep_~ret~0#1 % 4294967296 else sep_~ret~0#1 % 4294967296 - 4294967296);" "main_#t~ret6#1 := sep_#res#1;havoc sep_#t~mem1#1, sep_#t~post2#1, sep_#t~post3#1, sep_#t~post4#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;havoc sep_#in~x#1.base, sep_#in~x#1.offset;assume { :end_inline_sep } true;main_~ret~1#1 := main_#t~ret6#1;havoc main_#t~ret6#1;call main_#t~mem7#1 := read~int#2(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#2(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#2(main_#t~mem8#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem8#1;call write~int#2(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem1#1, sep_#t~post2#1, sep_#t~post3#1, sep_#t~post4#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0;" "assume sep_~i~0#1 < ~N~0;call sep_#t~mem1#1 := read~int#2(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4);" "assume 0 == (if sep_#t~mem1#1 < 0 && 0 != sep_#t~mem1#1 % 2 then sep_#t~mem1#1 % 2 - 2 else sep_#t~mem1#1 % 2);havoc sep_#t~mem1#1;sep_#t~post2#1 := sep_~ret~0#1;sep_~ret~0#1 := 1 + sep_#t~post2#1;" "sep_#t~post4#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post4#1;havoc sep_#t~post4#1;" "assume sep_~i~0#1 < ~N~0;call sep_#t~mem1#1 := read~int#2(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4);" "assume !(0 == (if sep_#t~mem1#1 < 0 && 0 != sep_#t~mem1#1 % 2 then sep_#t~mem1#1 % 2 - 2 else sep_#t~mem1#1 % 2));havoc sep_#t~mem1#1;sep_#t~post3#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post3#1 - 1;" "sep_#t~post4#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post4#1;havoc sep_#t~post4#1;" "assume !(sep_~i~0#1 < ~N~0);havoc sep_~i~0#1;sep_#res#1 := (if sep_~ret~0#1 % 4294967296 <= 2147483647 then sep_~ret~0#1 % 4294967296 else sep_~ret~0#1 % 4294967296 - 4294967296);" "main_#t~ret9#1 := sep_#res#1;havoc sep_#t~mem1#1, sep_#t~post2#1, sep_#t~post3#1, sep_#t~post4#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;havoc sep_#in~x#1.base, sep_#in~x#1.offset;assume { :end_inline_sep } true;main_~ret2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;call main_#t~mem10#1 := read~int#2(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem10#1;havoc main_#t~mem10#1;main_~i~1#1 := 0;" "assume !(main_~i~1#1 < ~N~0 - 1);havoc main_~i~1#1;call write~int#2(main_~temp~0#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (~N~0 - 1), 4);assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem1#1, sep_#t~post2#1, sep_#t~post3#1, sep_#t~post4#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0;" [2025-03-04 15:44:15,959 INFO L754 eck$LassoCheckResult]: Loop: "assume sep_~i~0#1 < ~N~0;call sep_#t~mem1#1 := read~int#2(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4);" "assume 0 == (if sep_#t~mem1#1 < 0 && 0 != sep_#t~mem1#1 % 2 then sep_#t~mem1#1 % 2 - 2 else sep_#t~mem1#1 % 2);havoc sep_#t~mem1#1;sep_#t~post2#1 := sep_~ret~0#1;sep_~ret~0#1 := 1 + sep_#t~post2#1;" "sep_#t~post4#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post4#1;havoc sep_#t~post4#1;" [2025-03-04 15:44:15,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:15,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1131049676, now seen corresponding path program 1 times [2025-03-04 15:44:15,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:15,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994623421] [2025-03-04 15:44:15,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:44:15,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:15,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:44:15,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:44:15,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:15,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:16,000 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 15:44:16,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:44:16,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994623421] [2025-03-04 15:44:16,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994623421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:44:16,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:44:16,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:44:16,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512220980] [2025-03-04 15:44:16,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:44:16,001 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:44:16,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:16,001 INFO L85 PathProgramCache]: Analyzing trace with hash 44621, now seen corresponding path program 1 times [2025-03-04 15:44:16,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:16,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450980072] [2025-03-04 15:44:16,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:44:16,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:16,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:44:16,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:44:16,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:16,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:16,004 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:16,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:44:16,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:44:16,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:16,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:16,006 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:16,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:44:16,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:44:16,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:44:16,042 INFO L87 Difference]: Start difference. First operand 41 states and 55 transitions. cyclomatic complexity: 19 Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:44:16,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:44:16,056 INFO L93 Difference]: Finished difference Result 41 states and 54 transitions. [2025-03-04 15:44:16,056 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 54 transitions. [2025-03-04 15:44:16,057 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:44:16,057 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 54 transitions. [2025-03-04 15:44:16,057 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2025-03-04 15:44:16,057 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2025-03-04 15:44:16,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 54 transitions. [2025-03-04 15:44:16,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:44:16,058 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 54 transitions. [2025-03-04 15:44:16,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 54 transitions. [2025-03-04 15:44:16,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-03-04 15:44:16,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 40 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:44:16,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 54 transitions. [2025-03-04 15:44:16,059 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 54 transitions. [2025-03-04 15:44:16,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:44:16,060 INFO L432 stractBuchiCegarLoop]: Abstraction has 41 states and 54 transitions. [2025-03-04 15:44:16,060 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-03-04 15:44:16,060 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 54 transitions. [2025-03-04 15:44:16,060 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:44:16,060 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:44:16,060 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:44:16,060 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:44:16,060 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:44:16,060 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int#1(115, 2, 0, 1);call write~init~int#1(101, 2, 1, 1);call write~init~int#1(112, 2, 2, 1);call write~init~int#1(46, 2, 3, 1);call write~init~int#1(99, 2, 4, 1);call write~init~int#1(0, 2, 5, 1);~N~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post12#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;havoc main_#t~nondet5#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0 % 4294967296);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem1#1, sep_#t~post2#1, sep_#t~post3#1, sep_#t~post4#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0;" "assume sep_~i~0#1 < ~N~0;call sep_#t~mem1#1 := read~int#2(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4);" "assume !(0 == (if sep_#t~mem1#1 < 0 && 0 != sep_#t~mem1#1 % 2 then sep_#t~mem1#1 % 2 - 2 else sep_#t~mem1#1 % 2));havoc sep_#t~mem1#1;sep_#t~post3#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post3#1 - 1;" "sep_#t~post4#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post4#1;havoc sep_#t~post4#1;" "assume sep_~i~0#1 < ~N~0;call sep_#t~mem1#1 := read~int#2(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4);" "assume 0 == (if sep_#t~mem1#1 < 0 && 0 != sep_#t~mem1#1 % 2 then sep_#t~mem1#1 % 2 - 2 else sep_#t~mem1#1 % 2);havoc sep_#t~mem1#1;sep_#t~post2#1 := sep_~ret~0#1;sep_~ret~0#1 := 1 + sep_#t~post2#1;" "sep_#t~post4#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post4#1;havoc sep_#t~post4#1;" "assume !(sep_~i~0#1 < ~N~0);havoc sep_~i~0#1;sep_#res#1 := (if sep_~ret~0#1 % 4294967296 <= 2147483647 then sep_~ret~0#1 % 4294967296 else sep_~ret~0#1 % 4294967296 - 4294967296);" "main_#t~ret6#1 := sep_#res#1;havoc sep_#t~mem1#1, sep_#t~post2#1, sep_#t~post3#1, sep_#t~post4#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;havoc sep_#in~x#1.base, sep_#in~x#1.offset;assume { :end_inline_sep } true;main_~ret~1#1 := main_#t~ret6#1;havoc main_#t~ret6#1;call main_#t~mem7#1 := read~int#2(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#2(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#2(main_#t~mem8#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem8#1;call write~int#2(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem1#1, sep_#t~post2#1, sep_#t~post3#1, sep_#t~post4#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0;" "assume sep_~i~0#1 < ~N~0;call sep_#t~mem1#1 := read~int#2(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4);" "assume 0 == (if sep_#t~mem1#1 < 0 && 0 != sep_#t~mem1#1 % 2 then sep_#t~mem1#1 % 2 - 2 else sep_#t~mem1#1 % 2);havoc sep_#t~mem1#1;sep_#t~post2#1 := sep_~ret~0#1;sep_~ret~0#1 := 1 + sep_#t~post2#1;" "sep_#t~post4#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post4#1;havoc sep_#t~post4#1;" "assume sep_~i~0#1 < ~N~0;call sep_#t~mem1#1 := read~int#2(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4);" "assume !(0 == (if sep_#t~mem1#1 < 0 && 0 != sep_#t~mem1#1 % 2 then sep_#t~mem1#1 % 2 - 2 else sep_#t~mem1#1 % 2));havoc sep_#t~mem1#1;sep_#t~post3#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post3#1 - 1;" "sep_#t~post4#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post4#1;havoc sep_#t~post4#1;" "assume !(sep_~i~0#1 < ~N~0);havoc sep_~i~0#1;sep_#res#1 := (if sep_~ret~0#1 % 4294967296 <= 2147483647 then sep_~ret~0#1 % 4294967296 else sep_~ret~0#1 % 4294967296 - 4294967296);" "main_#t~ret9#1 := sep_#res#1;havoc sep_#t~mem1#1, sep_#t~post2#1, sep_#t~post3#1, sep_#t~post4#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;havoc sep_#in~x#1.base, sep_#in~x#1.offset;assume { :end_inline_sep } true;main_~ret2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;call main_#t~mem10#1 := read~int#2(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem10#1;havoc main_#t~mem10#1;main_~i~1#1 := 0;" "assume main_~i~1#1 < ~N~0 - 1;call main_#t~mem11#1 := read~int#2(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~1#1), 4);call write~int#2(main_#t~mem11#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~mem11#1;main_#t~post12#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1;" "assume !(main_~i~1#1 < ~N~0 - 1);havoc main_~i~1#1;call write~int#2(main_~temp~0#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (~N~0 - 1), 4);assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem1#1, sep_#t~post2#1, sep_#t~post3#1, sep_#t~post4#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0;" [2025-03-04 15:44:16,060 INFO L754 eck$LassoCheckResult]: Loop: "assume sep_~i~0#1 < ~N~0;call sep_#t~mem1#1 := read~int#2(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4);" "assume 0 == (if sep_#t~mem1#1 < 0 && 0 != sep_#t~mem1#1 % 2 then sep_#t~mem1#1 % 2 - 2 else sep_#t~mem1#1 % 2);havoc sep_#t~mem1#1;sep_#t~post2#1 := sep_~ret~0#1;sep_~ret~0#1 := 1 + sep_#t~post2#1;" "sep_#t~post4#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post4#1;havoc sep_#t~post4#1;" [2025-03-04 15:44:16,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:16,061 INFO L85 PathProgramCache]: Analyzing trace with hash -702801541, now seen corresponding path program 1 times [2025-03-04 15:44:16,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:16,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796579148] [2025-03-04 15:44:16,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:44:16,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:16,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:44:16,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:44:16,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:16,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:16,081 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:16,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:44:16,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:44:16,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:16,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:16,098 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:16,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:16,101 INFO L85 PathProgramCache]: Analyzing trace with hash 44621, now seen corresponding path program 2 times [2025-03-04 15:44:16,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:16,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090271638] [2025-03-04 15:44:16,101 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:44:16,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:16,103 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:44:16,104 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:44:16,104 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:44:16,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:16,104 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:16,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:44:16,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:44:16,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:16,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:16,106 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:16,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:16,107 INFO L85 PathProgramCache]: Analyzing trace with hash 804874899, now seen corresponding path program 1 times [2025-03-04 15:44:16,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:16,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737947342] [2025-03-04 15:44:16,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:44:16,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:16,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 15:44:16,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 15:44:16,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:16,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:16,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2025-03-04 15:44:16,778 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:44:16,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:44:16,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737947342] [2025-03-04 15:44:16,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737947342] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:44:16,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89509247] [2025-03-04 15:44:16,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:44:16,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:44:16,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:16,780 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:44:16,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Waiting until timeout for monitored process [2025-03-04 15:44:16,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 15:44:16,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 15:44:16,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:16,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:16,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-04 15:44:16,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:16,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2025-03-04 15:44:16,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2025-03-04 15:44:17,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 15:44:17,017 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2025-03-04 15:44:17,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 29 [2025-03-04 15:44:17,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-04 15:44:17,045 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 15:44:17,046 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:44:17,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2025-03-04 15:44:17,355 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 15:44:17,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89509247] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:44:17,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:44:17,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 29 [2025-03-04 15:44:17,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351770955] [2025-03-04 15:44:17,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:44:17,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:44:17,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 15:44:17,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=658, Unknown=0, NotChecked=0, Total=812 [2025-03-04 15:44:17,400 INFO L87 Difference]: Start difference. First operand 41 states and 54 transitions. cyclomatic complexity: 18 Second operand has 29 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 29 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:44:18,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:44:18,244 INFO L93 Difference]: Finished difference Result 112 states and 151 transitions. [2025-03-04 15:44:18,244 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 151 transitions. [2025-03-04 15:44:18,245 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:44:18,245 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 112 states and 151 transitions. [2025-03-04 15:44:18,246 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2025-03-04 15:44:18,246 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2025-03-04 15:44:18,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 112 states and 151 transitions. [2025-03-04 15:44:18,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:44:18,248 INFO L218 hiAutomatonCegarLoop]: Abstraction has 112 states and 151 transitions. [2025-03-04 15:44:18,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states and 151 transitions. [2025-03-04 15:44:18,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 82. [2025-03-04 15:44:18,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 82 states have (on average 1.3414634146341464) internal successors, (110), 81 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:44:18,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 110 transitions. [2025-03-04 15:44:18,254 INFO L240 hiAutomatonCegarLoop]: Abstraction has 82 states and 110 transitions. [2025-03-04 15:44:18,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-04 15:44:18,254 INFO L432 stractBuchiCegarLoop]: Abstraction has 82 states and 110 transitions. [2025-03-04 15:44:18,254 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-03-04 15:44:18,255 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 110 transitions. [2025-03-04 15:44:18,255 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:44:18,255 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:44:18,255 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:44:18,255 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:44:18,255 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:44:18,255 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int#1(115, 2, 0, 1);call write~init~int#1(101, 2, 1, 1);call write~init~int#1(112, 2, 2, 1);call write~init~int#1(46, 2, 3, 1);call write~init~int#1(99, 2, 4, 1);call write~init~int#1(0, 2, 5, 1);~N~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post12#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;havoc main_#t~nondet5#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0 % 4294967296);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem1#1, sep_#t~post2#1, sep_#t~post3#1, sep_#t~post4#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0;" "assume sep_~i~0#1 < ~N~0;call sep_#t~mem1#1 := read~int#2(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4);" "assume 0 == (if sep_#t~mem1#1 < 0 && 0 != sep_#t~mem1#1 % 2 then sep_#t~mem1#1 % 2 - 2 else sep_#t~mem1#1 % 2);havoc sep_#t~mem1#1;sep_#t~post2#1 := sep_~ret~0#1;sep_~ret~0#1 := 1 + sep_#t~post2#1;" "sep_#t~post4#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post4#1;havoc sep_#t~post4#1;" "assume sep_~i~0#1 < ~N~0;call sep_#t~mem1#1 := read~int#2(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4);" "assume 0 == (if sep_#t~mem1#1 < 0 && 0 != sep_#t~mem1#1 % 2 then sep_#t~mem1#1 % 2 - 2 else sep_#t~mem1#1 % 2);havoc sep_#t~mem1#1;sep_#t~post2#1 := sep_~ret~0#1;sep_~ret~0#1 := 1 + sep_#t~post2#1;" "sep_#t~post4#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post4#1;havoc sep_#t~post4#1;" "assume !(sep_~i~0#1 < ~N~0);havoc sep_~i~0#1;sep_#res#1 := (if sep_~ret~0#1 % 4294967296 <= 2147483647 then sep_~ret~0#1 % 4294967296 else sep_~ret~0#1 % 4294967296 - 4294967296);" "main_#t~ret6#1 := sep_#res#1;havoc sep_#t~mem1#1, sep_#t~post2#1, sep_#t~post3#1, sep_#t~post4#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;havoc sep_#in~x#1.base, sep_#in~x#1.offset;assume { :end_inline_sep } true;main_~ret~1#1 := main_#t~ret6#1;havoc main_#t~ret6#1;call main_#t~mem7#1 := read~int#2(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#2(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#2(main_#t~mem8#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem8#1;call write~int#2(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem1#1, sep_#t~post2#1, sep_#t~post3#1, sep_#t~post4#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0;" "assume sep_~i~0#1 < ~N~0;call sep_#t~mem1#1 := read~int#2(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4);" "assume 0 == (if sep_#t~mem1#1 < 0 && 0 != sep_#t~mem1#1 % 2 then sep_#t~mem1#1 % 2 - 2 else sep_#t~mem1#1 % 2);havoc sep_#t~mem1#1;sep_#t~post2#1 := sep_~ret~0#1;sep_~ret~0#1 := 1 + sep_#t~post2#1;" "sep_#t~post4#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post4#1;havoc sep_#t~post4#1;" "assume sep_~i~0#1 < ~N~0;call sep_#t~mem1#1 := read~int#2(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4);" "assume 0 == (if sep_#t~mem1#1 < 0 && 0 != sep_#t~mem1#1 % 2 then sep_#t~mem1#1 % 2 - 2 else sep_#t~mem1#1 % 2);havoc sep_#t~mem1#1;sep_#t~post2#1 := sep_~ret~0#1;sep_~ret~0#1 := 1 + sep_#t~post2#1;" "sep_#t~post4#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post4#1;havoc sep_#t~post4#1;" "assume !(sep_~i~0#1 < ~N~0);havoc sep_~i~0#1;sep_#res#1 := (if sep_~ret~0#1 % 4294967296 <= 2147483647 then sep_~ret~0#1 % 4294967296 else sep_~ret~0#1 % 4294967296 - 4294967296);" "main_#t~ret9#1 := sep_#res#1;havoc sep_#t~mem1#1, sep_#t~post2#1, sep_#t~post3#1, sep_#t~post4#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;havoc sep_#in~x#1.base, sep_#in~x#1.offset;assume { :end_inline_sep } true;main_~ret2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;call main_#t~mem10#1 := read~int#2(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem10#1;havoc main_#t~mem10#1;main_~i~1#1 := 0;" "assume main_~i~1#1 < ~N~0 - 1;call main_#t~mem11#1 := read~int#2(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~1#1), 4);call write~int#2(main_#t~mem11#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~mem11#1;main_#t~post12#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1;" "assume !(main_~i~1#1 < ~N~0 - 1);havoc main_~i~1#1;call write~int#2(main_~temp~0#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (~N~0 - 1), 4);assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem1#1, sep_#t~post2#1, sep_#t~post3#1, sep_#t~post4#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0;" [2025-03-04 15:44:18,255 INFO L754 eck$LassoCheckResult]: Loop: "assume sep_~i~0#1 < ~N~0;call sep_#t~mem1#1 := read~int#2(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4);" "assume 0 == (if sep_#t~mem1#1 < 0 && 0 != sep_#t~mem1#1 % 2 then sep_#t~mem1#1 % 2 - 2 else sep_#t~mem1#1 % 2);havoc sep_#t~mem1#1;sep_#t~post2#1 := sep_~ret~0#1;sep_~ret~0#1 := 1 + sep_#t~post2#1;" "sep_#t~post4#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post4#1;havoc sep_#t~post4#1;" [2025-03-04 15:44:18,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:18,259 INFO L85 PathProgramCache]: Analyzing trace with hash -2084740389, now seen corresponding path program 1 times [2025-03-04 15:44:18,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:18,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686965526] [2025-03-04 15:44:18,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:44:18,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:18,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:44:18,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:44:18,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:18,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:18,275 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:18,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:44:18,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:44:18,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:18,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:18,285 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:18,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:18,286 INFO L85 PathProgramCache]: Analyzing trace with hash 44621, now seen corresponding path program 3 times [2025-03-04 15:44:18,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:18,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846847322] [2025-03-04 15:44:18,286 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:44:18,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:18,287 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:44:18,288 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:44:18,288 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:44:18,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:18,289 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:18,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:44:18,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:44:18,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:18,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:18,290 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:18,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:18,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1273813709, now seen corresponding path program 1 times [2025-03-04 15:44:18,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:44:18,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094090039] [2025-03-04 15:44:18,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:44:18,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:44:18,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 15:44:18,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 15:44:18,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:18,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:18,306 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:44:18,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 15:44:18,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 15:44:18,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:18,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:44:18,320 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:19,722 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:44:19,722 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:44:19,722 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:44:19,722 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:44:19,722 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:44:19,723 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:19,723 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:44:19,723 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:44:19,723 INFO L132 ssoRankerPreferences]: Filename of dumped script: sep.i_Iteration13_Lasso [2025-03-04 15:44:19,723 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:44:19,723 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:44:19,724 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:19,730 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:19,732 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:19,733 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:19,734 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:19,736 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:19,737 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:19,773 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:19,775 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:19,917 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:19,918 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:19,920 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:19,921 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:19,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:19,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:19,925 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:19,926 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:19,927 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:19,933 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:19,935 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:19,936 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:19,937 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:19,938 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:19,940 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:19,941 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:19,942 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:19,943 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:44:20,181 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:44:20,181 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:44:20,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:20,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:20,184 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:20,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2025-03-04 15:44:20,185 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:20,195 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:20,195 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:20,195 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:20,195 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:20,196 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:20,196 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:20,198 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:20,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2025-03-04 15:44:20,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:20,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:20,204 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:20,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2025-03-04 15:44:20,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-03-04 15:44:20,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:20,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:20,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:20,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:20,216 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:20,216 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:20,218 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:20,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2025-03-04 15:44:20,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:20,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:20,224 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:20,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2025-03-04 15:44:20,226 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:20,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:20,236 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:20,236 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:20,236 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:20,236 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:20,236 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:20,239 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:20,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2025-03-04 15:44:20,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:20,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:20,245 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:20,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2025-03-04 15:44:20,247 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:20,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:20,256 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:20,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:20,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:20,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:20,256 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:20,256 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:20,257 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:20,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2025-03-04 15:44:20,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:20,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:20,264 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:20,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2025-03-04 15:44:20,265 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:20,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:20,275 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:20,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:20,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:20,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:20,275 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:20,275 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:20,276 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:20,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:20,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:20,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:20,283 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:20,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2025-03-04 15:44:20,284 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:20,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:20,294 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:20,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:20,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:20,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:20,294 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:20,294 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:20,295 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:20,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2025-03-04 15:44:20,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:20,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:20,301 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:20,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2025-03-04 15:44:20,303 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:20,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:20,312 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:20,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:20,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:20,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:20,312 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:20,312 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:20,313 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:20,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2025-03-04 15:44:20,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:20,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:20,320 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:20,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2025-03-04 15:44:20,321 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:20,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:20,330 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:20,330 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:20,330 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:20,331 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:20,331 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:20,333 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:20,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2025-03-04 15:44:20,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:20,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:20,340 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:20,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2025-03-04 15:44:20,342 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:20,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:20,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:20,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:20,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:20,351 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:20,351 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:20,353 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:20,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2025-03-04 15:44:20,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:20,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:20,360 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:20,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2025-03-04 15:44:20,361 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:20,370 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:20,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:20,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:20,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:20,371 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:20,371 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:20,373 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:20,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:20,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:20,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:20,381 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:20,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2025-03-04 15:44:20,382 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:20,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:20,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:20,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:20,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:20,392 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:20,392 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:20,394 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:20,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2025-03-04 15:44:20,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:20,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:20,401 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:20,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2025-03-04 15:44:20,403 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:20,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:20,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:20,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:20,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:20,413 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:20,413 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:20,415 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:20,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2025-03-04 15:44:20,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:20,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:20,422 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:20,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2025-03-04 15:44:20,423 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:20,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:20,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:20,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:20,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:20,433 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:20,433 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:20,435 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:20,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2025-03-04 15:44:20,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:20,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:20,442 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:20,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2025-03-04 15:44:20,444 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:20,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:20,453 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:44:20,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:20,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:20,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:20,453 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:44:20,453 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:44:20,454 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:20,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Ended with exit code 0 [2025-03-04 15:44:20,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:20,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:20,461 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:20,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2025-03-04 15:44:20,462 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:20,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:20,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:20,472 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:20,472 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:20,472 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:20,472 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:20,475 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:20,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2025-03-04 15:44:20,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:20,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:20,481 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:20,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2025-03-04 15:44:20,483 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:20,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:20,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:20,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:20,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:20,493 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:20,493 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:20,495 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:20,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2025-03-04 15:44:20,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:20,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:20,502 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:20,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2025-03-04 15:44:20,503 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:20,512 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:20,512 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:20,513 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:20,513 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:20,514 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:20,514 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:20,517 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:44:20,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2025-03-04 15:44:20,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:20,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:20,524 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:20,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2025-03-04 15:44:20,526 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:44:20,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:44:20,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:44:20,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:44:20,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:44:20,538 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:44:20,538 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:44:20,545 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:44:20,554 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2025-03-04 15:44:20,554 INFO L444 ModelExtractionUtils]: 6 out of 19 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-03-04 15:44:20,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:20,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:44:20,556 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:44:20,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2025-03-04 15:44:20,557 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:44:20,567 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:44:20,567 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:44:20,567 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sep_~i~0#1, ~N~0) = -1*ULTIMATE.start_sep_~i~0#1 + 1*~N~0 Supporting invariants [] [2025-03-04 15:44:20,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2025-03-04 15:44:20,583 INFO L156 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2025-03-04 15:44:20,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:44:20,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:44:20,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:44:20,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:20,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:20,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:44:20,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:20,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:44:20,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:44:20,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:44:20,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:44:20,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:44:20,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:44:20,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:44:20,659 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-04 15:44:20,659 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 82 states and 110 transitions. cyclomatic complexity: 37 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:44:20,668 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 82 states and 110 transitions. cyclomatic complexity: 37. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 86 states and 117 transitions. Complement of second has 4 states. [2025-03-04 15:44:20,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-04 15:44:20,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:44:20,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2025-03-04 15:44:20,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 21 letters. Loop has 3 letters. [2025-03-04 15:44:20,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:20,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 24 letters. Loop has 3 letters. [2025-03-04 15:44:20,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:20,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 21 letters. Loop has 6 letters. [2025-03-04 15:44:20,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:44:20,669 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 117 transitions. [2025-03-04 15:44:20,669 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 15:44:20,669 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 0 states and 0 transitions. [2025-03-04 15:44:20,669 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-04 15:44:20,670 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-04 15:44:20,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-04 15:44:20,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:44:20,670 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:44:20,670 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:44:20,670 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:44:20,670 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-03-04 15:44:20,670 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-04 15:44:20,670 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 15:44:20,670 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-04 15:44:20,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 04.03 03:44:20 BoogieIcfgContainer [2025-03-04 15:44:20,675 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-04 15:44:20,676 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:44:20,676 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:44:20,676 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:44:20,676 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:44:05" (3/4) ... [2025-03-04 15:44:20,677 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 15:44:20,678 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:44:20,678 INFO L158 Benchmark]: Toolchain (without parser) took 16150.01ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 113.0MB in the beginning and 190.7MB in the end (delta: -77.8MB). Peak memory consumption was 249.1MB. Max. memory is 16.1GB. [2025-03-04 15:44:20,678 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:44:20,678 INFO L158 Benchmark]: CACSL2BoogieTranslator took 180.84ms. Allocated memory is still 142.6MB. Free memory was 113.0MB in the beginning and 101.7MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:44:20,679 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.73ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 100.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:44:20,679 INFO L158 Benchmark]: Boogie Preprocessor took 43.29ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 98.7MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:44:20,679 INFO L158 Benchmark]: IcfgBuilder took 314.24ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 82.4MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 15:44:20,679 INFO L158 Benchmark]: BuchiAutomizer took 15578.88ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 82.4MB in the beginning and 190.8MB in the end (delta: -108.5MB). Peak memory consumption was 215.5MB. Max. memory is 16.1GB. [2025-03-04 15:44:20,679 INFO L158 Benchmark]: Witness Printer took 2.14ms. Allocated memory is still 469.8MB. Free memory was 190.8MB in the beginning and 190.7MB in the end (delta: 75.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:44:20,680 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 180.84ms. Allocated memory is still 142.6MB. Free memory was 113.0MB in the beginning and 101.7MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.73ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 100.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.29ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 98.7MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 314.24ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 82.4MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 15578.88ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 82.4MB in the beginning and 190.8MB in the end (delta: -108.5MB). Peak memory consumption was 215.5MB. Max. memory is 16.1GB. * Witness Printer took 2.14ms. Allocated memory is still 469.8MB. Free memory was 190.8MB in the beginning and 190.7MB in the end (delta: 75.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (8 trivial, 5 deterministic, 0 nondeterministic). One deterministic module has affine ranking function (N + ((long long) -1 * i)) and consists of 3 locations. One deterministic module has affine ranking function (5 + ((long long) -4 * i)) and consists of 8 locations. One deterministic module has affine ranking function (N + ((long long) -1 * i)) and consists of 4 locations. One deterministic module has affine ranking function (N + ((long long) -1 * i)) and consists of 2 locations. One deterministic module has affine ranking function (N + ((long long) -1 * i)) and consists of 3 locations. 8 modules have a trivial ranking function, the largest among these consists of 29 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.5s and 14 iterations. TraceHistogramMax:3. Analysis of lassos took 13.2s. Construction of modules took 0.8s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 7. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 117 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 453 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 449 mSDsluCounter, 491 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 305 mSDsCounter, 106 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1695 IncrementalHoareTripleChecker+Invalid, 1801 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 106 mSolverCounterUnsat, 186 mSDtfsCounter, 1695 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU6 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital238 mio100 ax100 hnf100 lsp70 ukn75 mio100 lsp41 div183 bol100 ite100 ukn100 eq149 hnf94 smp60 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 18ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-03-04 15:44:20,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2025-03-04 15:44:20,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Ended with exit code 0 [2025-03-04 15:44:21,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:21,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:21,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:21,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-03-04 15:44:21,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE