./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-bwb/or-01.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-bwb/or-01.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash 7f247e4473503f47ee3194e296d6b905e51586799395e11124f119da43a61cc2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:33:26,231 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:33:26,293 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-04 15:33:26,298 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:33:26,298 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:33:26,298 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 15:33:26,318 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:33:26,319 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:33:26,319 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:33:26,319 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:33:26,320 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:33:26,320 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:33:26,321 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:33:26,321 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:33:26,321 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 15:33:26,321 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 15:33:26,321 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 15:33:26,321 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 15:33:26,321 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 15:33:26,322 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 15:33:26,322 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:33:26,322 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 15:33:26,322 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:33:26,322 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:33:26,322 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 15:33:26,322 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 15:33:26,322 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 15:33:26,322 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:33:26,322 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:33:26,322 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 15:33:26,323 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:33:26,323 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:33:26,323 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:33:26,323 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:33:26,323 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:33:26,323 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:33:26,323 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 15:33:26,324 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7f247e4473503f47ee3194e296d6b905e51586799395e11124f119da43a61cc2 [2025-03-04 15:33:26,562 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:33:26,570 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:33:26,572 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:33:26,573 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:33:26,573 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:33:26,575 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-bwb/or-01.c [2025-03-04 15:33:27,718 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78ae4b90a/b5ff2b798a5b483f8a2779717a021364/FLAGfd7424817 [2025-03-04 15:33:27,936 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:33:27,939 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-bwb/or-01.c [2025-03-04 15:33:27,945 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78ae4b90a/b5ff2b798a5b483f8a2779717a021364/FLAGfd7424817 [2025-03-04 15:33:28,286 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78ae4b90a/b5ff2b798a5b483f8a2779717a021364 [2025-03-04 15:33:28,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:33:28,288 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:33:28,289 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:33:28,289 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:33:28,293 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:33:28,294 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:33:28" (1/1) ... [2025-03-04 15:33:28,295 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22ce3f45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:28, skipping insertion in model container [2025-03-04 15:33:28,295 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:33:28" (1/1) ... [2025-03-04 15:33:28,303 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:33:28,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:33:28,392 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:33:28,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:33:28,408 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:33:28,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:28 WrapperNode [2025-03-04 15:33:28,409 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:33:28,410 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:33:28,410 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:33:28,410 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:33:28,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:28" (1/1) ... [2025-03-04 15:33:28,422 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:28" (1/1) ... [2025-03-04 15:33:28,434 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 26 [2025-03-04 15:33:28,434 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:33:28,435 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:33:28,435 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:33:28,435 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:33:28,442 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:28" (1/1) ... [2025-03-04 15:33:28,442 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:28" (1/1) ... [2025-03-04 15:33:28,444 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:28" (1/1) ... [2025-03-04 15:33:28,449 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-04 15:33:28,452 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:28" (1/1) ... [2025-03-04 15:33:28,452 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:28" (1/1) ... [2025-03-04 15:33:28,454 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:28" (1/1) ... [2025-03-04 15:33:28,454 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:28" (1/1) ... [2025-03-04 15:33:28,455 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:28" (1/1) ... [2025-03-04 15:33:28,455 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:28" (1/1) ... [2025-03-04 15:33:28,458 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:33:28,459 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:33:28,459 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:33:28,459 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:33:28,460 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:28" (1/1) ... [2025-03-04 15:33:28,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:28,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:28,495 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:28,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-04 15:33:28,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:33:28,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:33:28,555 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:33:28,557 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:33:28,642 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-04 15:33:28,643 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:33:28,658 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:33:28,658 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:33:28,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:33:28 BoogieIcfgContainer [2025-03-04 15:33:28,658 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:33:28,659 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 15:33:28,660 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 15:33:28,663 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 15:33:28,664 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:33:28,664 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 03:33:28" (1/3) ... [2025-03-04 15:33:28,665 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6df286b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:33:28, skipping insertion in model container [2025-03-04 15:33:28,665 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:33:28,665 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:28" (2/3) ... [2025-03-04 15:33:28,665 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6df286b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:33:28, skipping insertion in model container [2025-03-04 15:33:28,665 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:33:28,666 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:33:28" (3/3) ... [2025-03-04 15:33:28,667 INFO L363 chiAutomizerObserver]: Analyzing ICFG or-01.c [2025-03-04 15:33:28,710 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 15:33:28,711 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 15:33:28,711 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 15:33:28,711 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 15:33:28,711 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 15:33:28,712 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 15:33:28,712 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 15:33:28,712 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 15:33:28,716 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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-04 15:33:28,728 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-04 15:33:28,729 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:33:28,729 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:33:28,733 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:33:28,733 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:33:28,733 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 15:33:28,734 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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-04 15:33:28,735 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-04 15:33:28,735 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:33:28,735 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:33:28,735 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:33:28,735 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:33:28,740 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~post1#1, main_#t~bitwise2#1, main_~a~0#1, main_~b~0#1, main_~x~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~x~0#1;main_~a~0#1 := 16;main_~b~0#1 := 30;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;" [2025-03-04 15:33:28,740 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume 0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1;main_#t~bitwise2#1 := main_~a~0#1;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" [2025-03-04 15:33:28,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:28,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1344, now seen corresponding path program 1 times [2025-03-04 15:33:28,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:28,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775505931] [2025-03-04 15:33:28,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:33:28,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:28,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:33:28,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:33:28,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:28,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:28,803 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:28,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:33:28,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:33:28,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:28,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:28,816 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:28,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:28,818 INFO L85 PathProgramCache]: Analyzing trace with hash 39528, now seen corresponding path program 1 times [2025-03-04 15:33:28,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:28,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653821114] [2025-03-04 15:33:28,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:33:28,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:28,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:33:28,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:33:28,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:28,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:28,831 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:28,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:33:28,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:33:28,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:28,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:28,839 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:28,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:28,841 INFO L85 PathProgramCache]: Analyzing trace with hash 40048841, now seen corresponding path program 1 times [2025-03-04 15:33:28,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:28,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474614470] [2025-03-04 15:33:28,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:33:28,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:28,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:33:28,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:33:28,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:28,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:28,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:33:28,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:33:28,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474614470] [2025-03-04 15:33:28,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474614470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:33:28,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:33:28,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:33:28,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599321193] [2025-03-04 15:33:28,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:33:29,055 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:33:29,055 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:33:29,056 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:33:29,056 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:33:29,056 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:33:29,056 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:29,056 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:33:29,056 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:33:29,056 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-01.c_Iteration1_Loop [2025-03-04 15:33:29,056 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:33:29,056 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:33:29,066 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:29,071 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:29,074 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:29,178 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:33:29,183 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:33:29,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:29,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:29,186 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:29,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-04 15:33:29,189 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:33:29,189 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:29,203 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:33:29,204 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post1#1=0} Honda state: {ULTIMATE.start_main_#t~post1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:33:29,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-03-04 15:33:29,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:29,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:29,212 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:29,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-04 15:33:29,215 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:33:29,215 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:29,228 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:33:29,228 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~bitwise2#1=0} Honda state: {ULTIMATE.start_main_#t~bitwise2#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:33:29,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:29,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:29,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:29,238 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:29,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-04 15:33:29,242 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:33:29,242 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:29,262 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-04 15:33:29,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:29,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:29,265 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:29,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-04 15:33:29,268 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:33:29,268 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:29,534 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:33:29,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-03-04 15:33:29,543 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:33:29,543 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:33:29,543 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:33:29,544 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:33:29,544 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:33:29,544 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:29,544 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:33:29,544 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:33:29,544 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-01.c_Iteration1_Loop [2025-03-04 15:33:29,544 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:33:29,544 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:33:29,546 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:29,548 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:29,551 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:29,651 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:33:29,654 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:33:29,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:29,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:29,656 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:29,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-04 15:33:29,659 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:29,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:29,670 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:33:29,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:29,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:29,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:29,674 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:33:29,674 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:33:29,675 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:29,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:29,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:29,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:29,683 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:29,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-04 15:33:29,685 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:29,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:29,695 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:33:29,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:29,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:29,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:29,696 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:33:29,696 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:33:29,697 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:29,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:29,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:29,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:29,704 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:29,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-04 15:33:29,706 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:29,716 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:29,716 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:33:29,717 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:29,717 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-04 15:33:29,717 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:29,721 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-04 15:33:29,721 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:33:29,727 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:29,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:29,736 INFO L451 LassoAnalysis]: Using template '2-nested'. [2025-03-04 15:33:29,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:29,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:29,739 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:29,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-04 15:33:29,740 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:29,751 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:29,751 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:33:29,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:29,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:29,751 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-03-04 15:33:29,753 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-03-04 15:33:29,753 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:33:29,755 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:29,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-03-04 15:33:29,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:29,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:29,763 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:29,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-04 15:33:29,771 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:29,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:29,782 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:33:29,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:29,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:29,782 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-03-04 15:33:29,783 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-03-04 15:33:29,783 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:33:29,784 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:29,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-03-04 15:33:29,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:29,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:29,791 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:29,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-04 15:33:29,793 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:29,803 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:29,803 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:33:29,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:29,803 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-04 15:33:29,803 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-03-04 15:33:29,808 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:29,809 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:33:29,814 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:33:29,818 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:33:29,820 INFO L444 ModelExtractionUtils]: 6 out of 9 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:33:29,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:29,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:29,823 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:29,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-03-04 15:33:29,825 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:33:29,825 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:33:29,825 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:33:29,826 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function 2-nested ranking function: f0 = -1*ULTIMATE.start_main_~a~0#1 f1 = 1*ULTIMATE.start_main_~x~0#1 Supporting invariants [] [2025-03-04 15:33:29,831 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-04 15:33:29,834 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:33:29,838 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: IfThenElseExpression [2025-03-04 15:33:29,839 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: IfThenElseExpression [2025-03-04 15:33:29,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:29,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:33:29,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:33:29,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:29,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:29,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:33:29,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:29,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:33:29,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:33:29,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:29,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:29,881 WARN L254 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 15:33:29,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:30,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:33:30,055 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-04 15:33:30,057 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:30,155 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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). Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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) Result 25 states and 33 transitions. Complement of second has 9 states. [2025-03-04 15:33:30,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-03-04 15:33:30,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:30,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 9 transitions. [2025-03-04 15:33:30,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 2 letters. Loop has 3 letters. [2025-03-04 15:33:30,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:30,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 5 letters. Loop has 3 letters. [2025-03-04 15:33:30,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:30,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 2 letters. Loop has 6 letters. [2025-03-04 15:33:30,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:30,167 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 33 transitions. [2025-03-04 15:33:30,167 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-04 15:33:30,169 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 18 states and 23 transitions. [2025-03-04 15:33:30,169 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-03-04 15:33:30,170 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2025-03-04 15:33:30,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2025-03-04 15:33:30,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:33:30,170 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 23 transitions. [2025-03-04 15:33:30,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2025-03-04 15:33:30,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 14. [2025-03-04 15:33:30,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:30,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2025-03-04 15:33:30,188 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions. [2025-03-04 15:33:30,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:33:30,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:33:30,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:33:30,189 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:30,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:33:30,206 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2025-03-04 15:33:30,206 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2025-03-04 15:33:30,207 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-04 15:33:30,208 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 16 transitions. [2025-03-04 15:33:30,208 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2025-03-04 15:33:30,208 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-03-04 15:33:30,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2025-03-04 15:33:30,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:33:30,208 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 16 transitions. [2025-03-04 15:33:30,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2025-03-04 15:33:30,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2025-03-04 15:33:30,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:30,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2025-03-04 15:33:30,209 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 15 transitions. [2025-03-04 15:33:30,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:33:30,210 INFO L432 stractBuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2025-03-04 15:33:30,210 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 15:33:30,210 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2025-03-04 15:33:30,211 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-04 15:33:30,211 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:33:30,211 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:33:30,211 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-04 15:33:30,211 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:33:30,211 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~post1#1, main_#t~bitwise2#1, main_~a~0#1, main_~b~0#1, main_~x~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~x~0#1;main_~a~0#1 := 16;main_~b~0#1 := 30;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume 0 == main_~a~0#1;main_#t~bitwise2#1 := main_~b~0#1;" [2025-03-04 15:33:30,211 INFO L754 eck$LassoCheckResult]: Loop: "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume 0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1;main_#t~bitwise2#1 := main_~a~0#1;" [2025-03-04 15:33:30,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:30,211 INFO L85 PathProgramCache]: Analyzing trace with hash 40048998, now seen corresponding path program 1 times [2025-03-04 15:33:30,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:30,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321953736] [2025-03-04 15:33:30,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:33:30,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:30,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:33:30,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:33:30,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:30,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:30,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:33:30,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:33:30,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321953736] [2025-03-04 15:33:30,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321953736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:33:30,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:33:30,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:33:30,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925683278] [2025-03-04 15:33:30,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:33:30,232 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:33:30,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:30,233 INFO L85 PathProgramCache]: Analyzing trace with hash 32988, now seen corresponding path program 2 times [2025-03-04 15:33:30,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:30,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901712974] [2025-03-04 15:33:30,233 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:33:30,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:30,235 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:33:30,237 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:33:30,237 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:33:30,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:30,237 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:30,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:33:30,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:33:30,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:30,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:30,240 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:30,274 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:33:30,274 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:33:30,274 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:33:30,274 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:33:30,274 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:33:30,274 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:30,274 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:33:30,275 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:33:30,275 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-01.c_Iteration2_Loop [2025-03-04 15:33:30,275 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:33:30,275 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:33:30,275 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:30,285 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:30,287 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:30,352 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:33:30,352 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:33:30,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:30,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:30,354 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:30,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-03-04 15:33:30,358 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:33:30,358 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:30,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-03-04 15:33:30,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:30,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:30,376 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:30,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-03-04 15:33:30,378 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:33:30,378 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:30,490 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:33:30,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-03-04 15:33:30,496 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:33:30,496 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:33:30,496 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:33:30,496 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:33:30,496 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:33:30,497 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:30,497 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:33:30,497 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:33:30,497 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-01.c_Iteration2_Loop [2025-03-04 15:33:30,497 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:33:30,497 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:33:30,498 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:30,503 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:30,505 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:30,587 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:33:30,587 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:33:30,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:30,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:30,613 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:30,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-03-04 15:33:30,615 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:30,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:30,625 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:33:30,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:30,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:30,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:30,625 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:33:30,625 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:33:30,627 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:30,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-03-04 15:33:30,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:30,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:30,634 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:30,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-03-04 15:33:30,637 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:30,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:30,646 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:33:30,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:30,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:30,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:30,647 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:33:30,647 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:33:30,651 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:30,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:30,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:30,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:30,659 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:30,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-03-04 15:33:30,662 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:30,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:30,672 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:33:30,673 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:30,673 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-04 15:33:30,673 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:30,678 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-04 15:33:30,678 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:33:30,682 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:30,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-03-04 15:33:30,688 INFO L451 LassoAnalysis]: Using template '2-nested'. [2025-03-04 15:33:30,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:30,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:30,690 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:30,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-03-04 15:33:30,691 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:30,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:30,701 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:33:30,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:30,701 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:30,701 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-03-04 15:33:30,702 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-03-04 15:33:30,702 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:33:30,703 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:30,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:30,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:30,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:30,710 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:30,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-03-04 15:33:30,712 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:30,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:30,722 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:33:30,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:30,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:30,722 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-03-04 15:33:30,724 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-03-04 15:33:30,724 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:33:30,725 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:30,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-03-04 15:33:30,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:30,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:30,732 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:30,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-03-04 15:33:30,733 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:30,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:30,743 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:33:30,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:30,743 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-04 15:33:30,743 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-03-04 15:33:30,747 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:30,747 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:33:30,752 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:33:30,758 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-03-04 15:33:30,758 INFO L444 ModelExtractionUtils]: 3 out of 9 variables were initially zero. Simplification set additionally 2 variables to zero. [2025-03-04 15:33:30,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:30,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:30,760 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:30,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-03-04 15:33:30,763 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:33:30,763 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:33:30,763 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:33:30,763 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function 2-nested ranking function: f0 = -1*ULTIMATE.start_main_~a~0#1 f1 = -1*ULTIMATE.start_main_#t~bitwise2#1 + 1*ULTIMATE.start_main_~x~0#1 Supporting invariants [] [2025-03-04 15:33:30,772 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-04 15:33:30,785 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:33:30,790 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-04 15:33:30,791 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: IfThenElseExpression [2025-03-04 15:33:30,791 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: IfThenElseExpression [2025-03-04 15:33:30,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:30,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:30,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:33:30,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:33:30,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:30,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:30,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:33:30,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:30,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:33:30,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:33:30,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:30,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:30,825 WARN L254 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:33:30,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:30,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:33:30,958 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-04 15:33:30,959 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 4 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:31,007 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 4. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 29 states and 37 transitions. Complement of second has 7 states. [2025-03-04 15:33:31,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-04 15:33:31,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:31,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2025-03-04 15:33:31,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 3 letters. [2025-03-04 15:33:31,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:31,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 8 letters. Loop has 3 letters. [2025-03-04 15:33:31,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:31,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 6 letters. [2025-03-04 15:33:31,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:31,009 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 37 transitions. [2025-03-04 15:33:31,010 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-04 15:33:31,010 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 27 states and 35 transitions. [2025-03-04 15:33:31,010 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2025-03-04 15:33:31,011 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2025-03-04 15:33:31,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2025-03-04 15:33:31,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:33:31,011 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 35 transitions. [2025-03-04 15:33:31,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2025-03-04 15:33:31,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2025-03-04 15:33:31,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:31,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2025-03-04 15:33:31,013 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 33 transitions. [2025-03-04 15:33:31,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:33:31,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:33:31,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:33:31,013 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:31,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:33:31,022 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2025-03-04 15:33:31,022 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2025-03-04 15:33:31,022 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-04 15:33:31,023 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 10 states and 11 transitions. [2025-03-04 15:33:31,023 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-04 15:33:31,023 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-04 15:33:31,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2025-03-04 15:33:31,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:33:31,023 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 11 transitions. [2025-03-04 15:33:31,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2025-03-04 15:33:31,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-03-04 15:33:31,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:31,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2025-03-04 15:33:31,024 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 10 transitions. [2025-03-04 15:33:31,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:33:31,024 INFO L432 stractBuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2025-03-04 15:33:31,025 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-04 15:33:31,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2025-03-04 15:33:31,025 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-04 15:33:31,025 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:33:31,025 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:33:31,025 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-04 15:33:31,025 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-04 15:33:31,025 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~post1#1, main_#t~bitwise2#1, main_~a~0#1, main_~b~0#1, main_~x~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~x~0#1;main_~a~0#1 := 16;main_~b~0#1 := 30;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" [2025-03-04 15:33:31,025 INFO L754 eck$LassoCheckResult]: Loop: "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" [2025-03-04 15:33:31,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:31,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1291903, now seen corresponding path program 1 times [2025-03-04 15:33:31,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:31,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031797271] [2025-03-04 15:33:31,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:33:31,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:31,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:33:31,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:33:31,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:31,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:31,029 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:31,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:33:31,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:33:31,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:31,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:31,031 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:31,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:31,032 INFO L85 PathProgramCache]: Analyzing trace with hash 36437595, now seen corresponding path program 1 times [2025-03-04 15:33:31,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:31,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456913112] [2025-03-04 15:33:31,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:33:31,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:31,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:33:31,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:33:31,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:31,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:31,046 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:31,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:33:31,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:33:31,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:31,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:31,051 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:31,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:31,051 INFO L85 PathProgramCache]: Analyzing trace with hash 2130486941, now seen corresponding path program 1 times [2025-03-04 15:33:31,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:31,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112707790] [2025-03-04 15:33:31,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:33:31,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:31,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:33:31,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:33:31,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:31,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:31,062 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:31,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:33:31,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:33:31,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:31,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:31,068 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:31,214 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:33:31,214 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:33:31,214 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:33:31,214 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:33:31,214 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:33:31,214 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:31,214 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:33:31,214 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:33:31,214 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-01.c_Iteration3_Loop [2025-03-04 15:33:31,214 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:33:31,215 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:33:31,215 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:31,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:31,258 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:31,310 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2025-03-04 15:33:31,635 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:33:31,635 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:33:31,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:31,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:31,637 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:31,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-03-04 15:33:31,640 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:33:31,640 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:31,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:31,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:31,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:31,669 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:31,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-03-04 15:33:31,671 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:33:31,671 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:31,702 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:33:31,703 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0#1=-2, ULTIMATE.start_main_~a~0#1=1, ULTIMATE.start_main_~b~0#1=-3} Honda state: {ULTIMATE.start_main_~x~0#1=-2, ULTIMATE.start_main_~a~0#1=1, ULTIMATE.start_main_~b~0#1=-3} Generalized eigenvectors: [{ULTIMATE.start_main_~x~0#1=0, ULTIMATE.start_main_~a~0#1=0, ULTIMATE.start_main_~b~0#1=0}, {ULTIMATE.start_main_~x~0#1=3, ULTIMATE.start_main_~a~0#1=1, ULTIMATE.start_main_~b~0#1=0}, {ULTIMATE.start_main_~x~0#1=0, ULTIMATE.start_main_~a~0#1=0, ULTIMATE.start_main_~b~0#1=0}] Lambdas: [2, 1, 1] Nus: [0, 1] [2025-03-04 15:33:31,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:31,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:31,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:31,709 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:31,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-03-04 15:33:31,711 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:33:31,711 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:31,722 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:33:31,722 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post1#1=0} Honda state: {ULTIMATE.start_main_#t~post1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:33:31,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-03-04 15:33:31,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:31,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:31,730 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:31,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-03-04 15:33:31,731 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:33:31,731 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:31,742 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:33:31,742 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~bitwise2#1=0} Honda state: {ULTIMATE.start_main_#t~bitwise2#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:33:31,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-03-04 15:33:31,774 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:33:31,775 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:33:31,775 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:33:31,775 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:33:31,775 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:33:31,775 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:31,775 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:33:31,775 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:33:31,775 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-01.c_Iteration3_Lasso [2025-03-04 15:33:31,775 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:33:31,775 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:33:31,776 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:31,778 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:31,781 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:31,821 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:31,823 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:31,882 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2025-03-04 15:33:32,210 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:33:32,210 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:33:32,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:32,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:32,212 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:32,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-03-04 15:33:32,215 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:33:32,215 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:32,227 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:33:32,227 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet0#1=0} Honda state: {ULTIMATE.start_main_#t~nondet0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:33:32,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:32,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:32,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:32,235 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:32,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-03-04 15:33:32,238 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:33:32,238 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:32,249 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:33:32,249 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post1#1=0} Honda state: {ULTIMATE.start_main_#t~post1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:33:32,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:32,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:32,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:32,257 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:32,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-03-04 15:33:32,260 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:33:32,260 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:32,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:32,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:32,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:32,305 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:32,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-03-04 15:33:32,308 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:33:32,308 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:32,336 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:33:32,340 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-04 15:33:32,340 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:33:32,340 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:33:32,340 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:33:32,340 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:33:32,340 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:33:32,340 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:32,340 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:33:32,340 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:33:32,340 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-01.c_Iteration3_Lasso [2025-03-04 15:33:32,340 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:33:32,341 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:33:32,344 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:32,346 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:32,349 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:32,385 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:32,387 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:32,447 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2025-03-04 15:33:32,745 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:33:32,745 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:33:32,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:32,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:32,747 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:32,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-03-04 15:33:32,750 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:32,760 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:32,760 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:33:32,760 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:32,760 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:32,760 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:32,760 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:33:32,761 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:33:32,761 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:32,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-03-04 15:33:32,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:32,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:32,769 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:32,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-03-04 15:33:32,772 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:32,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:32,782 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:33:32,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:32,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:32,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:32,782 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:33:32,782 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:33:32,783 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:32,788 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-04 15:33:32,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:32,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:32,790 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:32,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-03-04 15:33:32,792 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:32,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:32,802 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:32,802 INFO L204 nArgumentSynthesizer]: 7 loop disjuncts [2025-03-04 15:33:32,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:32,867 INFO L401 nArgumentSynthesizer]: We have 126 Motzkin's Theorem applications. [2025-03-04 15:33:32,867 INFO L402 nArgumentSynthesizer]: A total of 14 supporting invariants were added. [2025-03-04 15:33:33,935 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:33:34,504 INFO L443 ModelExtractionUtils]: Simplification made 31 calls to the SMT solver. [2025-03-04 15:33:34,504 INFO L444 ModelExtractionUtils]: 27 out of 61 variables were initially zero. Simplification set additionally 17 variables to zero. [2025-03-04 15:33:34,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:34,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:34,506 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:34,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-03-04 15:33:34,507 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:33:34,531 INFO L438 nArgumentSynthesizer]: Removed 11 redundant supporting invariants from a total of 14. [2025-03-04 15:33:34,531 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:33:34,531 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1) = 1*ULTIMATE.start_main_~x~0#1 Supporting invariants [1*ULTIMATE.start_main_~a~0#1 >= 0, 2*ULTIMATE.start_main_~x~0#1 - 1 >= 0, -1*ULTIMATE.start_main_~a~0#1 + 1*ULTIMATE.start_main_~b~0#1 + 1 >= 0] [2025-03-04 15:33:34,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-03-04 15:33:34,551 INFO L156 tatePredicateManager]: 1 out of 3 supporting invariants were superfluous and have been removed [2025-03-04 15:33:34,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:34,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:33:34,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:33:34,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:34,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:34,576 WARN L254 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 15:33:34,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:34,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:33:34,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:33:34,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:34,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:34,611 WARN L254 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:33:34,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:34,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:33:34,696 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 5 loop predicates [2025-03-04 15:33:34,696 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:34,754 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 10 transitions. cyclomatic complexity: 2. Second operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 21 states and 24 transitions. Complement of second has 13 states. [2025-03-04 15:33:34,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 3 stem states 4 non-accepting loop states 1 accepting loop states [2025-03-04 15:33:34,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:34,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2025-03-04 15:33:34,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. Stem has 4 letters. Loop has 5 letters. [2025-03-04 15:33:34,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:34,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. Stem has 9 letters. Loop has 5 letters. [2025-03-04 15:33:34,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:34,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. Stem has 4 letters. Loop has 10 letters. [2025-03-04 15:33:34,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:34,757 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 24 transitions. [2025-03-04 15:33:34,758 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-04 15:33:34,758 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 16 states and 18 transitions. [2025-03-04 15:33:34,758 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-04 15:33:34,758 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-04 15:33:34,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 18 transitions. [2025-03-04 15:33:34,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:33:34,759 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 18 transitions. [2025-03-04 15:33:34,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 18 transitions. [2025-03-04 15:33:34,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2025-03-04 15:33:34,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:34,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2025-03-04 15:33:34,760 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 17 transitions. [2025-03-04 15:33:34,760 INFO L432 stractBuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2025-03-04 15:33:34,760 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-04 15:33:34,760 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2025-03-04 15:33:34,760 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-04 15:33:34,760 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:33:34,760 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:33:34,761 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:33:34,761 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:33:34,761 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~post1#1, main_#t~bitwise2#1, main_~a~0#1, main_~b~0#1, main_~x~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~x~0#1;main_~a~0#1 := 16;main_~b~0#1 := 30;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume 0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1;main_#t~bitwise2#1 := main_~a~0#1;" [2025-03-04 15:33:34,761 INFO L754 eck$LassoCheckResult]: Loop: "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume 0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1;main_#t~bitwise2#1 := main_~a~0#1;" [2025-03-04 15:33:34,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:34,761 INFO L85 PathProgramCache]: Analyzing trace with hash 2130486936, now seen corresponding path program 1 times [2025-03-04 15:33:34,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:34,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317172286] [2025-03-04 15:33:34,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:33:34,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:34,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:33:34,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:33:34,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:34,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:34,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:33:34,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:33:34,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317172286] [2025-03-04 15:33:34,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317172286] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:33:34,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551579992] [2025-03-04 15:33:34,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:33:34,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:33:34,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:34,884 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:33:34,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-03-04 15:33:34,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:33:34,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:33:34,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:34,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:34,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:33:34,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:34,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:33:34,953 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:33:34,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-03-04 15:33:35,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:33:35,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551579992] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:33:35,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:33:35,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 15 [2025-03-04 15:33:35,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357315378] [2025-03-04 15:33:35,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:33:35,087 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:33:35,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:35,088 INFO L85 PathProgramCache]: Analyzing trace with hash 32988, now seen corresponding path program 3 times [2025-03-04 15:33:35,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:35,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228403105] [2025-03-04 15:33:35,089 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:33:35,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:35,092 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:33:35,093 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:33:35,094 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:33:35,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:35,094 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:35,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:33:35,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:33:35,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:35,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:35,100 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:35,135 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:33:35,135 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:33:35,135 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:33:35,135 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:33:35,135 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:33:35,135 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:35,135 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:33:35,136 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:33:35,136 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-01.c_Iteration4_Loop [2025-03-04 15:33:35,136 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:33:35,136 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:33:35,136 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:35,138 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:35,140 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:35,198 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:33:35,198 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:33:35,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:35,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:35,200 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:35,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-03-04 15:33:35,203 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:33:35,203 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:35,214 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:33:35,214 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post1#1=0} Honda state: {ULTIMATE.start_main_#t~post1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:33:35,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:35,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:35,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:35,222 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:35,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-03-04 15:33:35,226 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:33:35,226 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:35,237 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:33:35,237 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~b~0#1=0} Honda state: {ULTIMATE.start_main_~b~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:33:35,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:35,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:35,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:35,244 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:35,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-03-04 15:33:35,245 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:33:35,245 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:35,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-03-04 15:33:35,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:35,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:35,263 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:35,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-03-04 15:33:35,264 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:33:35,264 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:35,453 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:33:35,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-03-04 15:33:35,460 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:33:35,460 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:33:35,460 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:33:35,460 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:33:35,460 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:33:35,460 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:35,460 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:33:35,460 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:33:35,460 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-01.c_Iteration4_Loop [2025-03-04 15:33:35,460 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:33:35,460 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:33:35,461 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:35,464 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:35,466 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:35,519 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:33:35,519 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:33:35,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:35,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:35,523 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:35,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-03-04 15:33:35,524 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:35,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:35,534 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:33:35,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:35,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:35,534 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:35,535 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:33:35,535 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:33:35,536 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:35,541 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-04 15:33:35,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:35,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:35,543 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:35,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-03-04 15:33:35,544 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:35,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:35,555 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:33:35,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:35,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:35,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:35,555 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:33:35,555 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:33:35,556 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:35,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2025-03-04 15:33:35,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:35,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:35,566 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:35,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-03-04 15:33:35,568 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:35,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:35,578 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:33:35,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:35,578 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-04 15:33:35,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:35,580 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-04 15:33:35,580 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:33:35,583 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:35,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-03-04 15:33:35,589 INFO L451 LassoAnalysis]: Using template '2-nested'. [2025-03-04 15:33:35,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:35,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:35,591 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:35,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-03-04 15:33:35,593 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:35,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:35,603 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:33:35,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:35,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:35,604 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-03-04 15:33:35,604 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-03-04 15:33:35,604 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:33:35,606 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:35,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:35,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:35,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:35,615 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:35,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-03-04 15:33:35,616 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:35,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:35,626 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:33:35,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:35,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:35,626 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-03-04 15:33:35,627 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-03-04 15:33:35,627 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:33:35,628 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:35,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-03-04 15:33:35,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:35,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:35,649 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:35,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-03-04 15:33:35,650 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:35,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:35,661 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:33:35,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:35,661 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-04 15:33:35,661 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-03-04 15:33:35,664 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:35,664 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:33:35,668 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:33:35,672 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:33:35,672 INFO L444 ModelExtractionUtils]: 4 out of 9 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-04 15:33:35,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:35,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:35,674 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:35,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-03-04 15:33:35,675 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:33:35,675 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:33:35,676 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:33:35,676 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function 2-nested ranking function: f0 = -1*ULTIMATE.start_main_~a~0#1 f1 = 1*ULTIMATE.start_main_~x~0#1 - 1*ULTIMATE.start_main_#t~bitwise2#1 Supporting invariants [] [2025-03-04 15:33:35,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2025-03-04 15:33:35,683 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:33:35,684 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: IfThenElseExpression [2025-03-04 15:33:35,684 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: IfThenElseExpression [2025-03-04 15:33:35,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:35,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:33:35,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:33:35,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:35,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:35,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:33:35,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:35,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:33:35,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:33:35,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:35,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:35,719 WARN L254 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:33:35,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:35,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:33:35,808 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-04 15:33:35,808 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:35,835 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4. 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) Result 27 states and 31 transitions. Complement of second has 7 states. [2025-03-04 15:33:35,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-04 15:33:35,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:35,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2025-03-04 15:33:35,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 3 letters. [2025-03-04 15:33:35,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:35,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 12 letters. Loop has 3 letters. [2025-03-04 15:33:35,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:35,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 6 letters. [2025-03-04 15:33:35,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:35,836 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 31 transitions. [2025-03-04 15:33:35,837 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-04 15:33:35,837 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 24 states and 28 transitions. [2025-03-04 15:33:35,837 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2025-03-04 15:33:35,837 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2025-03-04 15:33:35,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2025-03-04 15:33:35,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:33:35,837 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 28 transitions. [2025-03-04 15:33:35,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2025-03-04 15:33:35,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2025-03-04 15:33:35,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:35,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2025-03-04 15:33:35,838 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 25 transitions. [2025-03-04 15:33:35,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:33:35,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 15:33:35,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2025-03-04 15:33:35,841 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:35,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:33:35,904 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2025-03-04 15:33:35,904 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 34 transitions. [2025-03-04 15:33:35,905 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-04 15:33:35,905 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 34 transitions. [2025-03-04 15:33:35,905 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-03-04 15:33:35,906 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-03-04 15:33:35,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 34 transitions. [2025-03-04 15:33:35,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:33:35,907 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 34 transitions. [2025-03-04 15:33:35,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 34 transitions. [2025-03-04 15:33:35,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-04 15:33:35,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:35,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2025-03-04 15:33:35,912 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 34 transitions. [2025-03-04 15:33:35,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 15:33:35,912 INFO L432 stractBuchiCegarLoop]: Abstraction has 30 states and 34 transitions. [2025-03-04 15:33:35,912 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-04 15:33:35,912 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 34 transitions. [2025-03-04 15:33:35,913 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-04 15:33:35,913 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:33:35,913 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:33:35,913 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 3, 3, 1, 1, 1] [2025-03-04 15:33:35,913 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-04 15:33:35,913 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~post1#1, main_#t~bitwise2#1, main_~a~0#1, main_~b~0#1, main_~x~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~x~0#1;main_~a~0#1 := 16;main_~b~0#1 := 30;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume 0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1;main_#t~bitwise2#1 := main_~a~0#1;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" [2025-03-04 15:33:35,913 INFO L754 eck$LassoCheckResult]: Loop: "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" [2025-03-04 15:33:35,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:35,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1722326614, now seen corresponding path program 2 times [2025-03-04 15:33:35,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:35,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748495576] [2025-03-04 15:33:35,914 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:33:35,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:35,917 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 15:33:35,934 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 15:33:35,934 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:33:35,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:35,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-03-04 15:33:36,177 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:33:36,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:33:36,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748495576] [2025-03-04 15:33:36,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748495576] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:33:36,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326331612] [2025-03-04 15:33:36,178 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:33:36,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:33:36,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:36,180 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-04 15:33:36,181 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-04 15:33:36,200 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 15:33:36,207 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 15:33:36,207 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:33:36,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:36,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 15:33:36,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:36,338 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:33:36,338 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:33:36,593 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:33:36,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326331612] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:33:36,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:33:36,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 30 [2025-03-04 15:33:36,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85988171] [2025-03-04 15:33:36,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:33:36,593 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:33:36,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:36,593 INFO L85 PathProgramCache]: Analyzing trace with hash 36437595, now seen corresponding path program 2 times [2025-03-04 15:33:36,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:36,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752318952] [2025-03-04 15:33:36,593 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:33:36,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:36,595 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:33:36,598 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:33:36,598 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:33:36,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:36,598 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:36,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:33:36,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:33:36,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:36,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:36,601 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:36,721 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:33:36,721 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:33:36,721 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:33:36,721 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:33:36,721 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:33:36,721 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:36,721 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:33:36,721 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:33:36,721 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-01.c_Iteration5_Loop [2025-03-04 15:33:36,721 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:33:36,721 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:33:36,722 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:36,724 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:36,725 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:36,793 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2025-03-04 15:33:37,071 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:33:37,072 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:33:37,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:37,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:37,074 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:37,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-03-04 15:33:37,076 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:33:37,076 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:37,089 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:33:37,089 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post1#1=0} Honda state: {ULTIMATE.start_main_#t~post1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:33:37,096 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-04 15:33:37,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:37,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:37,121 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:37,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-03-04 15:33:37,123 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:33:37,123 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:37,139 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:33:37,140 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~bitwise2#1=0} Honda state: {ULTIMATE.start_main_#t~bitwise2#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:33:37,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:37,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:37,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:37,150 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:37,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-03-04 15:33:37,158 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:33:37,158 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:37,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:37,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:37,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:37,194 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:37,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-03-04 15:33:37,196 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:33:37,196 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:37,234 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:33:37,234 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0#1=-1, ULTIMATE.start_main_~a~0#1=1, ULTIMATE.start_main_~b~0#1=-2} Honda state: {ULTIMATE.start_main_~x~0#1=-1, ULTIMATE.start_main_~a~0#1=1, ULTIMATE.start_main_~b~0#1=-2} Generalized eigenvectors: [{ULTIMATE.start_main_~x~0#1=0, ULTIMATE.start_main_~a~0#1=0, ULTIMATE.start_main_~b~0#1=0}, {ULTIMATE.start_main_~x~0#1=1, ULTIMATE.start_main_~a~0#1=0, ULTIMATE.start_main_~b~0#1=0}, {ULTIMATE.start_main_~x~0#1=1, ULTIMATE.start_main_~a~0#1=1, ULTIMATE.start_main_~b~0#1=0}] Lambdas: [2, 1, 1] Nus: [0, 0] [2025-03-04 15:33:37,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2025-03-04 15:33:37,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:33:37,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-04 15:33:37,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=669, Unknown=0, NotChecked=0, Total=870 [2025-03-04 15:33:37,240 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. cyclomatic complexity: 7 Second operand has 30 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 30 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:37,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:33:37,408 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2025-03-04 15:33:37,408 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 54 transitions. [2025-03-04 15:33:37,408 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-04 15:33:37,409 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 50 states and 54 transitions. [2025-03-04 15:33:37,409 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-03-04 15:33:37,409 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-03-04 15:33:37,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 54 transitions. [2025-03-04 15:33:37,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:33:37,409 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 54 transitions. [2025-03-04 15:33:37,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 54 transitions. [2025-03-04 15:33:37,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-04 15:33:37,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.08) internal successors, (54), 49 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:37,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2025-03-04 15:33:37,411 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 54 transitions. [2025-03-04 15:33:37,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 15:33:37,412 INFO L432 stractBuchiCegarLoop]: Abstraction has 50 states and 54 transitions. [2025-03-04 15:33:37,412 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-04 15:33:37,412 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 54 transitions. [2025-03-04 15:33:37,413 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-04 15:33:37,413 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:33:37,413 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:33:37,414 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 8, 8, 7, 7, 1, 1, 1] [2025-03-04 15:33:37,414 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-04 15:33:37,414 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~post1#1, main_#t~bitwise2#1, main_~a~0#1, main_~b~0#1, main_~x~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~x~0#1;main_~a~0#1 := 16;main_~b~0#1 := 30;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume 0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1;main_#t~bitwise2#1 := main_~a~0#1;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" [2025-03-04 15:33:37,414 INFO L754 eck$LassoCheckResult]: Loop: "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" [2025-03-04 15:33:37,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:37,414 INFO L85 PathProgramCache]: Analyzing trace with hash 2118080298, now seen corresponding path program 3 times [2025-03-04 15:33:37,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:37,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24360050] [2025-03-04 15:33:37,415 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:33:37,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:37,422 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 9 equivalence classes. [2025-03-04 15:33:37,454 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 15:33:37,455 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-04 15:33:37,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:38,036 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 23 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:33:38,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:33:38,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24360050] [2025-03-04 15:33:38,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24360050] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:33:38,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91093354] [2025-03-04 15:33:38,036 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:33:38,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:33:38,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:38,038 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:33:38,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2025-03-04 15:33:38,065 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 9 equivalence classes. [2025-03-04 15:33:38,079 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 15:33:38,079 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-04 15:33:38,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:38,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 15:33:38,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:38,455 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 23 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:33:38,455 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:33:39,074 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 23 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:33:39,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91093354] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:33:39,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:33:39,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 25] total 58 [2025-03-04 15:33:39,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493241163] [2025-03-04 15:33:39,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:33:39,074 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:33:39,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:39,075 INFO L85 PathProgramCache]: Analyzing trace with hash 36437595, now seen corresponding path program 3 times [2025-03-04 15:33:39,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:39,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938547285] [2025-03-04 15:33:39,075 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:33:39,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:39,077 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:33:39,078 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:33:39,078 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:33:39,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:39,078 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:39,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:33:39,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:33:39,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:39,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:39,080 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:39,196 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:33:39,196 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:33:39,196 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:33:39,196 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:33:39,196 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:33:39,196 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:39,196 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:33:39,196 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:33:39,196 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-01.c_Iteration6_Loop [2025-03-04 15:33:39,196 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:33:39,196 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:33:39,197 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:39,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:39,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:39,265 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2025-03-04 15:33:39,489 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:33:39,489 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:33:39,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:39,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:39,495 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:39,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-03-04 15:33:39,497 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:33:39,497 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:39,507 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:33:39,508 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post1#1=0} Honda state: {ULTIMATE.start_main_#t~post1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:33:39,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:39,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:39,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:39,516 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:39,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-03-04 15:33:39,518 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:33:39,518 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:39,528 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:33:39,528 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~bitwise2#1=0} Honda state: {ULTIMATE.start_main_#t~bitwise2#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:33:39,534 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-04 15:33:39,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:39,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:39,535 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:39,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-03-04 15:33:39,537 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:33:39,537 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:39,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-03-04 15:33:39,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:39,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:39,574 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:39,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-03-04 15:33:39,575 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:33:39,575 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:39,598 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:33:39,598 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0#1=0, ULTIMATE.start_main_~a~0#1=1, ULTIMATE.start_main_~b~0#1=-1} Honda state: {ULTIMATE.start_main_~x~0#1=0, ULTIMATE.start_main_~a~0#1=1, ULTIMATE.start_main_~b~0#1=-1} Generalized eigenvectors: [{ULTIMATE.start_main_~x~0#1=1, ULTIMATE.start_main_~a~0#1=1, ULTIMATE.start_main_~b~0#1=0}, {ULTIMATE.start_main_~x~0#1=0, ULTIMATE.start_main_~a~0#1=0, ULTIMATE.start_main_~b~0#1=0}, {ULTIMATE.start_main_~x~0#1=0, ULTIMATE.start_main_~a~0#1=0, ULTIMATE.start_main_~b~0#1=0}] Lambdas: [1, 0, 2] Nus: [0, 1] [2025-03-04 15:33:39,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:39,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:33:39,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-03-04 15:33:39,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=646, Invalid=2660, Unknown=0, NotChecked=0, Total=3306 [2025-03-04 15:33:39,604 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. cyclomatic complexity: 7 Second operand has 58 states, 58 states have (on average 2.0344827586206895) internal successors, (118), 58 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:39,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:33:39,932 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2025-03-04 15:33:39,932 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 84 transitions. [2025-03-04 15:33:39,932 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-04 15:33:39,933 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 80 states and 84 transitions. [2025-03-04 15:33:39,933 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-03-04 15:33:39,933 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-03-04 15:33:39,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 84 transitions. [2025-03-04 15:33:39,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:33:39,933 INFO L218 hiAutomatonCegarLoop]: Abstraction has 80 states and 84 transitions. [2025-03-04 15:33:39,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 84 transitions. [2025-03-04 15:33:39,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-04 15:33:39,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 80 states have (on average 1.05) internal successors, (84), 79 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:39,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2025-03-04 15:33:39,940 INFO L240 hiAutomatonCegarLoop]: Abstraction has 80 states and 84 transitions. [2025-03-04 15:33:39,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-04 15:33:39,942 INFO L432 stractBuchiCegarLoop]: Abstraction has 80 states and 84 transitions. [2025-03-04 15:33:39,943 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-04 15:33:39,943 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 84 transitions. [2025-03-04 15:33:39,943 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-04 15:33:39,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:33:39,944 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:33:39,945 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [15, 14, 14, 13, 13, 1, 1, 1] [2025-03-04 15:33:39,945 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-04 15:33:39,945 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~post1#1, main_#t~bitwise2#1, main_~a~0#1, main_~b~0#1, main_~x~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~x~0#1;main_~a~0#1 := 16;main_~b~0#1 := 30;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume 0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1;main_#t~bitwise2#1 := main_~a~0#1;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" [2025-03-04 15:33:39,945 INFO L754 eck$LassoCheckResult]: Loop: "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" [2025-03-04 15:33:39,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:39,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1839726742, now seen corresponding path program 4 times [2025-03-04 15:33:39,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:39,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198095093] [2025-03-04 15:33:39,946 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:33:39,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:39,951 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 72 statements into 2 equivalence classes. [2025-03-04 15:33:39,974 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 15:33:39,974 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:33:39,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:39,974 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:39,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 15:33:39,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 15:33:39,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:39,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:39,998 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:39,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:39,998 INFO L85 PathProgramCache]: Analyzing trace with hash 36437595, now seen corresponding path program 4 times [2025-03-04 15:33:39,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:39,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487326396] [2025-03-04 15:33:39,998 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:33:39,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:40,000 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 5 statements into 2 equivalence classes. [2025-03-04 15:33:40,001 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:33:40,001 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:33:40,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:40,001 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:40,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:33:40,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:33:40,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:40,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:40,005 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:40,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:40,006 INFO L85 PathProgramCache]: Analyzing trace with hash 623392914, now seen corresponding path program 5 times [2025-03-04 15:33:40,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:40,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098888425] [2025-03-04 15:33:40,006 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:33:40,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:40,012 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 77 statements into 15 equivalence classes. [2025-03-04 15:33:40,097 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 15:33:40,097 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2025-03-04 15:33:40,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:40,097 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:40,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 15:33:40,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 15:33:40,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:40,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:40,116 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:40,259 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:33:40,259 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:33:40,259 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:33:40,259 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:33:40,259 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:33:40,259 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:40,260 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:33:40,260 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:33:40,260 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-01.c_Iteration7_Loop [2025-03-04 15:33:40,260 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:33:40,260 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:33:40,260 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:40,262 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:40,299 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:40,345 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2025-03-04 15:33:40,613 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:33:40,614 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:33:40,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:40,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:40,616 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:40,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-03-04 15:33:40,617 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:33:40,617 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:40,628 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:33:40,628 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~bitwise2#1=0} Honda state: {ULTIMATE.start_main_#t~bitwise2#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:33:40,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2025-03-04 15:33:40,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:40,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:40,636 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:40,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-03-04 15:33:40,638 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:33:40,638 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:40,665 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-04 15:33:40,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:40,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:40,667 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:40,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-03-04 15:33:40,668 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:33:40,668 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:40,693 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:33:40,693 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0#1=0, ULTIMATE.start_main_~a~0#1=1, ULTIMATE.start_main_~b~0#1=-1} Honda state: {ULTIMATE.start_main_~x~0#1=0, ULTIMATE.start_main_~a~0#1=1, ULTIMATE.start_main_~b~0#1=-1} Generalized eigenvectors: [{ULTIMATE.start_main_~x~0#1=1, ULTIMATE.start_main_~a~0#1=1, ULTIMATE.start_main_~b~0#1=0}, {ULTIMATE.start_main_~x~0#1=0, ULTIMATE.start_main_~a~0#1=0, ULTIMATE.start_main_~b~0#1=0}, {ULTIMATE.start_main_~x~0#1=0, ULTIMATE.start_main_~a~0#1=0, ULTIMATE.start_main_~b~0#1=0}] Lambdas: [1, 0, 2] Nus: [0, 1] [2025-03-04 15:33:40,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:40,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:40,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:40,699 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:40,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-03-04 15:33:40,700 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:33:40,700 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:40,710 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:33:40,710 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post1#1=0} Honda state: {ULTIMATE.start_main_#t~post1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:33:40,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2025-03-04 15:33:41,937 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:33:41,937 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:33:41,937 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:33:41,937 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:33:41,937 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:33:41,937 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:41,937 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:33:41,937 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:33:41,937 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-01.c_Iteration7_Lasso [2025-03-04 15:33:41,937 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:33:41,937 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:33:41,938 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:41,941 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:41,942 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:41,944 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:41,946 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:42,018 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2025-03-04 15:33:42,258 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:33:42,258 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:33:42,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:42,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:42,260 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:42,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-03-04 15:33:42,262 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:33:42,262 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:42,272 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:33:42,272 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post1#1=0} Honda state: {ULTIMATE.start_main_#t~post1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:33:42,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2025-03-04 15:33:42,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:42,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:42,279 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:42,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-03-04 15:33:42,281 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:33:42,281 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:42,291 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:33:42,291 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~bitwise2#1=0} Honda state: {ULTIMATE.start_main_#t~bitwise2#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:33:42,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2025-03-04 15:33:42,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:42,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:42,299 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:42,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-03-04 15:33:42,300 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:33:42,300 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:42,310 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:33:42,310 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res#1=0} Honda state: {ULTIMATE.start_main_#res#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:33:42,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2025-03-04 15:33:42,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:42,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:42,317 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:42,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-03-04 15:33:42,318 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:33:42,319 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:42,329 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:33:42,329 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet0#1=0} Honda state: {ULTIMATE.start_main_#t~nondet0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:33:42,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2025-03-04 15:33:42,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:42,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:42,336 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:42,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-03-04 15:33:42,338 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:33:42,338 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:42,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2025-03-04 15:33:42,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:42,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:42,356 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:42,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-03-04 15:33:42,357 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:33:42,357 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:42,381 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:33:42,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2025-03-04 15:33:42,386 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:33:42,386 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:33:42,386 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:33:42,386 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:33:42,386 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:33:42,386 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:42,386 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:33:42,386 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:33:42,386 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-01.c_Iteration7_Lasso [2025-03-04 15:33:42,386 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:33:42,386 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:33:42,387 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:42,389 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:42,391 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:42,392 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:42,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:42,480 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2025-03-04 15:33:42,738 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:33:42,738 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:33:42,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:42,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:42,740 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:42,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-03-04 15:33:42,741 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:42,751 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:42,751 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:33:42,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:42,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:42,751 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:42,751 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:33:42,751 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:33:42,752 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:42,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2025-03-04 15:33:42,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:42,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:42,759 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:42,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2025-03-04 15:33:42,761 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:42,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:42,771 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:33:42,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:42,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:42,771 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:42,771 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:33:42,771 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:33:42,772 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:42,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2025-03-04 15:33:42,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:42,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:42,779 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:42,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2025-03-04 15:33:42,781 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:42,791 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:42,791 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:33:42,791 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:42,791 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:42,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:42,791 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:33:42,791 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:33:42,792 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:42,797 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-04 15:33:42,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:42,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:42,799 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:42,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2025-03-04 15:33:42,801 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:42,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:42,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:42,811 INFO L204 nArgumentSynthesizer]: 7 loop disjuncts [2025-03-04 15:33:42,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:42,867 INFO L401 nArgumentSynthesizer]: We have 126 Motzkin's Theorem applications. [2025-03-04 15:33:42,867 INFO L402 nArgumentSynthesizer]: A total of 14 supporting invariants were added. [2025-03-04 15:33:43,863 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:33:44,677 INFO L443 ModelExtractionUtils]: Simplification made 34 calls to the SMT solver. [2025-03-04 15:33:44,677 INFO L444 ModelExtractionUtils]: 21 out of 61 variables were initially zero. Simplification set additionally 24 variables to zero. [2025-03-04 15:33:44,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:44,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:44,679 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:44,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2025-03-04 15:33:44,681 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:33:44,700 INFO L438 nArgumentSynthesizer]: Removed 11 redundant supporting invariants from a total of 14. [2025-03-04 15:33:44,700 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:33:44,700 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1) = 1*ULTIMATE.start_main_~x~0#1 Supporting invariants [-1*ULTIMATE.start_main_~a~0#1 + 1*ULTIMATE.start_main_~b~0#1 + 1 >= 0, 1*ULTIMATE.start_main_~a~0#1 >= 0, 2*ULTIMATE.start_main_~x~0#1 - 1 >= 0] [2025-03-04 15:33:44,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2025-03-04 15:33:44,718 INFO L156 tatePredicateManager]: 1 out of 3 supporting invariants were superfluous and have been removed [2025-03-04 15:33:44,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:44,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 15:33:44,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 15:33:44,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:44,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:44,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 15:33:44,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:44,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2025-03-04 15:33:45,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:33:45,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:33:45,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:45,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:45,152 WARN L254 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:33:45,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:45,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:33:45,242 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.19 stem predicates 5 loop predicates [2025-03-04 15:33:45,243 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 80 states and 84 transitions. cyclomatic complexity: 7 Second operand has 24 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 24 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-04 15:33:45,267 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 80 states and 84 transitions. cyclomatic complexity: 7. Second operand has 24 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 24 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) Result 80 states and 84 transitions. Complement of second has 5 states. [2025-03-04 15:33:45,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-04 15:33:45,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 24 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-04 15:33:45,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2025-03-04 15:33:45,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 4 transitions. Stem has 72 letters. Loop has 5 letters. [2025-03-04 15:33:45,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:45,268 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:33:45,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:45,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 15:33:45,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 15:33:45,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:45,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:45,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 15:33:45,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:45,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:33:45,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:33:45,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:45,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:45,676 WARN L254 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:33:45,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:45,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:33:45,783 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.19 stem predicates 5 loop predicates [2025-03-04 15:33:45,783 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 80 states and 84 transitions. cyclomatic complexity: 7 Second operand has 24 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 24 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-04 15:33:45,811 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 80 states and 84 transitions. cyclomatic complexity: 7. Second operand has 24 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 24 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) Result 80 states and 84 transitions. Complement of second has 5 states. [2025-03-04 15:33:45,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-04 15:33:45,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 24 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-04 15:33:45,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2025-03-04 15:33:45,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 4 transitions. Stem has 72 letters. Loop has 5 letters. [2025-03-04 15:33:45,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:45,812 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:33:45,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:45,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 15:33:45,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 15:33:45,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:45,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:45,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 15:33:45,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:46,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:33:46,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:33:46,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:46,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:46,242 WARN L254 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:33:46,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:46,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:33:46,334 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.19 stem predicates 5 loop predicates [2025-03-04 15:33:46,334 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 80 states and 84 transitions. cyclomatic complexity: 7 Second operand has 24 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 24 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-04 15:33:46,819 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 80 states and 84 transitions. cyclomatic complexity: 7. Second operand has 24 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 24 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) Result 94 states and 100 transitions. Complement of second has 42 states. [2025-03-04 15:33:46,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 25 states 19 stem states 4 non-accepting loop states 2 accepting loop states [2025-03-04 15:33:46,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 24 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-04 15:33:46,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 101 transitions. [2025-03-04 15:33:46,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 101 transitions. Stem has 72 letters. Loop has 5 letters. [2025-03-04 15:33:46,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:46,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 101 transitions. Stem has 77 letters. Loop has 5 letters. [2025-03-04 15:33:46,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:46,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 101 transitions. Stem has 72 letters. Loop has 10 letters. [2025-03-04 15:33:46,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:46,822 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 100 transitions. [2025-03-04 15:33:46,823 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2025-03-04 15:33:46,823 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 89 states and 94 transitions. [2025-03-04 15:33:46,824 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2025-03-04 15:33:46,824 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-03-04 15:33:46,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 94 transitions. [2025-03-04 15:33:46,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:33:46,824 INFO L218 hiAutomatonCegarLoop]: Abstraction has 89 states and 94 transitions. [2025-03-04 15:33:46,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 94 transitions. [2025-03-04 15:33:46,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 84. [2025-03-04 15:33:46,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 84 states have (on average 1.0595238095238095) internal successors, (89), 83 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:46,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2025-03-04 15:33:46,828 INFO L240 hiAutomatonCegarLoop]: Abstraction has 84 states and 89 transitions. [2025-03-04 15:33:46,828 INFO L432 stractBuchiCegarLoop]: Abstraction has 84 states and 89 transitions. [2025-03-04 15:33:46,828 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-04 15:33:46,828 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 89 transitions. [2025-03-04 15:33:46,829 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2025-03-04 15:33:46,830 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:33:46,830 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:33:46,831 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [15, 14, 14, 13, 13, 1, 1, 1] [2025-03-04 15:33:46,831 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2025-03-04 15:33:46,832 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~post1#1, main_#t~bitwise2#1, main_~a~0#1, main_~b~0#1, main_~x~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~x~0#1;main_~a~0#1 := 16;main_~b~0#1 := 30;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume 0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1;main_#t~bitwise2#1 := main_~a~0#1;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" [2025-03-04 15:33:46,832 INFO L754 eck$LassoCheckResult]: Loop: "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume 0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1;main_#t~bitwise2#1 := main_~a~0#1;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" [2025-03-04 15:33:46,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:46,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1839726742, now seen corresponding path program 6 times [2025-03-04 15:33:46,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:46,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260090375] [2025-03-04 15:33:46,832 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 15:33:46,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:46,837 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 72 statements into 15 equivalence classes. [2025-03-04 15:33:46,865 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 15:33:46,865 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2025-03-04 15:33:46,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:46,865 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:46,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 15:33:46,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 15:33:46,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:46,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:46,890 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:46,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:46,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1114478996, now seen corresponding path program 1 times [2025-03-04 15:33:46,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:46,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659110852] [2025-03-04 15:33:46,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:33:46,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:46,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:33:46,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:33:46,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:46,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:46,893 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:46,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:33:46,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:33:46,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:46,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:46,895 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:46,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:46,896 INFO L85 PathProgramCache]: Analyzing trace with hash 59567317, now seen corresponding path program 7 times [2025-03-04 15:33:46,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:46,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751144354] [2025-03-04 15:33:46,896 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 15:33:46,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:46,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 15:33:46,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 15:33:46,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:46,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:46,910 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:46,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 15:33:46,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 15:33:46,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:46,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:46,927 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:47,081 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:33:47,082 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:33:47,082 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:33:47,082 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:33:47,082 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:33:47,082 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:47,082 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:33:47,082 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:33:47,082 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-01.c_Iteration8_Loop [2025-03-04 15:33:47,082 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:33:47,082 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:33:47,083 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:47,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:47,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:47,255 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:33:47,255 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:33:47,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:47,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:47,257 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:47,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2025-03-04 15:33:47,259 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:33:47,259 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:47,269 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:33:47,269 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post1#1=0} Honda state: {ULTIMATE.start_main_#t~post1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:33:47,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:47,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:47,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:47,276 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:47,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2025-03-04 15:33:47,278 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:33:47,278 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:47,288 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:33:47,288 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~bitwise2#1=0} Honda state: {ULTIMATE.start_main_#t~bitwise2#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:33:47,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2025-03-04 15:33:47,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:47,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:47,295 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:47,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2025-03-04 15:33:47,297 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:33:47,297 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:47,325 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-04 15:33:47,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:47,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:47,327 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:47,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2025-03-04 15:33:47,328 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:33:47,328 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:47,348 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:33:47,351 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-04 15:33:47,352 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:33:47,352 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:33:47,352 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:33:47,352 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:33:47,352 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:33:47,352 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:47,352 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:33:47,352 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:33:47,352 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-01.c_Iteration8_Loop [2025-03-04 15:33:47,352 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:33:47,352 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:33:47,353 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:47,354 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:47,374 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:47,504 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:33:47,504 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:33:47,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:47,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:47,506 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:47,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2025-03-04 15:33:47,508 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:47,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:47,518 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:33:47,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:47,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:47,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:47,518 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:33:47,518 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:33:47,519 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:47,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2025-03-04 15:33:47,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:47,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:47,527 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-04 15:33:47,528 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-04 15:33:47,529 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:47,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:47,539 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:33:47,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:47,540 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-03-04 15:33:47,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:47,543 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:47,544 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:33:47,549 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:33:47,553 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:33:47,553 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:33:47,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:47,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:47,555 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:47,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2025-03-04 15:33:47,557 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:33:47,557 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:33:47,557 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:33:47,558 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~a~0#1) = -1*ULTIMATE.start_main_~a~0#1 + 2147483647 Supporting invariants [] [2025-03-04 15:33:47,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:47,564 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:33:47,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:47,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 15:33:47,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 15:33:47,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:47,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:47,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:33:47,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:47,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:33:47,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:33:47,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:47,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:47,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 15:33:47,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:47,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:47,856 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:33:47,856 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2025-03-04 15:33:47,856 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 84 states and 89 transitions. cyclomatic complexity: 8 Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:47,916 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 84 states and 89 transitions. cyclomatic complexity: 8. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 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) Result 168 states and 179 transitions. Complement of second has 10 states. [2025-03-04 15:33:47,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2025-03-04 15:33:47,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:47,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2025-03-04 15:33:47,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 72 letters. Loop has 8 letters. [2025-03-04 15:33:47,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:47,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 80 letters. Loop has 8 letters. [2025-03-04 15:33:47,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:47,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 72 letters. Loop has 16 letters. [2025-03-04 15:33:47,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:47,919 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 168 states and 179 transitions. [2025-03-04 15:33:47,923 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:33:47,924 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 168 states to 90 states and 96 transitions. [2025-03-04 15:33:47,925 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-04 15:33:47,925 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-04 15:33:47,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 96 transitions. [2025-03-04 15:33:47,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:33:47,925 INFO L218 hiAutomatonCegarLoop]: Abstraction has 90 states and 96 transitions. [2025-03-04 15:33:47,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 96 transitions. [2025-03-04 15:33:47,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2025-03-04 15:33:47,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 86 states have (on average 1.058139534883721) internal successors, (91), 85 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:47,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2025-03-04 15:33:47,932 INFO L240 hiAutomatonCegarLoop]: Abstraction has 86 states and 91 transitions. [2025-03-04 15:33:47,932 INFO L432 stractBuchiCegarLoop]: Abstraction has 86 states and 91 transitions. [2025-03-04 15:33:47,932 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-04 15:33:47,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 91 transitions. [2025-03-04 15:33:47,932 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:33:47,932 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:33:47,932 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:33:47,933 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [16, 16, 14, 14, 14, 2, 1, 1] [2025-03-04 15:33:47,933 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:33:47,933 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~post1#1, main_#t~bitwise2#1, main_~a~0#1, main_~b~0#1, main_~x~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~x~0#1;main_~a~0#1 := 16;main_~b~0#1 := 30;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume 0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1;main_#t~bitwise2#1 := main_~a~0#1;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1);" "assume !(0 == main_~a~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~b~0#1 < 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 >= main_~a~0#1) && ((main_~b~0#1 >= 0 && main_~a~0#1 < 0) || main_#t~bitwise2#1 >= main_~b~0#1)) && ((main_~b~0#1 < 0 || main_~a~0#1 < 0) || main_#t~bitwise2#1 <= main_~b~0#1 + main_~a~0#1)) && ((main_~b~0#1 >= 0 && main_~a~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume 0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1;main_#t~bitwise2#1 := main_~a~0#1;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" [2025-03-04 15:33:47,934 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~x~0#1 > 0;main_#t~post1#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume 0 == main_~b~0#1 || main_~b~0#1 == main_~a~0#1;main_#t~bitwise2#1 := main_~a~0#1;" "main_~b~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~x~0#1 := main_~x~0#1 - main_~b~0#1;" [2025-03-04 15:33:47,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:47,934 INFO L85 PathProgramCache]: Analyzing trace with hash 2145310998, now seen corresponding path program 8 times [2025-03-04 15:33:47,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:47,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227990917] [2025-03-04 15:33:47,934 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:33:47,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:47,940 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 78 statements into 2 equivalence classes. [2025-03-04 15:33:47,953 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 15:33:47,953 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:33:47,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:47,953 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:47,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-04 15:33:47,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 15:33:47,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:47,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:47,971 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:47,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:47,972 INFO L85 PathProgramCache]: Analyzing trace with hash 39528, now seen corresponding path program 4 times [2025-03-04 15:33:47,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:47,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691605215] [2025-03-04 15:33:47,972 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:33:47,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:47,974 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-03-04 15:33:47,974 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:33:47,974 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:33:47,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:47,974 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:47,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:33:47,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:33:47,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:47,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:47,976 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:47,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:47,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1846586675, now seen corresponding path program 9 times [2025-03-04 15:33:47,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:47,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243821254] [2025-03-04 15:33:47,977 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:33:47,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:47,982 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 81 statements into 16 equivalence classes. [2025-03-04 15:33:47,986 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 13 of 81 statements. [2025-03-04 15:33:47,986 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 15:33:47,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:48,053 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2025-03-04 15:33:48,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:33:48,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243821254] [2025-03-04 15:33:48,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243821254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:33:48,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:33:48,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 15:33:48,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834403787] [2025-03-04 15:33:48,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:33:48,080 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:33:48,080 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:33:48,080 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:33:48,080 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:33:48,080 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:33:48,081 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:48,081 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:33:48,081 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:33:48,081 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-01.c_Iteration9_Loop [2025-03-04 15:33:48,081 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:33:48,081 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:33:48,081 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:48,083 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:48,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:48,140 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:33:48,140 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:33:48,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:48,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:48,143 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:48,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2025-03-04 15:33:48,145 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:33:48,145 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:48,156 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:33:48,156 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~bitwise2#1=0} Honda state: {ULTIMATE.start_main_#t~bitwise2#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:33:48,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:48,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:48,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:48,164 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:48,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2025-03-04 15:33:48,167 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:33:48,167 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:48,178 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:33:48,179 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post1#1=0} Honda state: {ULTIMATE.start_main_#t~post1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:33:48,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2025-03-04 15:33:48,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:48,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:48,187 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:48,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2025-03-04 15:33:48,189 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:33:48,189 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:48,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:48,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:48,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:48,213 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:48,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2025-03-04 15:33:48,215 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:33:48,215 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:48,467 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:33:48,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:48,477 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:33:48,477 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:33:48,477 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:33:48,477 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:33:48,477 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:33:48,477 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:48,477 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:33:48,477 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:33:48,477 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-01.c_Iteration9_Loop [2025-03-04 15:33:48,477 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:33:48,477 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:33:48,478 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:48,479 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:48,480 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:48,523 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:33:48,523 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:33:48,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:48,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:48,525 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:48,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2025-03-04 15:33:48,527 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:48,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:48,536 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:33:48,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:48,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:48,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:48,537 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:33:48,537 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:33:48,538 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:48,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2025-03-04 15:33:48,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:48,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:48,545 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:48,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2025-03-04 15:33:48,546 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:48,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:48,555 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:33:48,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:48,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:48,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:48,556 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:33:48,556 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:33:48,557 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:48,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2025-03-04 15:33:48,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:48,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:48,564 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:48,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2025-03-04 15:33:48,565 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:48,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:48,575 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:33:48,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:48,575 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-04 15:33:48,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:48,576 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-04 15:33:48,576 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:33:48,579 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:48,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2025-03-04 15:33:48,585 INFO L451 LassoAnalysis]: Using template '2-nested'. [2025-03-04 15:33:48,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:48,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:48,587 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:48,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2025-03-04 15:33:48,589 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:48,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:48,599 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:33:48,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:48,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:48,599 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-03-04 15:33:48,600 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-03-04 15:33:48,600 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:33:48,603 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:48,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2025-03-04 15:33:48,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:48,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:48,612 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:48,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2025-03-04 15:33:48,614 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:48,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:48,624 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:33:48,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:48,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:48,624 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-03-04 15:33:48,625 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-03-04 15:33:48,625 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:33:48,626 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:33:48,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2025-03-04 15:33:48,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:48,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:48,633 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:48,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2025-03-04 15:33:48,635 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:48,644 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:48,645 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:33:48,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:48,645 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-04 15:33:48,645 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-03-04 15:33:48,647 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:33:48,647 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:33:48,652 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:33:48,655 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:33:48,656 INFO L444 ModelExtractionUtils]: 5 out of 9 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-04 15:33:48,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:48,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:48,657 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:48,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2025-03-04 15:33:48,659 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:33:48,659 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:33:48,659 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:33:48,659 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function 2-nested ranking function: f0 = -1*ULTIMATE.start_main_~a~0#1 f1 = 1*ULTIMATE.start_main_~x~0#1 Supporting invariants [] [2025-03-04 15:33:48,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2025-03-04 15:33:48,664 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:33:48,665 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: IfThenElseExpression [2025-03-04 15:33:48,665 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: IfThenElseExpression [2025-03-04 15:33:48,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:48,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-04 15:33:48,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 15:33:48,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:48,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:48,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:33:48,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:48,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:33:48,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:33:48,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:48,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:48,771 WARN L254 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:33:48,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:48,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:33:48,837 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-04 15:33:48,837 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 86 states and 91 transitions. cyclomatic complexity: 9 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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-04 15:33:48,857 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 86 states and 91 transitions. cyclomatic complexity: 9. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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 90 states and 95 transitions. Complement of second has 5 states. [2025-03-04 15:33:48,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-04 15:33:48,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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-04 15:33:48,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2025-03-04 15:33:48,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 78 letters. Loop has 3 letters. [2025-03-04 15:33:48,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:48,860 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:33:48,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:48,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-04 15:33:48,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 15:33:48,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:48,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:48,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:33:48,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:48,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:33:48,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:33:48,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:48,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:48,948 WARN L254 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 15:33:48,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:48,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2025-03-04 15:33:49,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:33:49,015 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-04 15:33:49,015 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 86 states and 91 transitions. cyclomatic complexity: 9 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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-04 15:33:49,059 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 86 states and 91 transitions. cyclomatic complexity: 9. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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 90 states and 95 transitions. Complement of second has 7 states. [2025-03-04 15:33:49,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-04 15:33:49,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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-04 15:33:49,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2025-03-04 15:33:49,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 78 letters. Loop has 3 letters. [2025-03-04 15:33:49,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:49,060 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:33:49,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:49,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-04 15:33:49,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 15:33:49,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:49,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:49,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:33:49,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:49,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:33:49,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:33:49,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:49,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:49,175 WARN L254 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:33:49,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:49,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:33:49,232 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-04 15:33:49,232 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 86 states and 91 transitions. cyclomatic complexity: 9 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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-04 15:33:49,255 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 86 states and 91 transitions. cyclomatic complexity: 9. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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 148 states and 158 transitions. Complement of second has 6 states. [2025-03-04 15:33:49,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-04 15:33:49,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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-04 15:33:49,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2025-03-04 15:33:49,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 78 letters. Loop has 3 letters. [2025-03-04 15:33:49,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:49,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 81 letters. Loop has 3 letters. [2025-03-04 15:33:49,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:49,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 78 letters. Loop has 6 letters. [2025-03-04 15:33:49,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:49,258 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 148 states and 158 transitions. [2025-03-04 15:33:49,259 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 15:33:49,259 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 148 states to 0 states and 0 transitions. [2025-03-04 15:33:49,259 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-04 15:33:49,259 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-04 15:33:49,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-04 15:33:49,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:33:49,259 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:33:49,259 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:33:49,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:33:49,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 15:33:49,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:33:49,260 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:49,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:33:49,260 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-03-04 15:33:49,260 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-03-04 15:33:49,260 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 15:33:49,260 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 15:33:49,260 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-04 15:33:49,260 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-04 15:33:49,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-04 15:33:49,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:33:49,260 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:33:49,260 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:33:49,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 15:33:49,261 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:33:49,261 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-04 15:33:49,261 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-04 15:33:49,261 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 15:33:49,261 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-04 15:33:49,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 04.03 03:33:49 BoogieIcfgContainer [2025-03-04 15:33:49,269 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-04 15:33:49,269 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:33:49,269 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:33:49,269 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:33:49,270 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:33:28" (3/4) ... [2025-03-04 15:33:49,272 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 15:33:49,272 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:33:49,273 INFO L158 Benchmark]: Toolchain (without parser) took 20984.30ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 113.5MB in the beginning and 184.4MB in the end (delta: -70.9MB). Peak memory consumption was 57.4MB. Max. memory is 16.1GB. [2025-03-04 15:33:49,273 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:33:49,274 INFO L158 Benchmark]: CACSL2BoogieTranslator took 119.88ms. Allocated memory is still 142.6MB. Free memory was 113.5MB in the beginning and 103.7MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:33:49,274 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.87ms. Allocated memory is still 142.6MB. Free memory was 103.7MB in the beginning and 102.7MB in the end (delta: 999.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:33:49,275 INFO L158 Benchmark]: Boogie Preprocessor took 23.07ms. Allocated memory is still 142.6MB. Free memory was 102.7MB in the beginning and 101.7MB in the end (delta: 947.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:33:49,275 INFO L158 Benchmark]: IcfgBuilder took 199.97ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 90.8MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:33:49,275 INFO L158 Benchmark]: BuchiAutomizer took 20609.22ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 90.8MB in the beginning and 184.4MB in the end (delta: -93.6MB). Peak memory consumption was 32.2MB. Max. memory is 16.1GB. [2025-03-04 15:33:49,276 INFO L158 Benchmark]: Witness Printer took 3.05ms. Allocated memory is still 268.4MB. Free memory was 184.4MB in the beginning and 184.4MB in the end (delta: 54.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:33:49,277 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.21ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 119.88ms. Allocated memory is still 142.6MB. Free memory was 113.5MB in the beginning and 103.7MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.87ms. Allocated memory is still 142.6MB. Free memory was 103.7MB in the beginning and 102.7MB in the end (delta: 999.7kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.07ms. Allocated memory is still 142.6MB. Free memory was 102.7MB in the beginning and 101.7MB in the end (delta: 947.9kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 199.97ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 90.8MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 20609.22ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 90.8MB in the beginning and 184.4MB in the end (delta: -93.6MB). Peak memory consumption was 32.2MB. Max. memory is 16.1GB. * Witness Printer took 3.05ms. Allocated memory is still 268.4MB. Free memory was 184.4MB in the beginning and 184.4MB in the end (delta: 54.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: IfThenElseExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: IfThenElseExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: IfThenElseExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: IfThenElseExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: IfThenElseExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: IfThenElseExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: IfThenElseExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: IfThenElseExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (6 trivial, 5 deterministic, 2 nondeterministic). One deterministic module has 2-nested ranking function null, null and consists of 5 locations. One deterministic module has 2-nested ranking function null, null and consists of 4 locations. One deterministic module has affine ranking function x and consists of 8 locations. One deterministic module has 2-nested ranking function null, null and consists of 4 locations. One deterministic module has affine ranking function (2147483647 + ((long) -1 * a)) and consists of 6 locations. One nondeterministic module has affine ranking function x and consists of 25 locations. One nondeterministic module has 2-nested ranking function null, null and consists of 4 locations. 6 modules have a trivial ranking function, the largest among these consists of 58 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 20.5s and 10 iterations. TraceHistogramMax:16. Analysis of lassos took 15.8s. Construction of modules took 0.6s. Büchi inclusion checks took 3.8s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 9. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 21 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 [5, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/3 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 323 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 316 mSDsluCounter, 166 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 86 mSDsCounter, 231 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1511 IncrementalHoareTripleChecker+Invalid, 1742 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 231 mSolverCounterUnsat, 80 mSDtfsCounter, 1511 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT2 SILN2 SILU0 SILI0 SILT2 lasso2 LassoPreprocessingBenchmarks: Lassos: inital58 mio100 ax100 hnf100 lsp107 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq157 hnf95 smp100 dnf950 smp53 tf101 neg100 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 1742ms VariablesStem: 3 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 7 SupportingInvariants: 14 MotzkinApplications: 126 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 22 LassoNonterminationAnalysisSatUnbounded: 4 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.7s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-03-04 15:33:49,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:49,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:49,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:49,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE