./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 e2fb8bed 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-?-e2fb8be-m [2025-03-09 06:58:12,351 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:58:12,400 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-09 06:58:12,406 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:58:12,406 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:58:12,406 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-09 06:58:12,428 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:58:12,429 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:58:12,429 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:58:12,429 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:58:12,430 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:58:12,430 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:58:12,430 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:58:12,430 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:58:12,431 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-09 06:58:12,431 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-09 06:58:12,431 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-09 06:58:12,431 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-09 06:58:12,431 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-09 06:58:12,431 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-09 06:58:12,431 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:58:12,431 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-09 06:58:12,431 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 06:58:12,431 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:58:12,431 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 06:58:12,431 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:58:12,431 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-09 06:58:12,431 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-09 06:58:12,431 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-09 06:58:12,431 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:58:12,431 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 06:58:12,431 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:58:12,431 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-09 06:58:12,431 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:58:12,431 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:58:12,432 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:58:12,432 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:58:12,432 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:58:12,432 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:58:12,432 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-09 06:58:12,432 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-09 06:58:12,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:58:12,657 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:58:12,659 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:58:12,659 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:58:12,660 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:58:12,660 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/sep.i [2025-03-09 06:58:13,795 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/604b5791b/1515a4c169ab49d085b6f39135e6432e/FLAG2ea37d568 [2025-03-09 06:58:14,019 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:58:14,021 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sep.i [2025-03-09 06:58:14,026 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/604b5791b/1515a4c169ab49d085b6f39135e6432e/FLAG2ea37d568 [2025-03-09 06:58:14,044 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/604b5791b/1515a4c169ab49d085b6f39135e6432e [2025-03-09 06:58:14,047 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:58:14,048 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:58:14,049 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:58:14,049 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:58:14,052 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:58:14,054 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:58:14" (1/1) ... [2025-03-09 06:58:14,054 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@307a2f64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:58:14, skipping insertion in model container [2025-03-09 06:58:14,054 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:58:14" (1/1) ... [2025-03-09 06:58:14,066 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:58:14,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:58:14,200 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:58:14,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:58:14,230 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:58:14,231 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:58:14 WrapperNode [2025-03-09 06:58:14,231 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:58:14,232 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:58:14,232 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:58:14,232 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:58:14,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:58:14" (1/1) ... [2025-03-09 06:58:14,242 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:58:14" (1/1) ... [2025-03-09 06:58:14,262 INFO L138 Inliner]: procedures = 16, calls = 27, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 116 [2025-03-09 06:58:14,264 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:58:14,264 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:58:14,264 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:58:14,264 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:58:14,270 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:58:14" (1/1) ... [2025-03-09 06:58:14,270 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:58:14" (1/1) ... [2025-03-09 06:58:14,273 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:58:14" (1/1) ... [2025-03-09 06:58:14,280 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-09 06:58:14,281 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:58:14" (1/1) ... [2025-03-09 06:58:14,281 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:58:14" (1/1) ... [2025-03-09 06:58:14,285 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:58:14" (1/1) ... [2025-03-09 06:58:14,286 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:58:14" (1/1) ... [2025-03-09 06:58:14,287 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:58:14" (1/1) ... [2025-03-09 06:58:14,287 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:58:14" (1/1) ... [2025-03-09 06:58:14,290 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:58:14,291 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:58:14,291 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:58:14,291 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:58:14,292 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:58:14" (1/1) ... [2025-03-09 06:58:14,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:14,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:14,314 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-09 06:58:14,316 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-09 06:58:14,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 06:58:14,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 06:58:14,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 06:58:14,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 06:58:14,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 06:58:14,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 06:58:14,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 06:58:14,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 06:58:14,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:58:14,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:58:14,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 06:58:14,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 06:58:14,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 06:58:14,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 06:58:14,389 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:58:14,391 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:58:14,568 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-03-09 06:58:14,568 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:58:14,575 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:58:14,575 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 06:58:14,575 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:58:14 BoogieIcfgContainer [2025-03-09 06:58:14,576 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:58:14,576 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-09 06:58:14,576 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-09 06:58:14,580 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-09 06:58:14,580 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:58:14,580 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.03 06:58:14" (1/3) ... [2025-03-09 06:58:14,582 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3e3f4f8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 06:58:14, skipping insertion in model container [2025-03-09 06:58:14,582 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:58:14,583 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:58:14" (2/3) ... [2025-03-09 06:58:14,583 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3e3f4f8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 06:58:14, skipping insertion in model container [2025-03-09 06:58:14,583 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:58:14,583 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:58:14" (3/3) ... [2025-03-09 06:58:14,584 INFO L363 chiAutomizerObserver]: Analyzing ICFG sep.i [2025-03-09 06:58:14,619 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-09 06:58:14,619 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-09 06:58:14,619 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-09 06:58:14,619 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-09 06:58:14,619 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-09 06:58:14,619 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-09 06:58:14,619 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-09 06:58:14,619 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-09 06:58:14,622 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-09 06:58:14,631 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2025-03-09 06:58:14,631 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:58:14,631 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:58:14,634 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-09 06:58:14,634 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 06:58:14,634 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-09 06:58:14,635 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-09 06:58:14,635 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2025-03-09 06:58:14,635 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:58:14,636 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:58:14,636 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-09 06:58:14,636 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 06:58:14,640 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-09 06:58:14,640 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-09 06:58:14,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:14,643 INFO L85 PathProgramCache]: Analyzing trace with hash 64512, now seen corresponding path program 1 times [2025-03-09 06:58:14,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:14,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309369706] [2025-03-09 06:58:14,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:58:14,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:14,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:58:14,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:58:14,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:14,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:14,718 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:14,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:58:14,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:58:14,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:14,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:14,743 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:14,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:14,746 INFO L85 PathProgramCache]: Analyzing trace with hash 60509, now seen corresponding path program 1 times [2025-03-09 06:58:14,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:14,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289981276] [2025-03-09 06:58:14,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:58:14,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:14,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:58:14,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:58:14,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:14,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:14,765 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:14,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:58:14,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:58:14,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:14,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:14,783 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:14,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:14,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1921907710, now seen corresponding path program 1 times [2025-03-09 06:58:14,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:14,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996054400] [2025-03-09 06:58:14,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:58:14,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:14,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:58:14,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:58:14,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:14,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:14,822 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:14,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:58:14,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:58:14,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:14,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:14,854 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:15,280 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:58:15,280 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:58:15,280 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:58:15,281 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:58:15,281 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:58:15,281 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:15,281 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:58:15,281 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:58:15,281 INFO L132 ssoRankerPreferences]: Filename of dumped script: sep.i_Iteration1_Lasso [2025-03-09 06:58:15,281 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:58:15,281 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:58:15,291 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:15,296 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:15,298 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:15,300 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:15,351 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:15,353 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:15,355 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:15,357 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:15,360 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:15,364 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:15,366 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:15,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:15,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:15,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:15,541 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:15,548 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:15,551 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:15,552 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:15,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:15,555 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:15,559 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:15,560 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:15,563 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:15,564 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:15,566 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:15,914 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:58:15,916 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:58:15,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:15,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:15,919 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-09 06:58:15,921 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-09 06:58:15,922 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:15,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:15,934 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:15,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:15,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:15,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:15,940 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:15,940 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:15,942 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:15,948 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-09 06:58:15,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:15,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:15,953 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-09 06:58:15,956 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-09 06:58:15,957 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-09 06:58:15,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:15,969 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:15,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:15,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:15,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:15,971 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:15,971 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:15,972 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:15,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-03-09 06:58:15,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:15,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:15,982 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-09 06:58:15,983 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-09 06:58:15,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-09 06:58:15,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:15,996 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:15,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:15,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:15,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:15,998 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:15,998 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:15,999 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:16,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-03-09 06:58:16,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:16,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:16,009 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-09 06:58:16,011 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-09 06:58:16,011 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-09 06:58:16,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:16,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:16,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:16,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:16,025 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:16,025 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:16,028 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:16,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-03-09 06:58:16,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:16,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:16,036 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-09 06:58:16,038 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-09 06:58:16,040 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-09 06:58:16,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:16,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:16,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:16,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:16,057 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:16,057 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:16,060 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:16,066 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-09 06:58:16,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:16,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:16,069 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-09 06:58:16,070 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-09 06:58:16,071 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-09 06:58:16,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:16,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:16,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:16,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:16,084 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:16,085 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:16,088 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:16,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-03-09 06:58:16,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:16,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:16,096 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-09 06:58:16,097 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-09 06:58:16,098 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-09 06:58:16,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:16,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:16,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:16,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:16,111 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:16,112 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:16,115 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:16,120 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-09 06:58:16,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:16,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:16,122 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-09 06:58:16,123 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-09 06:58:16,125 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-09 06:58:16,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:16,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:16,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:16,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:16,137 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:16,137 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:16,140 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:16,145 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-09 06:58:16,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:16,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:16,147 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-09 06:58:16,149 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-09 06:58:16,150 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-09 06:58:16,160 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:16,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:16,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:16,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:16,162 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:16,162 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:16,165 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:16,170 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-09 06:58:16,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:16,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:16,173 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-09 06:58:16,174 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-09 06:58:16,175 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:16,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:16,186 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:16,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:16,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:16,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:16,186 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:16,186 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:16,188 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:16,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-03-09 06:58:16,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:16,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:16,198 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-09 06:58:16,198 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-09 06:58:16,199 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:16,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:16,209 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:16,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:16,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:16,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:16,210 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:16,210 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:16,211 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:16,216 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-09 06:58:16,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:16,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:16,218 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-09 06:58:16,219 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-09 06:58:16,220 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-09 06:58:16,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:16,229 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:16,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:16,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:16,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:16,230 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:16,230 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:16,231 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:16,236 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-09 06:58:16,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:16,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:16,238 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-09 06:58:16,238 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-09 06:58:16,240 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:16,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:16,249 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:16,249 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:16,249 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:16,249 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:16,249 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:16,249 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:16,250 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:16,256 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-09 06:58:16,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:16,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:16,257 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-09 06:58:16,258 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-09 06:58:16,259 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-09 06:58:16,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:16,268 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:16,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:16,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:16,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:16,269 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:16,269 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:16,270 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:16,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-03-09 06:58:16,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:16,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:16,277 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-09 06:58:16,278 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-09 06:58:16,279 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:16,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:16,288 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:16,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:16,288 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:16,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:16,291 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:16,292 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:16,293 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:16,298 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-09 06:58:16,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:16,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:16,300 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-09 06:58:16,300 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-09 06:58:16,301 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-09 06:58:16,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:16,310 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:16,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:16,310 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:16,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:16,311 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:16,311 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:16,312 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:16,317 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-09 06:58:16,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:16,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:16,319 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-09 06:58:16,319 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-09 06:58:16,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-09 06:58:16,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:16,330 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:16,330 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:16,330 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:16,332 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:16,332 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:16,334 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:16,340 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-09 06:58:16,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:16,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:16,342 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-09 06:58:16,343 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-09 06:58:16,344 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-09 06:58:16,354 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:16,354 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:16,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:16,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:16,357 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:16,357 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:16,361 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:16,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-03-09 06:58:16,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:16,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:16,369 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-09 06:58:16,370 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-09 06:58:16,371 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-09 06:58:16,381 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:16,381 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:16,381 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:16,381 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:16,390 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:16,390 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:16,398 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:58:16,438 INFO L443 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2025-03-09 06:58:16,444 INFO L444 ModelExtractionUtils]: 1 out of 19 variables were initially zero. Simplification set additionally 14 variables to zero. [2025-03-09 06:58:16,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:16,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:16,447 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:58:16,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-03-09 06:58:16,450 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:58:16,461 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-03-09 06:58:16,462 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:58:16,462 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_sep_~x#1.base)_1, ULTIMATE.start_sep_~i~0#1) = 1*v_rep(select #length ULTIMATE.start_sep_~x#1.base)_1 - 4*ULTIMATE.start_sep_~i~0#1 Supporting invariants [1*ULTIMATE.start_sep_~x#1.offset >= 0] [2025-03-09 06:58:16,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-03-09 06:58:16,490 INFO L156 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2025-03-09 06:58:16,500 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-09 06:58:16,500 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-09 06:58:16,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:16,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:58:16,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:58:16,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:16,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:16,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:58:16,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:16,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:58:16,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:58:16,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:16,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:16,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:58:16,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:16,575 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-09 06:58:16,592 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-09 06:58:16,593 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-09 06:58:16,644 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-09 06:58:16,645 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-09 06:58:16,648 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-09 06:58:16,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2025-03-09 06:58:16,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 3 letters. Loop has 3 letters. [2025-03-09 06:58:16,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:58:16,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 6 letters. Loop has 3 letters. [2025-03-09 06:58:16,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:58:16,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 3 letters. Loop has 6 letters. [2025-03-09 06:58:16,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:58:16,656 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 42 transitions. [2025-03-09 06:58:16,658 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2025-03-09 06:58:16,660 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 16 states and 23 transitions. [2025-03-09 06:58:16,661 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2025-03-09 06:58:16,662 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-03-09 06:58:16,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 23 transitions. [2025-03-09 06:58:16,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:58:16,662 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 23 transitions. [2025-03-09 06:58:16,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 23 transitions. [2025-03-09 06:58:16,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-03-09 06:58:16,678 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-09 06:58:16,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2025-03-09 06:58:16,679 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 23 transitions. [2025-03-09 06:58:16,679 INFO L432 stractBuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2025-03-09 06:58:16,679 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-09 06:58:16,679 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 23 transitions. [2025-03-09 06:58:16,681 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2025-03-09 06:58:16,681 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:58:16,682 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:58:16,682 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-09 06:58:16,682 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 06:58:16,682 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-09 06:58:16,682 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-09 06:58:16,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:16,683 INFO L85 PathProgramCache]: Analyzing trace with hash 61996894, now seen corresponding path program 1 times [2025-03-09 06:58:16,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:16,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611771576] [2025-03-09 06:58:16,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:58:16,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:16,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:58:16,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:58:16,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:16,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:16,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-03-09 06:58:16,798 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-09 06:58:16,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:58:16,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611771576] [2025-03-09 06:58:16,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611771576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:58:16,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:58:16,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:58:16,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984743360] [2025-03-09 06:58:16,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:58:16,801 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:58:16,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:16,801 INFO L85 PathProgramCache]: Analyzing trace with hash 53558, now seen corresponding path program 1 times [2025-03-09 06:58:16,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:16,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125615134] [2025-03-09 06:58:16,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:58:16,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:16,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:58:16,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:58:16,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:16,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:16,812 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:16,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:58:16,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:58:16,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:16,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:16,821 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:16,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:58:16,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:58:16,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:58:16,865 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-09 06:58:16,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:58:16,888 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2025-03-09 06:58:16,888 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 25 transitions. [2025-03-09 06:58:16,888 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2025-03-09 06:58:16,888 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 25 transitions. [2025-03-09 06:58:16,888 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-03-09 06:58:16,889 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-03-09 06:58:16,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2025-03-09 06:58:16,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:58:16,889 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 25 transitions. [2025-03-09 06:58:16,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2025-03-09 06:58:16,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2025-03-09 06:58:16,890 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-09 06:58:16,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2025-03-09 06:58:16,891 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 22 transitions. [2025-03-09 06:58:16,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:58:16,892 INFO L432 stractBuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2025-03-09 06:58:16,892 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-09 06:58:16,892 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2025-03-09 06:58:16,892 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2025-03-09 06:58:16,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:58:16,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:58:16,893 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:58:16,893 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 06:58:16,893 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-09 06:58:16,893 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-09 06:58:16,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:16,893 INFO L85 PathProgramCache]: Analyzing trace with hash 117402683, now seen corresponding path program 1 times [2025-03-09 06:58:16,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:16,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905764885] [2025-03-09 06:58:16,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:58:16,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:16,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:58:16,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:58:16,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:16,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:16,995 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-09 06:58:16,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:58:16,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905764885] [2025-03-09 06:58:16,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905764885] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:58:16,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800519500] [2025-03-09 06:58:16,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:58:16,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:58:16,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:16,999 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-09 06:58:16,999 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-09 06:58:17,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:58:17,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:58:17,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:17,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:17,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:58:17,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:17,082 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-09 06:58:17,082 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:58:17,103 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-09 06:58:17,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800519500] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:58:17,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:58:17,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 06:58:17,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741228224] [2025-03-09 06:58:17,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:58:17,104 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:58:17,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:17,104 INFO L85 PathProgramCache]: Analyzing trace with hash 53558, now seen corresponding path program 2 times [2025-03-09 06:58:17,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:17,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493163957] [2025-03-09 06:58:17,104 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:58:17,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:17,108 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:58:17,114 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:58:17,114 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:58:17,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:17,116 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:17,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:58:17,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:58:17,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:17,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:17,124 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:17,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:58:17,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 06:58:17,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2025-03-09 06:58:17,172 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-09 06:58:17,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:58:17,207 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2025-03-09 06:58:17,207 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 29 transitions. [2025-03-09 06:58:17,208 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2025-03-09 06:58:17,208 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 29 transitions. [2025-03-09 06:58:17,208 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-03-09 06:58:17,208 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-03-09 06:58:17,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 29 transitions. [2025-03-09 06:58:17,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:58:17,208 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 29 transitions. [2025-03-09 06:58:17,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 29 transitions. [2025-03-09 06:58:17,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2025-03-09 06:58:17,209 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-09 06:58:17,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2025-03-09 06:58:17,209 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 26 transitions. [2025-03-09 06:58:17,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:58:17,210 INFO L432 stractBuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2025-03-09 06:58:17,210 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-09 06:58:17,210 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2025-03-09 06:58:17,210 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2025-03-09 06:58:17,210 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:58:17,210 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:58:17,210 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 06:58:17,211 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 06:58:17,211 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-09 06:58:17,211 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-09 06:58:17,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:17,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1443821118, now seen corresponding path program 2 times [2025-03-09 06:58:17,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:17,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672722016] [2025-03-09 06:58:17,211 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:58:17,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:17,216 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-09 06:58:17,240 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 06:58:17,240 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:58:17,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:17,240 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:17,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 06:58:17,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 06:58:17,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:17,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:17,264 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:17,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:17,264 INFO L85 PathProgramCache]: Analyzing trace with hash 53558, now seen corresponding path program 3 times [2025-03-09 06:58:17,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:17,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367594542] [2025-03-09 06:58:17,264 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:58:17,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:17,269 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:58:17,271 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:58:17,271 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 06:58:17,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:17,272 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:17,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:58:17,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:58:17,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:17,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:17,278 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:17,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:17,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1222519335, now seen corresponding path program 1 times [2025-03-09 06:58:17,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:17,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324410961] [2025-03-09 06:58:17,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:58:17,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:17,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 06:58:17,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:58:17,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:17,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:17,777 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-09 06:58:17,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:58:17,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324410961] [2025-03-09 06:58:17,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324410961] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:58:17,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688322542] [2025-03-09 06:58:17,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:58:17,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:58:17,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:17,780 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:58:17,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-09 06:58:17,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 06:58:17,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:58:17,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:17,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:17,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-09 06:58:17,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:17,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 41 treesize of output 14 [2025-03-09 06:58:17,960 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 18 treesize of output 10 [2025-03-09 06:58:17,971 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-09 06:58:17,971 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:58:18,030 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2025-03-09 06:58:18,030 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-09 06:58:18,079 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-09 06:58:18,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688322542] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:58:18,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:58:18,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-03-09 06:58:18,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026004612] [2025-03-09 06:58:18,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:58:18,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:58:18,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-09 06:58:18,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2025-03-09 06:58:18,125 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 11 Second operand has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 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-09 06:58:18,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:58:18,458 INFO L93 Difference]: Finished difference Result 50 states and 73 transitions. [2025-03-09 06:58:18,458 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 73 transitions. [2025-03-09 06:58:18,459 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2025-03-09 06:58:18,460 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 50 states and 73 transitions. [2025-03-09 06:58:18,460 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2025-03-09 06:58:18,460 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2025-03-09 06:58:18,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 73 transitions. [2025-03-09 06:58:18,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:58:18,460 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 73 transitions. [2025-03-09 06:58:18,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 73 transitions. [2025-03-09 06:58:18,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 26. [2025-03-09 06:58:18,463 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-09 06:58:18,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2025-03-09 06:58:18,463 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 37 transitions. [2025-03-09 06:58:18,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 06:58:18,464 INFO L432 stractBuchiCegarLoop]: Abstraction has 26 states and 37 transitions. [2025-03-09 06:58:18,464 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-09 06:58:18,464 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 37 transitions. [2025-03-09 06:58:18,465 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2025-03-09 06:58:18,465 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:58:18,465 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:58:18,465 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:58:18,465 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 06:58:18,465 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-09 06:58:18,465 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-09 06:58:18,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:18,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1443791327, now seen corresponding path program 1 times [2025-03-09 06:58:18,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:18,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933506498] [2025-03-09 06:58:18,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:58:18,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:18,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 06:58:18,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 06:58:18,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:18,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:18,480 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:18,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 06:58:18,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 06:58:18,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:18,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:18,490 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:18,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:18,490 INFO L85 PathProgramCache]: Analyzing trace with hash 53558, now seen corresponding path program 4 times [2025-03-09 06:58:18,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:18,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971724796] [2025-03-09 06:58:18,490 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:58:18,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:18,493 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-03-09 06:58:18,495 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:58:18,495 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:58:18,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:18,496 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:18,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:58:18,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:58:18,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:18,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:18,498 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:18,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:18,498 INFO L85 PathProgramCache]: Analyzing trace with hash -2110023016, now seen corresponding path program 1 times [2025-03-09 06:58:18,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:18,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065773946] [2025-03-09 06:58:18,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:58:18,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:18,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 06:58:18,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:58:18,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:18,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:18,521 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:18,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 06:58:18,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:58:18,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:18,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:18,549 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:19,094 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:58:19,094 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:58:19,094 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:58:19,094 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:58:19,094 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:58:19,094 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:19,094 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:58:19,094 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:58:19,094 INFO L132 ssoRankerPreferences]: Filename of dumped script: sep.i_Iteration5_Lasso [2025-03-09 06:58:19,094 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:58:19,094 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:58:19,096 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:19,098 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:19,133 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:19,135 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:19,140 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:19,142 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:19,143 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:19,144 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:19,146 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:19,148 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:19,149 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:19,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:19,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:19,310 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:19,316 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:19,318 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:19,319 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:19,321 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:19,322 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:19,323 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:19,325 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:19,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:19,327 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:19,329 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:19,330 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:19,609 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:58:19,609 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:58:19,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:19,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:19,616 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-09 06:58:19,617 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-09 06:58:19,618 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-09 06:58:19,628 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:19,628 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:19,628 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:19,628 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:19,628 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:19,629 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:19,629 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:19,630 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:19,635 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-09 06:58:19,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:19,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:19,636 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-09 06:58:19,638 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-09 06:58:19,639 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-09 06:58:19,648 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:19,648 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:19,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:19,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:19,649 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:19,649 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:19,651 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:19,657 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-09 06:58:19,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:19,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:19,658 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-09 06:58:19,659 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-09 06:58:19,661 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-09 06:58:19,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:19,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:19,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:19,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:19,672 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:19,672 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:19,674 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:19,679 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-09 06:58:19,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:19,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:19,680 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-09 06:58:19,681 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-09 06:58:19,682 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-09 06:58:19,691 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:19,691 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:19,691 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:19,691 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:19,692 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:19,692 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:19,695 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:19,700 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-09 06:58:19,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:19,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:19,701 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-09 06:58:19,702 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-09 06:58:19,703 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-09 06:58:19,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:19,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:19,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:19,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:19,714 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:19,714 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:19,716 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:19,722 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-09 06:58:19,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:19,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:19,724 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-09 06:58:19,725 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-09 06:58:19,726 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-09 06:58:19,735 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:19,735 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:19,735 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:19,735 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:19,736 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:19,736 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:19,738 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:19,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-03-09 06:58:19,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:19,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:19,745 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-09 06:58:19,746 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-09 06:58:19,747 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-09 06:58:19,756 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:19,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:19,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:19,757 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:19,757 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:19,758 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:19,760 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:19,765 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-09 06:58:19,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:19,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:19,767 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-09 06:58:19,767 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-09 06:58:19,769 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-09 06:58:19,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:19,778 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:19,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:19,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:19,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:19,779 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:19,779 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:19,780 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:19,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-03-09 06:58:19,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:19,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:19,787 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-09 06:58:19,787 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-09 06:58:19,788 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-09 06:58:19,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:19,798 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:19,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:19,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:19,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:19,799 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:19,799 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:19,800 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:19,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-03-09 06:58:19,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:19,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:19,807 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-09 06:58:19,808 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-09 06:58:19,809 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-09 06:58:19,818 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:19,818 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:19,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:19,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:19,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:19,818 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:19,818 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:19,819 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:19,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-03-09 06:58:19,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:19,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:19,826 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-09 06:58:19,827 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-09 06:58:19,827 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:19,837 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:19,837 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:19,837 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:19,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:19,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:19,837 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:19,837 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:19,838 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:19,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-03-09 06:58:19,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:19,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:19,845 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-09 06:58:19,845 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-09 06:58:19,846 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-09 06:58:19,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:19,856 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:19,858 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:19,858 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:19,858 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:19,858 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:19,858 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:19,860 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:19,864 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-09 06:58:19,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:19,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:19,866 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-09 06:58:19,867 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-09 06:58:19,868 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-09 06:58:19,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:19,877 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:19,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:19,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:19,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:19,878 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:19,878 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:19,879 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:19,884 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-09 06:58:19,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:19,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:19,885 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-09 06:58:19,886 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-09 06:58:19,887 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-09 06:58:19,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:19,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:19,897 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:19,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:19,904 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:19,904 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:19,906 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:19,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2025-03-09 06:58:19,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:19,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:19,915 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-09 06:58:19,915 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-09 06:58:19,917 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-09 06:58:19,927 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:19,928 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:19,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:19,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:19,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:19,928 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:19,928 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:19,929 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:19,934 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-09 06:58:19,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:19,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:19,936 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-09 06:58:19,937 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-09 06:58:19,938 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-09 06:58:19,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:19,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:19,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:19,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:19,948 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:19,948 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:19,950 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:19,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-03-09 06:58:19,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:19,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:19,959 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-09 06:58:19,961 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-09 06:58:19,961 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-09 06:58:19,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:19,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:19,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:19,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:19,972 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:19,972 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:19,975 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:19,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2025-03-09 06:58:19,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:19,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:19,982 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-09 06:58:19,984 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-09 06:58:19,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-09 06:58:19,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:19,994 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:19,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:19,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:19,996 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:19,996 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:19,998 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:20,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2025-03-09 06:58:20,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:20,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:20,007 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-09 06:58:20,008 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-09 06:58:20,009 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-09 06:58:20,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:20,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:20,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:20,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:20,020 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:20,020 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:20,023 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:20,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-03-09 06:58:20,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:20,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:20,031 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-09 06:58:20,032 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-09 06:58:20,032 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-09 06:58:20,043 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:20,043 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:20,043 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:20,043 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:20,046 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:20,046 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:20,053 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:58:20,070 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2025-03-09 06:58:20,070 INFO L444 ModelExtractionUtils]: 0 out of 19 variables were initially zero. Simplification set additionally 15 variables to zero. [2025-03-09 06:58:20,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:20,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:20,073 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-09 06:58:20,074 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-09 06:58:20,075 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:58:20,085 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:58:20,085 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:58:20,086 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_2, ULTIMATE.start_sep_~i~0#1, ULTIMATE.start_sep_~x#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_2 - 4*ULTIMATE.start_sep_~i~0#1 - 1*ULTIMATE.start_sep_~x#1.offset Supporting invariants [] [2025-03-09 06:58:20,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2025-03-09 06:58:20,108 INFO L156 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2025-03-09 06:58:20,110 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x!offset [2025-03-09 06:58:20,110 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-09 06:58:20,110 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-09 06:58:20,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:20,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 06:58:20,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 06:58:20,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:20,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:20,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 06:58:20,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:20,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:58:20,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:58:20,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:20,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:20,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 06:58:20,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:20,184 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-09 06:58:20,185 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-09 06:58:20,185 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 37 transitions. cyclomatic complexity: 16 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:58:20,215 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 37 transitions. cyclomatic complexity: 16. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 30 states and 45 transitions. Complement of second has 5 states. [2025-03-09 06:58:20,216 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-09 06:58:20,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:58:20,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2025-03-09 06:58:20,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 11 letters. Loop has 3 letters. [2025-03-09 06:58:20,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:58:20,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 14 letters. Loop has 3 letters. [2025-03-09 06:58:20,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:58:20,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 11 letters. Loop has 6 letters. [2025-03-09 06:58:20,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:58:20,217 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 45 transitions. [2025-03-09 06:58:20,218 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-09 06:58:20,218 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 39 transitions. [2025-03-09 06:58:20,218 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2025-03-09 06:58:20,218 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-03-09 06:58:20,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 39 transitions. [2025-03-09 06:58:20,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:58:20,218 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 39 transitions. [2025-03-09 06:58:20,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 39 transitions. [2025-03-09 06:58:20,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-09 06:58:20,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 26 states have internal predecessors, (39), 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-09 06:58:20,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 39 transitions. [2025-03-09 06:58:20,219 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 39 transitions. [2025-03-09 06:58:20,219 INFO L432 stractBuchiCegarLoop]: Abstraction has 27 states and 39 transitions. [2025-03-09 06:58:20,223 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-09 06:58:20,223 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 39 transitions. [2025-03-09 06:58:20,223 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-09 06:58:20,223 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:58:20,223 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:58:20,224 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:58:20,224 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-09 06:58:20,224 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-09 06:58:20,224 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-09 06:58:20,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:20,228 INFO L85 PathProgramCache]: Analyzing trace with hash 209029277, now seen corresponding path program 1 times [2025-03-09 06:58:20,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:20,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525027723] [2025-03-09 06:58:20,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:58:20,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:20,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 06:58:20,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 06:58:20,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:20,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:20,296 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-09 06:58:20,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:58:20,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525027723] [2025-03-09 06:58:20,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525027723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:58:20,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:58:20,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 06:58:20,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016667398] [2025-03-09 06:58:20,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:58:20,298 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:58:20,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:20,298 INFO L85 PathProgramCache]: Analyzing trace with hash 48, now seen corresponding path program 1 times [2025-03-09 06:58:20,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2025-03-09 06:58:20,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:20,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652305188] [2025-03-09 06:58:20,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:58:20,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:20,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-09 06:58:20,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-09 06:58:20,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:20,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:20,304 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:20,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-09 06:58:20,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-09 06:58:20,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:20,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:20,306 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:20,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:58:20,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:58:20,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:58:20,345 INFO L87 Difference]: Start difference. First operand 27 states and 39 transitions. cyclomatic complexity: 17 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-09 06:58:20,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:58:20,368 INFO L93 Difference]: Finished difference Result 32 states and 44 transitions. [2025-03-09 06:58:20,368 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 44 transitions. [2025-03-09 06:58:20,368 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-09 06:58:20,369 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 44 transitions. [2025-03-09 06:58:20,369 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2025-03-09 06:58:20,369 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2025-03-09 06:58:20,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 44 transitions. [2025-03-09 06:58:20,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:58:20,369 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 44 transitions. [2025-03-09 06:58:20,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 44 transitions. [2025-03-09 06:58:20,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2025-03-09 06:58:20,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 26 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-09 06:58:20,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2025-03-09 06:58:20,370 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 37 transitions. [2025-03-09 06:58:20,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:58:20,371 INFO L432 stractBuchiCegarLoop]: Abstraction has 27 states and 37 transitions. [2025-03-09 06:58:20,371 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-09 06:58:20,371 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 37 transitions. [2025-03-09 06:58:20,371 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-09 06:58:20,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:58:20,371 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:58:20,372 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:58:20,372 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-09 06:58:20,372 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-09 06:58:20,372 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-09 06:58:20,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:20,373 INFO L85 PathProgramCache]: Analyzing trace with hash -507524235, now seen corresponding path program 1 times [2025-03-09 06:58:20,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:20,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210692615] [2025-03-09 06:58:20,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:58:20,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:20,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 06:58:20,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 06:58:20,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:20,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:20,431 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-09 06:58:20,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:58:20,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210692615] [2025-03-09 06:58:20,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210692615] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:58:20,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768437571] [2025-03-09 06:58:20,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:58:20,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:58:20,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:20,433 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:58:20,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2025-03-09 06:58:20,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 06:58:20,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 06:58:20,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:20,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:20,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:58:20,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:20,519 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-09 06:58:20,520 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:58:20,545 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-09 06:58:20,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768437571] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:58:20,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:58:20,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-09 06:58:20,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229056774] [2025-03-09 06:58:20,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:58:20,546 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:58:20,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:20,546 INFO L85 PathProgramCache]: Analyzing trace with hash 48, now seen corresponding path program 2 times [2025-03-09 06:58:20,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:20,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145807142] [2025-03-09 06:58:20,546 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:58:20,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:20,548 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-03-09 06:58:20,549 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-09 06:58:20,549 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:58:20,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:20,549 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:20,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-09 06:58:20,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-09 06:58:20,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:20,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:20,551 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:20,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:58:20,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 06:58:20,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-03-09 06:58:20,589 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. cyclomatic complexity: 15 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-09 06:58:20,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:58:20,629 INFO L93 Difference]: Finished difference Result 40 states and 54 transitions. [2025-03-09 06:58:20,629 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 54 transitions. [2025-03-09 06:58:20,630 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-09 06:58:20,630 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 54 transitions. [2025-03-09 06:58:20,630 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2025-03-09 06:58:20,630 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2025-03-09 06:58:20,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 54 transitions. [2025-03-09 06:58:20,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:58:20,631 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 54 transitions. [2025-03-09 06:58:20,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 54 transitions. [2025-03-09 06:58:20,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 30. [2025-03-09 06:58:20,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 29 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:58:20,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. [2025-03-09 06:58:20,632 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 41 transitions. [2025-03-09 06:58:20,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:58:20,633 INFO L432 stractBuchiCegarLoop]: Abstraction has 30 states and 41 transitions. [2025-03-09 06:58:20,633 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-09 06:58:20,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 41 transitions. [2025-03-09 06:58:20,634 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-09 06:58:20,635 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:58:20,635 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:58:20,635 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:58:20,635 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-09 06:58:20,635 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-09 06:58:20,636 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-09 06:58:20,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:20,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1365739107, now seen corresponding path program 2 times [2025-03-09 06:58:20,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:20,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203163359] [2025-03-09 06:58:20,636 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:58:20,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:20,641 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-09 06:58:20,668 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 06:58:20,668 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:58:20,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:21,070 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-09 06:58:21,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:58:21,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203163359] [2025-03-09 06:58:21,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203163359] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:58:21,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803739608] [2025-03-09 06:58:21,070 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:58:21,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:58:21,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:21,072 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:58:21,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2025-03-09 06:58:21,112 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-09 06:58:21,130 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 06:58:21,130 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:58:21,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:21,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-09 06:58:21,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:21,198 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-09 06:58:21,227 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-09 06:58:21,227 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:58:21,293 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2025-03-09 06:58:21,293 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-09 06:58:21,342 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-09 06:58:21,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803739608] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:58:21,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:58:21,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2025-03-09 06:58:21,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593566461] [2025-03-09 06:58:21,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:58:21,343 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:58:21,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:21,344 INFO L85 PathProgramCache]: Analyzing trace with hash 48, now seen corresponding path program 3 times [2025-03-09 06:58:21,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:21,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764609911] [2025-03-09 06:58:21,344 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:58:21,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:21,346 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1 statements into 1 equivalence classes. [2025-03-09 06:58:21,347 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-09 06:58:21,347 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 06:58:21,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:21,347 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:21,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-09 06:58:21,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-09 06:58:21,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:21,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:21,349 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:21,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:58:21,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 06:58:21,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-03-09 06:58:21,387 INFO L87 Difference]: Start difference. First operand 30 states and 41 transitions. cyclomatic complexity: 16 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-09 06:58:21,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:58:21,579 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2025-03-09 06:58:21,580 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 68 transitions. [2025-03-09 06:58:21,580 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-09 06:58:21,580 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 50 states and 68 transitions. [2025-03-09 06:58:21,580 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2025-03-09 06:58:21,580 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2025-03-09 06:58:21,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 68 transitions. [2025-03-09 06:58:21,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:58:21,581 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 68 transitions. [2025-03-09 06:58:21,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 68 transitions. [2025-03-09 06:58:21,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 30. [2025-03-09 06:58:21,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 29 states have internal predecessors, (40), 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-09 06:58:21,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2025-03-09 06:58:21,582 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 40 transitions. [2025-03-09 06:58:21,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 06:58:21,585 INFO L432 stractBuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2025-03-09 06:58:21,585 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-09 06:58:21,585 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 40 transitions. [2025-03-09 06:58:21,585 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-09 06:58:21,585 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:58:21,585 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:58:21,585 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:58:21,585 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-09 06:58:21,585 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-09 06:58:21,585 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-09 06:58:21,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:21,586 INFO L85 PathProgramCache]: Analyzing trace with hash 2041724508, now seen corresponding path program 1 times [2025-03-09 06:58:21,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:21,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220448126] [2025-03-09 06:58:21,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:58:21,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:21,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 06:58:21,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 06:58:21,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:21,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:21,621 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:21,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 06:58:21,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 06:58:21,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:21,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:21,636 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:21,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:21,637 INFO L85 PathProgramCache]: Analyzing trace with hash 48, now seen corresponding path program 4 times [2025-03-09 06:58:21,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:21,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972230782] [2025-03-09 06:58:21,637 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:58:21,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:21,640 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1 statements into 2 equivalence classes. [2025-03-09 06:58:21,642 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 1 of 1 statements. [2025-03-09 06:58:21,642 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:58:21,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:21,642 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:21,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-09 06:58:21,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-09 06:58:21,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:21,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:21,644 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:21,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:21,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1131049675, now seen corresponding path program 1 times [2025-03-09 06:58:21,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:21,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020943096] [2025-03-09 06:58:21,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:58:21,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:21,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 06:58:21,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 06:58:21,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:21,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:21,663 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:21,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 06:58:21,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 06:58:21,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:21,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:21,686 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:23,352 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:58:23,352 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:58:23,352 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:58:23,352 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:58:23,352 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:58:23,352 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:23,352 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:58:23,352 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:58:23,352 INFO L132 ssoRankerPreferences]: Filename of dumped script: sep.i_Iteration9_Lasso [2025-03-09 06:58:23,352 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:58:23,352 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:58:23,353 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:23,358 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:23,363 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:23,365 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:23,366 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:23,367 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:23,369 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:23,371 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:23,372 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:23,373 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:23,375 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:23,377 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:23,551 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:23,552 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:23,559 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:23,560 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:23,561 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:23,562 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:23,565 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:23,566 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:23,567 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:23,568 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:23,569 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:23,609 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:23,610 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:23,612 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:23,613 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:23,848 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:58:23,849 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:58:23,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:23,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:23,851 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-09 06:58:23,851 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-09 06:58:23,853 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-09 06:58:23,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:23,862 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:23,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:23,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:23,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:23,862 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:23,862 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:23,863 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:23,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2025-03-09 06:58:23,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:23,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:23,870 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-09 06:58:23,870 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-09 06:58:23,871 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:23,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:23,880 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:23,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:23,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:23,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:23,881 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:23,881 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:23,882 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:23,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2025-03-09 06:58:23,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:23,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:23,889 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-09 06:58:23,889 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-09 06:58:23,890 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-09 06:58:23,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:23,900 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:23,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:23,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:23,900 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:23,900 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:23,900 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:23,901 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:23,906 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-09 06:58:23,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:23,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:23,908 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-09 06:58:23,908 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-09 06:58:23,909 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-09 06:58:23,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:23,919 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:23,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:23,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:23,919 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:23,919 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:23,919 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:23,920 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:23,925 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-09 06:58:23,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:23,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:23,927 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-09 06:58:23,928 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-09 06:58:23,929 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-09 06:58:23,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:23,938 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:23,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:23,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:23,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:23,938 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:23,938 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:23,939 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:23,944 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-09 06:58:23,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:23,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:23,946 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-09 06:58:23,947 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-09 06:58:23,948 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:23,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:23,957 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:23,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:23,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:23,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:23,957 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:23,957 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:23,958 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:23,963 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-09 06:58:23,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:23,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:23,965 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-09 06:58:23,966 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-09 06:58:23,967 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:23,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:23,976 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:23,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:23,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:23,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:23,976 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:23,976 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:23,977 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:23,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2025-03-09 06:58:23,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:23,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:23,984 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-09 06:58:23,985 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-09 06:58:23,986 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-09 06:58:23,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:23,996 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:23,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:23,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:23,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:23,996 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:23,996 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:23,997 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:24,002 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-09 06:58:24,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:24,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:24,004 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-09 06:58:24,004 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-09 06:58:24,005 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-09 06:58:24,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:24,015 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:24,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:24,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:24,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:24,015 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:24,015 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:24,016 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:24,021 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-09 06:58:24,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:24,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:24,023 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-09 06:58:24,023 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-09 06:58:24,024 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-09 06:58:24,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:24,034 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:24,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:24,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:24,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:24,034 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:24,034 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:24,035 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:24,040 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-09 06:58:24,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:24,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:24,042 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-09 06:58:24,042 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-09 06:58:24,043 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:24,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:24,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:24,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:24,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:24,053 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:24,053 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:24,055 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:24,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2025-03-09 06:58:24,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:24,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:24,062 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-09 06:58:24,062 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-09 06:58:24,063 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-09 06:58:24,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:24,073 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:24,073 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:24,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:24,074 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:24,074 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:24,077 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:24,082 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-09 06:58:24,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:24,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:24,084 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-09 06:58:24,085 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-09 06:58:24,085 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-09 06:58:24,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:24,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:24,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:24,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:24,096 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:24,096 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:24,098 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:24,104 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-09 06:58:24,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:24,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:24,106 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-09 06:58:24,107 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-09 06:58:24,108 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:24,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:24,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:24,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:24,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:24,120 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:24,120 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:24,124 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:24,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2025-03-09 06:58:24,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:24,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:24,132 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-09 06:58:24,133 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-09 06:58:24,135 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-09 06:58:24,144 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:24,144 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:24,144 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:24,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:24,146 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:24,146 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:24,148 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:24,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2025-03-09 06:58:24,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:24,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:24,158 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-09 06:58:24,160 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-09 06:58:24,160 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-09 06:58:24,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:24,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:24,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:24,170 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:24,171 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:24,171 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:24,174 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:24,179 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-09 06:58:24,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:24,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:24,182 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-09 06:58:24,183 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-09 06:58:24,184 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-09 06:58:24,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:24,193 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:24,193 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:24,193 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:24,195 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:24,195 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:24,198 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:24,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2025-03-09 06:58:24,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:24,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:24,205 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-09 06:58:24,206 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-09 06:58:24,207 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-09 06:58:24,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:24,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:24,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:24,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:24,218 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:24,218 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:24,220 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:24,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2025-03-09 06:58:24,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:24,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:24,228 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-09 06:58:24,229 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-09 06:58:24,233 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:24,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:24,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:24,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:24,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:24,243 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:24,243 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:24,244 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:24,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2025-03-09 06:58:24,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:24,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:24,252 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-09 06:58:24,253 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-09 06:58:24,254 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-09 06:58:24,263 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:24,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:24,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:24,263 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:24,264 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:24,264 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:24,266 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:24,271 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-09 06:58:24,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:24,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:24,273 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-09 06:58:24,273 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-09 06:58:24,274 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-09 06:58:24,283 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:24,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:24,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:24,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:24,285 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:24,285 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:24,287 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:24,292 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-09 06:58:24,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:24,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:24,294 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-09 06:58:24,295 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-09 06:58:24,296 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-09 06:58:24,305 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:24,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:24,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:24,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:24,307 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:24,307 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:24,313 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:58:24,319 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-03-09 06:58:24,319 INFO L444 ModelExtractionUtils]: 5 out of 16 variables were initially zero. Simplification set additionally 8 variables to zero. [2025-03-09 06:58:24,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:24,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:24,321 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-09 06:58:24,321 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-09 06:58:24,322 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:58:24,332 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:58:24,332 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:58:24,332 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-09 06:58:24,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2025-03-09 06:58:24,342 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2025-03-09 06:58:24,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:24,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 06:58:24,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 06:58:24,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:24,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:24,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:58:24,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:24,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-09 06:58:24,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-09 06:58:24,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:24,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:24,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:58:24,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:24,402 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-09 06:58:24,402 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-09 06:58:24,402 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 40 transitions. cyclomatic complexity: 15 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-09 06:58:24,408 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 40 transitions. cyclomatic complexity: 15. 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 32 states and 43 transitions. Complement of second has 3 states. [2025-03-09 06:58:24,408 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-09 06:58:24,408 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-09 06:58:24,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 16 transitions. [2025-03-09 06:58:24,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 16 transitions. Stem has 19 letters. Loop has 1 letters. [2025-03-09 06:58:24,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:58:24,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 16 transitions. Stem has 20 letters. Loop has 1 letters. [2025-03-09 06:58:24,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:58:24,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 16 transitions. Stem has 19 letters. Loop has 2 letters. [2025-03-09 06:58:24,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:58:24,409 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 43 transitions. [2025-03-09 06:58:24,409 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-09 06:58:24,409 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 43 transitions. [2025-03-09 06:58:24,409 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-03-09 06:58:24,410 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2025-03-09 06:58:24,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 43 transitions. [2025-03-09 06:58:24,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:58:24,410 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 43 transitions. [2025-03-09 06:58:24,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 43 transitions. [2025-03-09 06:58:24,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2025-03-09 06:58:24,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 30 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:58:24,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2025-03-09 06:58:24,411 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 42 transitions. [2025-03-09 06:58:24,411 INFO L432 stractBuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2025-03-09 06:58:24,411 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-09 06:58:24,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 42 transitions. [2025-03-09 06:58:24,411 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-09 06:58:24,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:58:24,411 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:58:24,411 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:58:24,411 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 06:58:24,412 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-09 06:58:24,412 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-09 06:58:24,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:24,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1131049676, now seen corresponding path program 1 times [2025-03-09 06:58:24,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:24,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273802783] [2025-03-09 06:58:24,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:58:24,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:24,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 06:58:24,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 06:58:24,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:24,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:24,451 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-09 06:58:24,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:58:24,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273802783] [2025-03-09 06:58:24,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273802783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:58:24,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:58:24,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:58:24,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008092440] [2025-03-09 06:58:24,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:58:24,452 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:58:24,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:24,453 INFO L85 PathProgramCache]: Analyzing trace with hash 44621, now seen corresponding path program 1 times [2025-03-09 06:58:24,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:24,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671611428] [2025-03-09 06:58:24,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:58:24,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:24,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:58:24,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:58:24,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:24,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:24,457 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:24,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:58:24,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:58:24,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:24,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:24,461 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:24,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:58:24,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:58:24,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:58:24,498 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. cyclomatic complexity: 16 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-09 06:58:24,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:58:24,510 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2025-03-09 06:58:24,510 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 41 transitions. [2025-03-09 06:58:24,510 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-09 06:58:24,511 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 41 transitions. [2025-03-09 06:58:24,511 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-03-09 06:58:24,511 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-03-09 06:58:24,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 41 transitions. [2025-03-09 06:58:24,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:58:24,512 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 41 transitions. [2025-03-09 06:58:24,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 41 transitions. [2025-03-09 06:58:24,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-09 06:58:24,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 30 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:58:24,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2025-03-09 06:58:24,514 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 41 transitions. [2025-03-09 06:58:24,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:58:24,515 INFO L432 stractBuchiCegarLoop]: Abstraction has 31 states and 41 transitions. [2025-03-09 06:58:24,515 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-09 06:58:24,515 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 41 transitions. [2025-03-09 06:58:24,515 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-09 06:58:24,515 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:58:24,515 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:58:24,515 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-09 06:58:24,515 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 06:58:24,515 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-09 06:58:24,515 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-09 06:58:24,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:24,517 INFO L85 PathProgramCache]: Analyzing trace with hash -702801541, now seen corresponding path program 1 times [2025-03-09 06:58:24,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:24,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939555586] [2025-03-09 06:58:24,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:58:24,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:24,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 06:58:24,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 06:58:24,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:24,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:24,544 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:24,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 06:58:24,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 06:58:24,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:24,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:24,562 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:24,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:24,564 INFO L85 PathProgramCache]: Analyzing trace with hash 44621, now seen corresponding path program 2 times [2025-03-09 06:58:24,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:24,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843056627] [2025-03-09 06:58:24,564 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:58:24,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:24,566 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:58:24,567 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:58:24,567 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:58:24,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:24,567 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:24,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:58:24,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:58:24,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:24,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:24,570 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:24,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:24,570 INFO L85 PathProgramCache]: Analyzing trace with hash 804874899, now seen corresponding path program 1 times [2025-03-09 06:58:24,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:24,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792611357] [2025-03-09 06:58:24,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:58:24,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:24,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 06:58:24,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 06:58:24,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:24,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:24,634 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-09 06:58:25,150 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-09 06:58:25,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:58:25,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792611357] [2025-03-09 06:58:25,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792611357] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:58:25,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428866172] [2025-03-09 06:58:25,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:58:25,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:58:25,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:25,153 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:58:25,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2025-03-09 06:58:25,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 06:58:25,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 06:58:25,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:25,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:25,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-09 06:58:25,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:25,268 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-09 06:58:25,385 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-09 06:58:25,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:58:25,431 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2025-03-09 06:58:25,431 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-09 06:58:25,442 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-09 06:58:25,462 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-09 06:58:25,462 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:58:25,734 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-09 06:58:25,775 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-09 06:58:25,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428866172] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:58:25,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:58:25,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 26 [2025-03-09 06:58:25,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30559008] [2025-03-09 06:58:25,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:58:25,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:58:25,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-09 06:58:25,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2025-03-09 06:58:25,812 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. cyclomatic complexity: 15 Second operand has 26 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 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-09 06:58:26,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:58:26,639 INFO L93 Difference]: Finished difference Result 84 states and 109 transitions. [2025-03-09 06:58:26,639 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 109 transitions. [2025-03-09 06:58:26,639 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-09 06:58:26,640 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 84 states and 109 transitions. [2025-03-09 06:58:26,640 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2025-03-09 06:58:26,640 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2025-03-09 06:58:26,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 109 transitions. [2025-03-09 06:58:26,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:58:26,640 INFO L218 hiAutomatonCegarLoop]: Abstraction has 84 states and 109 transitions. [2025-03-09 06:58:26,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 109 transitions. [2025-03-09 06:58:26,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 58. [2025-03-09 06:58:26,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 1.3275862068965518) internal successors, (77), 57 states have internal predecessors, (77), 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-09 06:58:26,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 77 transitions. [2025-03-09 06:58:26,642 INFO L240 hiAutomatonCegarLoop]: Abstraction has 58 states and 77 transitions. [2025-03-09 06:58:26,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-09 06:58:26,646 INFO L432 stractBuchiCegarLoop]: Abstraction has 58 states and 77 transitions. [2025-03-09 06:58:26,646 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-03-09 06:58:26,646 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 77 transitions. [2025-03-09 06:58:26,647 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-09 06:58:26,647 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:58:26,647 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:58:26,647 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:58:26,647 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 06:58:26,647 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-09 06:58:26,647 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-09 06:58:26,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:26,647 INFO L85 PathProgramCache]: Analyzing trace with hash -2084740389, now seen corresponding path program 1 times [2025-03-09 06:58:26,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:26,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146783354] [2025-03-09 06:58:26,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:58:26,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:26,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 06:58:26,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 06:58:26,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:26,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:26,670 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:26,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 06:58:26,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 06:58:26,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:26,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:26,689 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:26,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:26,690 INFO L85 PathProgramCache]: Analyzing trace with hash 44621, now seen corresponding path program 3 times [2025-03-09 06:58:26,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:26,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518072684] [2025-03-09 06:58:26,690 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:58:26,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:26,692 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:58:26,693 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:58:26,693 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 06:58:26,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:26,693 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:26,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:58:26,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:58:26,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:26,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:26,695 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:26,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:26,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1273813709, now seen corresponding path program 1 times [2025-03-09 06:58:26,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:58:26,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486589512] [2025-03-09 06:58:26,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:58:26,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:58:26,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 06:58:26,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 06:58:26,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:26,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:26,719 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:58:26,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 06:58:26,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 06:58:26,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:26,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:58:26,745 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:58:28,120 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:58:28,120 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:58:28,120 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:58:28,120 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:58:28,120 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:58:28,121 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:28,121 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:58:28,121 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:58:28,121 INFO L132 ssoRankerPreferences]: Filename of dumped script: sep.i_Iteration12_Lasso [2025-03-09 06:58:28,121 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:58:28,121 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:58:28,122 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:28,123 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:28,124 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:28,126 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:28,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:28,252 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:28,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:28,259 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:28,264 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:28,267 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:28,268 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:28,269 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:28,301 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:28,302 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:28,303 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:28,304 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:28,306 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:28,307 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:28,308 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:28,309 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:28,310 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:28,311 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:28,312 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:28,314 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:28,315 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:28,316 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:28,317 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:58:28,550 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:58:28,550 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:58:28,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:28,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:28,552 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-09 06:58:28,553 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-09 06:58:28,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-09 06:58:28,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:28,564 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:28,564 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:28,564 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:28,564 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:28,564 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:28,564 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:28,565 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:28,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2025-03-09 06:58:28,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:28,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:28,572 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-09 06:58:28,574 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-09 06:58:28,574 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:28,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:28,584 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:28,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:28,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:28,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:28,584 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:28,584 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:28,585 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:28,590 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-09 06:58:28,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:28,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:28,592 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-09 06:58:28,593 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-09 06:58:28,594 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-09 06:58:28,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:28,603 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:58:28,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:28,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:28,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:28,604 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:58:28,604 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:58:28,605 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:28,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2025-03-09 06:58:28,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:28,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:28,611 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-09 06:58:28,612 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-09 06:58:28,613 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:58:28,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:28,623 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:28,623 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:28,623 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:28,624 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:28,624 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:28,627 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:58:28,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2025-03-09 06:58:28,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:28,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:28,635 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-09 06:58:28,636 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-09 06:58:28,638 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-09 06:58:28,648 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:58:28,648 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:58:28,648 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:58:28,648 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:58:28,654 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:58:28,654 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:58:28,661 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:58:28,674 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2025-03-09 06:58:28,674 INFO L444 ModelExtractionUtils]: 4 out of 19 variables were initially zero. Simplification set additionally 12 variables to zero. [2025-03-09 06:58:28,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:58:28,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:58:28,677 INFO L229 MonitoredProcess]: Starting monitored process 76 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-09 06:58:28,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2025-03-09 06:58:28,678 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:58:28,689 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:58:28,689 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:58:28,689 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-09 06:58:28,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2025-03-09 06:58:28,710 INFO L156 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2025-03-09 06:58:28,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:58:28,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 06:58:28,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 06:58:28,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:28,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:28,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:58:28,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:28,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:58:28,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:58:28,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:58:28,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:58:28,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:58:28,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:58:28,775 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-09 06:58:28,775 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-09 06:58:28,776 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 77 transitions. cyclomatic complexity: 28 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-09 06:58:28,785 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 77 transitions. cyclomatic complexity: 28. 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 62 states and 84 transitions. Complement of second has 4 states. [2025-03-09 06:58:28,786 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-09 06:58:28,786 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-09 06:58:28,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2025-03-09 06:58:28,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 21 letters. Loop has 3 letters. [2025-03-09 06:58:28,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:58:28,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 24 letters. Loop has 3 letters. [2025-03-09 06:58:28,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:58:28,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 21 letters. Loop has 6 letters. [2025-03-09 06:58:28,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:58:28,788 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 84 transitions. [2025-03-09 06:58:28,788 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-09 06:58:28,788 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 0 states and 0 transitions. [2025-03-09 06:58:28,789 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-09 06:58:28,789 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-09 06:58:28,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-09 06:58:28,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:58:28,789 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 06:58:28,789 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 06:58:28,789 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 06:58:28,789 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-03-09 06:58:28,789 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-09 06:58:28,789 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-09 06:58:28,789 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-09 06:58:28,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.03 06:58:28 BoogieIcfgContainer [2025-03-09 06:58:28,794 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-09 06:58:28,795 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 06:58:28,795 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 06:58:28,795 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 06:58:28,795 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:58:14" (3/4) ... [2025-03-09 06:58:28,796 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 06:58:28,797 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 06:58:28,798 INFO L158 Benchmark]: Toolchain (without parser) took 14749.67ms. Allocated memory was 142.6MB in the beginning and 276.8MB in the end (delta: 134.2MB). Free memory was 112.0MB in the beginning and 124.4MB in the end (delta: -12.5MB). Peak memory consumption was 120.9MB. Max. memory is 16.1GB. [2025-03-09 06:58:28,798 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:58:28,799 INFO L158 Benchmark]: CACSL2BoogieTranslator took 182.29ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 100.3MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 06:58:28,800 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.23ms. Allocated memory is still 142.6MB. Free memory was 100.3MB in the beginning and 99.0MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 06:58:28,800 INFO L158 Benchmark]: Boogie Preprocessor took 26.06ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 97.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:58:28,800 INFO L158 Benchmark]: IcfgBuilder took 284.83ms. Allocated memory is still 142.6MB. Free memory was 97.2MB in the beginning and 80.9MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 06:58:28,801 INFO L158 Benchmark]: BuchiAutomizer took 14217.85ms. Allocated memory was 142.6MB in the beginning and 276.8MB in the end (delta: 134.2MB). Free memory was 80.9MB in the beginning and 124.5MB in the end (delta: -43.6MB). Peak memory consumption was 87.3MB. Max. memory is 16.1GB. [2025-03-09 06:58:28,801 INFO L158 Benchmark]: Witness Printer took 2.52ms. Allocated memory is still 276.8MB. Free memory was 124.5MB in the beginning and 124.4MB in the end (delta: 54.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:58:28,802 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.14ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 182.29ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 100.3MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.23ms. Allocated memory is still 142.6MB. Free memory was 100.3MB in the beginning and 99.0MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.06ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 97.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 284.83ms. Allocated memory is still 142.6MB. Free memory was 97.2MB in the beginning and 80.9MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 14217.85ms. Allocated memory was 142.6MB in the beginning and 276.8MB in the end (delta: 134.2MB). Free memory was 80.9MB in the beginning and 124.5MB in the end (delta: -43.6MB). Peak memory consumption was 87.3MB. Max. memory is 16.1GB. * Witness Printer took 2.52ms. Allocated memory is still 276.8MB. Free memory was 124.5MB in the beginning and 124.4MB in the end (delta: 54.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~x!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (8 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 3 locations. One deterministic module has affine ranking function null and consists of 3 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 26 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 14.1s and 13 iterations. TraceHistogramMax:2. Analysis of lassos took 12.1s. Construction of modules took 0.8s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 12. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 90 StatesRemovedByMinimization, 8 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 [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 424 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 422 mSDsluCounter, 461 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 283 mSDsCounter, 104 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1493 IncrementalHoareTripleChecker+Invalid, 1597 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 104 mSolverCounterUnsat, 178 mSDtfsCounter, 1493 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU6 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital225 mio100 ax100 hnf100 lsp69 ukn76 mio100 lsp38 div174 bol100 ite100 ukn100 eq151 hnf94 smp64 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 21ms 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-09 06:58:28,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2025-03-09 06:58:29,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Forceful destruction successful, exit code 0 [2025-03-09 06:58:29,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2025-03-09 06:58:29,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2025-03-09 06:58:29,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-03-09 06:58:29,820 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-09 06:58:30,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE