./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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/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-?-e2fb8be-m [2025-03-09 06:47:07,056 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:47:07,108 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-09 06:47:07,112 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:47:07,112 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:47:07,112 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-09 06:47:07,132 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:47:07,133 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:47:07,133 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:47:07,133 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:47:07,133 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:47:07,133 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:47:07,134 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:47:07,134 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:47:07,134 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-09 06:47:07,134 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-09 06:47:07,134 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-09 06:47:07,134 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-09 06:47:07,134 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-09 06:47:07,134 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-09 06:47:07,134 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:47:07,134 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-09 06:47:07,135 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:47:07,135 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:47:07,135 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-09 06:47:07,135 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-09 06:47:07,135 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-09 06:47:07,135 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:47:07,135 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:47:07,135 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-09 06:47:07,135 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:47:07,135 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:47:07,135 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:47:07,135 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:47:07,136 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:47:07,136 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:47:07,136 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-09 06:47:07,136 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-09 06:47:07,365 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:47:07,374 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:47:07,377 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:47:07,378 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:47:07,378 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:47:07,379 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-09 06:47:08,659 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bbe24af1/e25305a2e52d4e30bc6f15ff9feafba5/FLAG02f4cb353 [2025-03-09 06:47:08,870 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:47:08,872 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-bwb/or-01.c [2025-03-09 06:47:08,879 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bbe24af1/e25305a2e52d4e30bc6f15ff9feafba5/FLAG02f4cb353 [2025-03-09 06:47:08,896 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bbe24af1/e25305a2e52d4e30bc6f15ff9feafba5 [2025-03-09 06:47:08,898 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:47:08,900 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:47:08,901 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:47:08,901 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:47:08,905 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:47:08,906 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:47:08" (1/1) ... [2025-03-09 06:47:08,906 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fdd9ed9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:08, skipping insertion in model container [2025-03-09 06:47:08,907 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:47:08" (1/1) ... [2025-03-09 06:47:08,918 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:47:09,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:47:09,024 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:47:09,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:47:09,041 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:47:09,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:09 WrapperNode [2025-03-09 06:47:09,042 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:47:09,043 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:47:09,043 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:47:09,043 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:47:09,047 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:09" (1/1) ... [2025-03-09 06:47:09,050 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:09" (1/1) ... [2025-03-09 06:47:09,060 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 26 [2025-03-09 06:47:09,061 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:47:09,062 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:47:09,062 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:47:09,062 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:47:09,067 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:09" (1/1) ... [2025-03-09 06:47:09,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:09" (1/1) ... [2025-03-09 06:47:09,069 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:09" (1/1) ... [2025-03-09 06:47:09,075 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-09 06:47:09,075 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:09" (1/1) ... [2025-03-09 06:47:09,076 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:09" (1/1) ... [2025-03-09 06:47:09,077 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:09" (1/1) ... [2025-03-09 06:47:09,077 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:09" (1/1) ... [2025-03-09 06:47:09,078 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:09" (1/1) ... [2025-03-09 06:47:09,078 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:09" (1/1) ... [2025-03-09 06:47:09,081 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:47:09,082 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:47:09,083 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:47:09,083 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:47:09,084 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:09" (1/1) ... [2025-03-09 06:47:09,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:09,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:09,110 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:09,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-09 06:47:09,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:47:09,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:47:09,167 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:47:09,169 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:47:09,254 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-09 06:47:09,255 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:47:09,268 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:47:09,269 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 06:47:09,270 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:47:09 BoogieIcfgContainer [2025-03-09 06:47:09,270 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:47:09,271 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-09 06:47:09,271 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-09 06:47:09,275 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-09 06:47:09,275 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:47:09,276 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.03 06:47:08" (1/3) ... [2025-03-09 06:47:09,276 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4e85270f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 06:47:09, skipping insertion in model container [2025-03-09 06:47:09,277 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:47:09,277 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:09" (2/3) ... [2025-03-09 06:47:09,277 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4e85270f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 06:47:09, skipping insertion in model container [2025-03-09 06:47:09,277 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:47:09,277 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:47:09" (3/3) ... [2025-03-09 06:47:09,278 INFO L363 chiAutomizerObserver]: Analyzing ICFG or-01.c [2025-03-09 06:47:09,313 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-09 06:47:09,313 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-09 06:47:09,313 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-09 06:47:09,314 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-09 06:47:09,314 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-09 06:47:09,314 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-09 06:47:09,314 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-09 06:47:09,314 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-09 06:47:09,317 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-09 06:47:09,326 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-09 06:47:09,327 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:47:09,327 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:47:09,329 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-09 06:47:09,330 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 06:47:09,330 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-09 06:47:09,330 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-09 06:47:09,331 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-09 06:47:09,331 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:47:09,332 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:47:09,332 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-09 06:47:09,332 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 06:47:09,337 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-09 06:47:09,337 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-09 06:47:09,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:09,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1344, now seen corresponding path program 1 times [2025-03-09 06:47:09,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:09,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753408707] [2025-03-09 06:47:09,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:47:09,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:09,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:47:09,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:47:09,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:09,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:09,404 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:47:09,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:47:09,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:47:09,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:09,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:09,416 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:47:09,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:09,418 INFO L85 PathProgramCache]: Analyzing trace with hash 39528, now seen corresponding path program 1 times [2025-03-09 06:47:09,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:09,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380363377] [2025-03-09 06:47:09,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:47:09,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:09,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:47:09,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:47:09,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:09,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:09,426 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:47:09,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:47:09,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:47:09,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:09,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:09,430 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:47:09,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:09,431 INFO L85 PathProgramCache]: Analyzing trace with hash 40048841, now seen corresponding path program 1 times [2025-03-09 06:47:09,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:09,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3223135] [2025-03-09 06:47:09,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:47:09,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:09,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:47:09,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:47:09,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:09,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:47:09,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:47:09,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:47:09,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3223135] [2025-03-09 06:47:09,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3223135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:47:09,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:47:09,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 06:47:09,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022399502] [2025-03-09 06:47:09,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:47:09,623 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:47:09,623 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:47:09,623 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:47:09,624 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:47:09,624 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 06:47:09,624 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:09,624 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:47:09,624 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:47:09,624 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-01.c_Iteration1_Loop [2025-03-09 06:47:09,624 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:47:09,624 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:47:09,634 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:09,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:09,643 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:09,753 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:47:09,753 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 06:47:09,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:09,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:09,758 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:09,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-09 06:47:09,760 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:47:09,760 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:47:09,775 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:47:09,775 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-09 06:47:09,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-03-09 06:47:09,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:09,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:09,786 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:09,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-09 06:47:09,788 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:47:09,788 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:47:09,799 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:47:09,799 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-09 06:47:09,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-03-09 06:47:09,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:09,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:09,808 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:09,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-09 06:47:09,810 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:47:09,810 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:47:09,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-03-09 06:47:09,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:09,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:09,839 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:09,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-09 06:47:09,841 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 06:47:09,841 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:47:10,111 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 06:47:10,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-03-09 06:47:10,123 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:47:10,123 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:47:10,123 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:47:10,123 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:47:10,123 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:47:10,123 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:10,123 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:47:10,123 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:47:10,123 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-01.c_Iteration1_Loop [2025-03-09 06:47:10,123 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:47:10,123 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:47:10,127 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:10,140 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:10,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:10,259 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:47:10,262 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:47:10,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:10,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:10,268 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:10,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-09 06:47:10,272 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:47:10,285 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:10,285 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:47:10,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:10,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:10,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:10,291 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:47:10,292 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:47:10,297 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:10,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-03-09 06:47:10,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:10,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:10,307 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:10,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-09 06:47:10,310 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:47:10,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:10,320 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:47:10,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:10,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:10,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:10,320 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:47:10,320 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:47:10,322 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:10,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-03-09 06:47:10,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:10,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:10,329 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:10,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-09 06:47:10,330 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:47:10,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:10,341 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:47:10,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:10,341 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-09 06:47:10,341 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:10,345 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-09 06:47:10,345 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:47:10,349 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:10,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-03-09 06:47:10,358 INFO L451 LassoAnalysis]: Using template '2-nested'. [2025-03-09 06:47:10,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:10,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:10,361 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:10,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-09 06:47:10,363 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:47:10,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:10,374 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:47:10,374 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:10,374 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:10,374 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-03-09 06:47:10,375 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-03-09 06:47:10,375 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:47:10,376 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:10,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-03-09 06:47:10,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:10,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:10,384 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:10,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-09 06:47:10,387 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:47:10,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:10,398 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:47:10,398 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:10,398 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:10,398 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-03-09 06:47:10,398 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-03-09 06:47:10,399 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:47:10,400 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:10,406 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-09 06:47:10,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:10,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:10,408 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:10,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-09 06:47:10,411 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:47:10,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:10,421 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:47:10,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:10,421 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-09 06:47:10,422 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-03-09 06:47:10,425 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:47:10,426 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:47:10,445 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:47:10,449 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 06:47:10,451 INFO L444 ModelExtractionUtils]: 6 out of 9 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-09 06:47:10,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:10,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:10,454 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:10,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-03-09 06:47:10,457 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:47:10,457 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 06:47:10,457 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:47:10,458 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-09 06:47:10,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-03-09 06:47:10,470 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 06:47:10,479 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: IfThenElseExpression [2025-03-09 06:47:10,479 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: IfThenElseExpression [2025-03-09 06:47:10,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:10,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:47:10,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:47:10,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:10,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:47:10,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:47:10,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:47:10,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:47:10,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:47:10,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:10,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:47:10,518 WARN L254 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:47:10,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:47:10,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:47:10,708 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-09 06:47:10,711 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-09 06:47:10,826 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-09 06:47:10,828 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-09 06:47:10,831 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-09 06:47:10,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 9 transitions. [2025-03-09 06:47:10,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 2 letters. Loop has 3 letters. [2025-03-09 06:47:10,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:47:10,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 5 letters. Loop has 3 letters. [2025-03-09 06:47:10,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:47:10,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 2 letters. Loop has 6 letters. [2025-03-09 06:47:10,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:47:10,839 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 33 transitions. [2025-03-09 06:47:10,842 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-09 06:47:10,844 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 18 states and 23 transitions. [2025-03-09 06:47:10,844 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-03-09 06:47:10,845 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2025-03-09 06:47:10,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2025-03-09 06:47:10,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:47:10,846 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 23 transitions. [2025-03-09 06:47:10,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2025-03-09 06:47:10,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 14. [2025-03-09 06:47:10,867 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-09 06:47:10,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2025-03-09 06:47:10,868 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions. [2025-03-09 06:47:10,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:47:10,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:47:10,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:47:10,872 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-09 06:47:10,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:47:10,897 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2025-03-09 06:47:10,898 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2025-03-09 06:47:10,898 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-09 06:47:10,900 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 16 transitions. [2025-03-09 06:47:10,900 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2025-03-09 06:47:10,900 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-03-09 06:47:10,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2025-03-09 06:47:10,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:47:10,901 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 16 transitions. [2025-03-09 06:47:10,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2025-03-09 06:47:10,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2025-03-09 06:47:10,901 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-09 06:47:10,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2025-03-09 06:47:10,902 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 15 transitions. [2025-03-09 06:47:10,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:47:10,903 INFO L432 stractBuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2025-03-09 06:47:10,903 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-09 06:47:10,903 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2025-03-09 06:47:10,903 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-09 06:47:10,903 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:47:10,903 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:47:10,903 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-09 06:47:10,903 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 06:47:10,904 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-09 06:47:10,904 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-09 06:47:10,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:10,904 INFO L85 PathProgramCache]: Analyzing trace with hash 40048998, now seen corresponding path program 1 times [2025-03-09 06:47:10,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:10,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789855048] [2025-03-09 06:47:10,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:47:10,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:10,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:47:10,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:47:10,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:10,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:47:10,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:47:10,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:47:10,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789855048] [2025-03-09 06:47:10,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789855048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:47:10,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:47:10,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:47:10,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734660120] [2025-03-09 06:47:10,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:47:10,936 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:47:10,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:10,937 INFO L85 PathProgramCache]: Analyzing trace with hash 32988, now seen corresponding path program 2 times [2025-03-09 06:47:10,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:10,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971397072] [2025-03-09 06:47:10,940 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:47:10,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:10,943 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:47:10,949 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:47:10,950 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:47:10,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:10,950 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:47:10,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:47:10,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:47:10,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:10,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:10,954 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:47:11,002 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:47:11,003 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:47:11,003 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:47:11,003 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:47:11,003 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 06:47:11,003 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:11,003 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:47:11,003 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:47:11,003 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-01.c_Iteration2_Loop [2025-03-09 06:47:11,003 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:47:11,003 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:47:11,004 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:11,015 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:11,017 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:11,077 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:47:11,078 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 06:47:11,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:11,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:11,080 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:11,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-03-09 06:47:11,082 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:47:11,082 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:47:11,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-03-09 06:47:11,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:11,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:11,101 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:11,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-03-09 06:47:11,103 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 06:47:11,103 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:47:11,224 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 06:47:11,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-03-09 06:47:11,231 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:47:11,231 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:47:11,231 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:47:11,231 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:47:11,231 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:47:11,231 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:11,231 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:47:11,231 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:47:11,231 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-01.c_Iteration2_Loop [2025-03-09 06:47:11,231 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:47:11,231 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:47:11,232 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:11,234 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:11,236 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:11,308 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:47:11,309 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:47:11,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:11,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:11,315 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:11,316 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:47:11,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-03-09 06:47:11,327 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:11,328 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:47:11,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:11,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:11,328 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:11,328 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:47:11,328 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:47:11,330 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:11,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-03-09 06:47:11,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:11,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:11,338 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:11,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-03-09 06:47:11,340 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:47:11,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:11,351 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:47:11,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:11,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:11,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:11,351 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:47:11,351 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:47:11,353 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:11,358 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-09 06:47:11,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:11,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:11,360 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:11,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-03-09 06:47:11,362 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:47:11,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:11,372 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:47:11,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:11,372 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-09 06:47:11,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:11,374 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-09 06:47:11,374 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:47:11,381 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:11,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-03-09 06:47:11,387 INFO L451 LassoAnalysis]: Using template '2-nested'. [2025-03-09 06:47:11,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:11,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:11,389 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:11,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-03-09 06:47:11,391 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:47:11,401 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:11,401 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:47:11,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:11,401 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:11,402 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-03-09 06:47:11,402 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-03-09 06:47:11,402 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:47:11,403 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:11,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-03-09 06:47:11,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:11,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:11,410 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:11,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-03-09 06:47:11,412 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:47:11,422 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:11,422 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:47:11,422 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:11,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:11,422 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-03-09 06:47:11,424 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-03-09 06:47:11,424 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:47:11,425 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:11,430 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-09 06:47:11,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:11,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:11,432 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:11,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-03-09 06:47:11,435 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:47:11,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:11,446 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:47:11,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:11,446 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-09 06:47:11,446 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-03-09 06:47:11,450 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:47:11,450 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:47:11,454 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:47:11,459 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-03-09 06:47:11,459 INFO L444 ModelExtractionUtils]: 3 out of 9 variables were initially zero. Simplification set additionally 2 variables to zero. [2025-03-09 06:47:11,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:11,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:11,461 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:11,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-03-09 06:47:11,462 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:47:11,462 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 06:47:11,463 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:47:11,463 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-09 06:47:11,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-03-09 06:47:11,469 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 06:47:11,470 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: IfThenElseExpression [2025-03-09 06:47:11,471 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: IfThenElseExpression [2025-03-09 06:47:11,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:11,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:47:11,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:47:11,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:11,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:47:11,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:47:11,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:47:11,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:47:11,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:47:11,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:11,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:47:11,503 WARN L254 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 06:47:11,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:47:11,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-03-09 06:47:11,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-03-09 06:47:11,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:47:11,670 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-09 06:47:11,670 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-09 06:47:11,700 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-09 06:47:11,700 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-09 06:47:11,701 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-09 06:47:11,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2025-03-09 06:47:11,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 3 letters. [2025-03-09 06:47:11,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:47:11,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 8 letters. Loop has 3 letters. [2025-03-09 06:47:11,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:47:11,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 6 letters. [2025-03-09 06:47:11,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:47:11,702 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 37 transitions. [2025-03-09 06:47:11,705 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-03-09 06:47:11,706 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 27 states and 35 transitions. [2025-03-09 06:47:11,706 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2025-03-09 06:47:11,706 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2025-03-09 06:47:11,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2025-03-09 06:47:11,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:47:11,706 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 35 transitions. [2025-03-09 06:47:11,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2025-03-09 06:47:11,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2025-03-09 06:47:11,707 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-09 06:47:11,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2025-03-09 06:47:11,707 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 33 transitions. [2025-03-09 06:47:11,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:47:11,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:47:11,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:47:11,708 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-09 06:47:11,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:47:11,715 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2025-03-09 06:47:11,715 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2025-03-09 06:47:11,716 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-09 06:47:11,716 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 10 states and 11 transitions. [2025-03-09 06:47:11,716 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-09 06:47:11,716 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-09 06:47:11,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2025-03-09 06:47:11,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:47:11,716 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 11 transitions. [2025-03-09 06:47:11,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2025-03-09 06:47:11,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-03-09 06:47:11,717 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-09 06:47:11,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2025-03-09 06:47:11,717 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 10 transitions. [2025-03-09 06:47:11,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:47:11,717 INFO L432 stractBuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2025-03-09 06:47:11,717 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-09 06:47:11,717 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2025-03-09 06:47:11,718 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-09 06:47:11,718 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:47:11,718 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:47:11,718 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-09 06:47:11,718 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-09 06:47:11,718 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-09 06:47:11,718 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-09 06:47:11,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:11,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1291903, now seen corresponding path program 1 times [2025-03-09 06:47:11,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:11,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567096035] [2025-03-09 06:47:11,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:47:11,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:11,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:47:11,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:47:11,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:11,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:11,721 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:47:11,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:47:11,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:47:11,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:11,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:11,728 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:47:11,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:11,728 INFO L85 PathProgramCache]: Analyzing trace with hash 36437595, now seen corresponding path program 1 times [2025-03-09 06:47:11,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:11,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239312507] [2025-03-09 06:47:11,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:47:11,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:11,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:47:11,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:47:11,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:11,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:11,738 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:47:11,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:47:11,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:47:11,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:11,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:11,743 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:47:11,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:11,744 INFO L85 PathProgramCache]: Analyzing trace with hash 2130486941, now seen corresponding path program 1 times [2025-03-09 06:47:11,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:11,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971774882] [2025-03-09 06:47:11,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:47:11,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:11,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:47:11,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:47:11,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:11,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:11,761 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:47:11,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:47:11,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:47:11,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:11,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:11,775 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:47:11,932 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:47:11,932 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:47:11,933 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:47:11,933 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:47:11,933 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 06:47:11,933 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:11,933 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:47:11,933 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:47:11,933 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-01.c_Iteration3_Loop [2025-03-09 06:47:11,933 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:47:11,933 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:47:11,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:11,970 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:11,972 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:12,017 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2025-03-09 06:47:12,328 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:47:12,328 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 06:47:12,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:12,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:12,330 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-09 06:47:12,333 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:47:12,333 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:47:12,336 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-09 06:47:12,360 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-09 06:47:12,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:12,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:12,369 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-09 06:47:12,370 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-09 06:47:12,370 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 06:47:12,370 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:47:12,396 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:47:12,396 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-09 06:47:12,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-03-09 06:47:12,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:12,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:12,407 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:12,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-03-09 06:47:12,410 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:47:12,410 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:47:12,421 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:47:12,421 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-09 06:47:12,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-03-09 06:47:12,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:12,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:12,428 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:12,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-03-09 06:47:12,431 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:47:12,431 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:47:12,442 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:47:12,442 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-09 06:47:12,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-03-09 06:47:12,468 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:47:12,468 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:47:12,468 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:47:12,468 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:47:12,468 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 06:47:12,468 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:12,468 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:47:12,468 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:47:12,468 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-01.c_Iteration3_Lasso [2025-03-09 06:47:12,468 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:47:12,468 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:47:12,469 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:12,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:12,472 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:12,511 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:12,513 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:12,568 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2025-03-09 06:47:12,908 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:47:12,909 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 06:47:12,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:12,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:12,912 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:12,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-03-09 06:47:12,915 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:47:12,915 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:47:12,930 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:47:12,930 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-09 06:47:12,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-03-09 06:47:12,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:12,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:12,939 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:12,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-03-09 06:47:12,942 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:47:12,942 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:47:12,954 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:47:12,954 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-09 06:47:12,959 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-09 06:47:12,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:12,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:12,961 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:12,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-03-09 06:47:12,963 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:47:12,963 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:47:12,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-03-09 06:47:12,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:12,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:12,982 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:12,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-03-09 06:47:12,984 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 06:47:12,984 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:47:13,008 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 06:47:13,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-03-09 06:47:13,013 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:47:13,013 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:47:13,013 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:47:13,013 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:47:13,013 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:47:13,013 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:13,013 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:47:13,013 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:47:13,013 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-01.c_Iteration3_Lasso [2025-03-09 06:47:13,013 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:47:13,013 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:47:13,014 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:13,016 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:13,018 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:13,051 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:13,056 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:13,102 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2025-03-09 06:47:13,365 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:47:13,365 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:47:13,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:13,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:13,367 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:13,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-03-09 06:47:13,369 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:47:13,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:13,379 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:47:13,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:13,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:13,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:13,379 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:47:13,379 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:47:13,380 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:13,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-03-09 06:47:13,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:13,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:13,387 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:13,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-03-09 06:47:13,389 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:47:13,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:13,399 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:47:13,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:13,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:13,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:13,399 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:47:13,399 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:47:13,400 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:13,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-03-09 06:47:13,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:13,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:13,407 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:13,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-03-09 06:47:13,409 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:47:13,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:13,419 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:13,419 INFO L204 nArgumentSynthesizer]: 7 loop disjuncts [2025-03-09 06:47:13,419 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:13,480 INFO L401 nArgumentSynthesizer]: We have 126 Motzkin's Theorem applications. [2025-03-09 06:47:13,480 INFO L402 nArgumentSynthesizer]: A total of 14 supporting invariants were added. [2025-03-09 06:47:14,583 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:47:15,178 INFO L443 ModelExtractionUtils]: Simplification made 31 calls to the SMT solver. [2025-03-09 06:47:15,179 INFO L444 ModelExtractionUtils]: 27 out of 61 variables were initially zero. Simplification set additionally 17 variables to zero. [2025-03-09 06:47:15,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:15,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:15,182 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:15,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-03-09 06:47:15,184 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:47:15,207 INFO L438 nArgumentSynthesizer]: Removed 11 redundant supporting invariants from a total of 14. [2025-03-09 06:47:15,207 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:47:15,207 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, 2*ULTIMATE.start_main_~x~0#1 - 1 >= 0, 1*ULTIMATE.start_main_~a~0#1 >= 0] [2025-03-09 06:47:15,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2025-03-09 06:47:15,243 INFO L156 tatePredicateManager]: 1 out of 3 supporting invariants were superfluous and have been removed [2025-03-09 06:47:15,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:15,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:47:15,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:47:15,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:15,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:47:15,272 WARN L254 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 06:47:15,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:47:15,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:47:15,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:47:15,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:15,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:47:15,307 WARN L254 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 06:47:15,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:47:15,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:47:15,405 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-09 06:47:15,406 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-09 06:47:15,465 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-09 06:47:15,466 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-09 06:47:15,466 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-09 06:47:15,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2025-03-09 06:47:15,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. Stem has 4 letters. Loop has 5 letters. [2025-03-09 06:47:15,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:47:15,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. Stem has 9 letters. Loop has 5 letters. [2025-03-09 06:47:15,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:47:15,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. Stem has 4 letters. Loop has 10 letters. [2025-03-09 06:47:15,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:47:15,468 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 24 transitions. [2025-03-09 06:47:15,469 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-09 06:47:15,469 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 16 states and 18 transitions. [2025-03-09 06:47:15,469 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-09 06:47:15,469 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-09 06:47:15,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 18 transitions. [2025-03-09 06:47:15,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:47:15,473 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 18 transitions. [2025-03-09 06:47:15,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 18 transitions. [2025-03-09 06:47:15,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2025-03-09 06:47:15,473 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-09 06:47:15,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2025-03-09 06:47:15,473 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 17 transitions. [2025-03-09 06:47:15,473 INFO L432 stractBuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2025-03-09 06:47:15,473 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-09 06:47:15,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2025-03-09 06:47:15,474 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-09 06:47:15,474 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:47:15,474 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:47:15,474 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:47:15,474 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 06:47:15,474 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-09 06:47:15,474 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-09 06:47:15,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:15,475 INFO L85 PathProgramCache]: Analyzing trace with hash 2130486936, now seen corresponding path program 1 times [2025-03-09 06:47:15,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:15,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103230099] [2025-03-09 06:47:15,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:47:15,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:15,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:47:15,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:47:15,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:15,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:47:15,566 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-09 06:47:15,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:47:15,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103230099] [2025-03-09 06:47:15,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103230099] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:47:15,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074045588] [2025-03-09 06:47:15,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:47:15,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:47:15,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:15,569 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-09 06:47:15,569 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-09 06:47:15,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:47:15,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:47:15,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:15,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:47:15,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 06:47:15,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:47:15,634 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-09 06:47:15,634 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:47:15,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2025-03-09 06:47:15,769 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-09 06:47:15,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074045588] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:47:15,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:47:15,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 15 [2025-03-09 06:47:15,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671239507] [2025-03-09 06:47:15,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:47:15,770 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:47:15,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:15,770 INFO L85 PathProgramCache]: Analyzing trace with hash 32988, now seen corresponding path program 3 times [2025-03-09 06:47:15,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:15,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289413926] [2025-03-09 06:47:15,770 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:47:15,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:15,772 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:47:15,774 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:47:15,774 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 06:47:15,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:15,774 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:47:15,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:47:15,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:47:15,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:15,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:15,777 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:47:15,804 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:47:15,804 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:47:15,804 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:47:15,804 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:47:15,804 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 06:47:15,804 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:15,804 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:47:15,804 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:47:15,804 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-01.c_Iteration4_Loop [2025-03-09 06:47:15,804 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:47:15,804 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:47:15,805 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:15,807 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:15,808 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:15,863 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:47:15,863 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 06:47:15,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:15,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:15,865 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:15,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-03-09 06:47:15,867 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:47:15,867 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:47:15,878 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:47:15,879 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-09 06:47:15,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-03-09 06:47:15,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:15,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:15,886 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:15,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-03-09 06:47:15,889 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:47:15,889 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:47:15,900 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:47:15,900 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-09 06:47:15,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-03-09 06:47:15,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:15,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:15,908 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:15,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-03-09 06:47:15,909 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:47:15,909 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:47:15,925 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-09 06:47:15,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:15,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:15,927 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:15,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-03-09 06:47:15,929 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 06:47:15,929 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:47:16,111 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 06:47:16,117 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-09 06:47:16,117 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:47:16,117 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:47:16,117 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:47:16,117 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:47:16,117 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:47:16,118 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:16,118 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:47:16,118 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:47:16,118 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-01.c_Iteration4_Loop [2025-03-09 06:47:16,118 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:47:16,118 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:47:16,118 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:16,123 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:16,124 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:16,174 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:47:16,174 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:47:16,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:16,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:16,176 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:16,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-03-09 06:47:16,178 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:47:16,188 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:16,188 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:47:16,188 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:16,188 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:16,188 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:16,189 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:47:16,189 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:47:16,190 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:16,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-03-09 06:47:16,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:16,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:16,197 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:16,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-03-09 06:47:16,199 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:47:16,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:16,210 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:47:16,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:16,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:16,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:16,210 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:47:16,210 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:47:16,211 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:16,217 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-09 06:47:16,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:16,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:16,221 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:16,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-03-09 06:47:16,223 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:47:16,233 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:16,233 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:47:16,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:16,233 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-09 06:47:16,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:16,235 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-09 06:47:16,235 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:47:16,238 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:16,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2025-03-09 06:47:16,244 INFO L451 LassoAnalysis]: Using template '2-nested'. [2025-03-09 06:47:16,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:16,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:16,245 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:16,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-03-09 06:47:16,248 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:47:16,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:16,258 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:47:16,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:16,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:16,258 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-03-09 06:47:16,258 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-03-09 06:47:16,258 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:47:16,259 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:16,264 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-09 06:47:16,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:16,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:16,266 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:16,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-03-09 06:47:16,268 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:47:16,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:16,279 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:47:16,279 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:16,279 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:16,279 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-03-09 06:47:16,279 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-03-09 06:47:16,279 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:47:16,281 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:16,287 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-09 06:47:16,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:16,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:16,289 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:16,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-03-09 06:47:16,291 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:47:16,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:16,301 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:47:16,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:16,301 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-09 06:47:16,301 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-03-09 06:47:16,303 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:47:16,303 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:47:16,307 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:47:16,311 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 06:47:16,311 INFO L444 ModelExtractionUtils]: 4 out of 9 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-09 06:47:16,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:16,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:16,313 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-09 06:47:16,314 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-09 06:47:16,314 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:47:16,314 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 06:47:16,314 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:47:16,314 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-09 06:47:16,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2025-03-09 06:47:16,320 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 06:47:16,324 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: IfThenElseExpression [2025-03-09 06:47:16,324 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: IfThenElseExpression [2025-03-09 06:47:16,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:16,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:47:16,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:47:16,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:16,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:47:16,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:47:16,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:47:16,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:47:16,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:47:16,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:16,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:47:16,354 WARN L254 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 06:47:16,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:47:16,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:47:16,434 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-09 06:47:16,434 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-09 06:47:16,455 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-09 06:47:16,456 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-09 06:47:16,456 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-09 06:47:16,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2025-03-09 06:47:16,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 3 letters. [2025-03-09 06:47:16,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:47:16,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 12 letters. Loop has 3 letters. [2025-03-09 06:47:16,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:47:16,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 6 letters. [2025-03-09 06:47:16,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:47:16,457 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 31 transitions. [2025-03-09 06:47:16,457 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-09 06:47:16,457 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 24 states and 28 transitions. [2025-03-09 06:47:16,457 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2025-03-09 06:47:16,458 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2025-03-09 06:47:16,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2025-03-09 06:47:16,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:47:16,458 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 28 transitions. [2025-03-09 06:47:16,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2025-03-09 06:47:16,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2025-03-09 06:47:16,458 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-09 06:47:16,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2025-03-09 06:47:16,459 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 25 transitions. [2025-03-09 06:47:16,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:47:16,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 06:47:16,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2025-03-09 06:47:16,459 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-09 06:47:16,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:47:16,512 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2025-03-09 06:47:16,512 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 34 transitions. [2025-03-09 06:47:16,513 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-09 06:47:16,513 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 34 transitions. [2025-03-09 06:47:16,513 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-03-09 06:47:16,513 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-03-09 06:47:16,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 34 transitions. [2025-03-09 06:47:16,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:47:16,513 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 34 transitions. [2025-03-09 06:47:16,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 34 transitions. [2025-03-09 06:47:16,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-09 06:47:16,514 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-09 06:47:16,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2025-03-09 06:47:16,515 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 34 transitions. [2025-03-09 06:47:16,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 06:47:16,516 INFO L432 stractBuchiCegarLoop]: Abstraction has 30 states and 34 transitions. [2025-03-09 06:47:16,516 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-09 06:47:16,516 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 34 transitions. [2025-03-09 06:47:16,516 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-09 06:47:16,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:47:16,516 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:47:16,516 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 3, 3, 1, 1, 1] [2025-03-09 06:47:16,516 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-09 06:47:16,517 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-09 06:47:16,517 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-09 06:47:16,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:16,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1722326614, now seen corresponding path program 2 times [2025-03-09 06:47:16,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:16,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363368059] [2025-03-09 06:47:16,517 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:47:16,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:16,520 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-09 06:47:16,526 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 06:47:16,526 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:47:16,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:47:16,600 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-09 06:47:16,752 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-09 06:47:16,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:47:16,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363368059] [2025-03-09 06:47:16,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363368059] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:47:16,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061955223] [2025-03-09 06:47:16,752 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:47:16,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:47:16,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:16,754 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:47:16,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2025-03-09 06:47:16,772 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-09 06:47:16,779 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 06:47:16,779 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:47:16,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:47:16,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-09 06:47:16,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:47:16,908 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-09 06:47:16,908 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:47:17,149 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-09 06:47:17,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061955223] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:47:17,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:47:17,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 30 [2025-03-09 06:47:17,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518777171] [2025-03-09 06:47:17,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:47:17,150 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:47:17,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:17,150 INFO L85 PathProgramCache]: Analyzing trace with hash 36437595, now seen corresponding path program 2 times [2025-03-09 06:47:17,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:17,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021090145] [2025-03-09 06:47:17,150 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:47:17,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:17,152 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:47:17,153 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:47:17,153 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:47:17,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:17,154 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:47:17,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:47:17,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:47:17,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:17,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:17,156 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:47:17,281 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:47:17,281 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:47:17,281 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:47:17,281 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:47:17,281 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 06:47:17,281 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:17,281 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:47:17,281 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:47:17,281 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-01.c_Iteration5_Loop [2025-03-09 06:47:17,282 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:47:17,282 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:47:17,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:17,284 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:17,285 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:17,366 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2025-03-09 06:47:17,629 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:47:17,629 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 06:47:17,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:17,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:17,632 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:17,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-03-09 06:47:17,633 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:47:17,633 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:47:17,645 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:47:17,645 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-09 06:47:17,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2025-03-09 06:47:17,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:17,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:17,653 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:17,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-03-09 06:47:17,654 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:47:17,654 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:47:17,666 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:47:17,666 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-09 06:47:17,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2025-03-09 06:47:17,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:17,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:17,673 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:17,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-03-09 06:47:17,675 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:47:17,675 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:47:17,701 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-09 06:47:17,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:17,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:17,703 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:17,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-03-09 06:47:17,705 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 06:47:17,705 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:47:17,730 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:47:17,730 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-09 06:47:17,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2025-03-09 06:47:17,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:47:17,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-09 06:47:17,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=669, Unknown=0, NotChecked=0, Total=870 [2025-03-09 06:47:17,735 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-09 06:47:17,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:47:17,880 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2025-03-09 06:47:17,880 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 54 transitions. [2025-03-09 06:47:17,881 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-09 06:47:17,881 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 50 states and 54 transitions. [2025-03-09 06:47:17,881 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-03-09 06:47:17,881 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-03-09 06:47:17,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 54 transitions. [2025-03-09 06:47:17,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:47:17,882 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 54 transitions. [2025-03-09 06:47:17,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 54 transitions. [2025-03-09 06:47:17,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-09 06:47:17,883 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-09 06:47:17,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2025-03-09 06:47:17,884 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 54 transitions. [2025-03-09 06:47:17,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-09 06:47:17,887 INFO L432 stractBuchiCegarLoop]: Abstraction has 50 states and 54 transitions. [2025-03-09 06:47:17,887 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-09 06:47:17,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 54 transitions. [2025-03-09 06:47:17,887 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-09 06:47:17,887 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:47:17,887 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:47:17,888 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 8, 8, 7, 7, 1, 1, 1] [2025-03-09 06:47:17,888 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-09 06:47:17,888 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-09 06:47:17,888 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-09 06:47:17,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:17,888 INFO L85 PathProgramCache]: Analyzing trace with hash 2118080298, now seen corresponding path program 3 times [2025-03-09 06:47:17,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:17,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330819431] [2025-03-09 06:47:17,888 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:47:17,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:17,892 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 9 equivalence classes. [2025-03-09 06:47:17,922 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 06:47:17,922 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-09 06:47:17,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:47:18,399 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-09 06:47:18,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:47:18,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330819431] [2025-03-09 06:47:18,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330819431] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:47:18,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416700321] [2025-03-09 06:47:18,399 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:47:18,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:47:18,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:18,401 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-09 06:47:18,402 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-09 06:47:18,425 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 9 equivalence classes. [2025-03-09 06:47:18,443 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 06:47:18,443 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-09 06:47:18,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:47:18,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-09 06:47:18,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:47:18,867 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-09 06:47:18,867 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:47:19,539 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-09 06:47:19,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416700321] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:47:19,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:47:19,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 25] total 58 [2025-03-09 06:47:19,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349623918] [2025-03-09 06:47:19,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:47:19,540 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:47:19,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:19,541 INFO L85 PathProgramCache]: Analyzing trace with hash 36437595, now seen corresponding path program 3 times [2025-03-09 06:47:19,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:19,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743557793] [2025-03-09 06:47:19,541 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:47:19,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:19,542 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:47:19,543 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:47:19,543 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 06:47:19,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:19,544 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:47:19,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:47:19,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:47:19,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:19,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:19,545 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:47:19,676 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:47:19,676 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:47:19,676 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:47:19,676 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:47:19,676 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 06:47:19,676 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:19,676 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:47:19,676 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:47:19,676 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-01.c_Iteration6_Loop [2025-03-09 06:47:19,676 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:47:19,676 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:47:19,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:19,678 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:19,680 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:19,764 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2025-03-09 06:47:20,021 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:47:20,021 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 06:47:20,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:20,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:20,024 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:20,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-03-09 06:47:20,026 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:47:20,026 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:47:20,037 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:47:20,037 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-09 06:47:20,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2025-03-09 06:47:20,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:20,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:20,047 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:20,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-03-09 06:47:20,049 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:47:20,049 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:47:20,060 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:47:20,060 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-09 06:47:20,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-03-09 06:47:20,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:20,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:20,068 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:20,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-03-09 06:47:20,069 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:47:20,070 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:47:20,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-03-09 06:47:20,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:20,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:20,098 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:20,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-03-09 06:47:20,100 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 06:47:20,100 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:47:20,125 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:47:20,125 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-09 06:47:20,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2025-03-09 06:47:20,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:47:20,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-03-09 06:47:20,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=646, Invalid=2660, Unknown=0, NotChecked=0, Total=3306 [2025-03-09 06:47:20,131 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-09 06:47:20,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:47:20,469 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2025-03-09 06:47:20,469 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 84 transitions. [2025-03-09 06:47:20,470 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-09 06:47:20,470 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 80 states and 84 transitions. [2025-03-09 06:47:20,470 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-03-09 06:47:20,471 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-03-09 06:47:20,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 84 transitions. [2025-03-09 06:47:20,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:47:20,471 INFO L218 hiAutomatonCegarLoop]: Abstraction has 80 states and 84 transitions. [2025-03-09 06:47:20,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 84 transitions. [2025-03-09 06:47:20,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-09 06:47:20,473 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-09 06:47:20,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2025-03-09 06:47:20,474 INFO L240 hiAutomatonCegarLoop]: Abstraction has 80 states and 84 transitions. [2025-03-09 06:47:20,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-09 06:47:20,475 INFO L432 stractBuchiCegarLoop]: Abstraction has 80 states and 84 transitions. [2025-03-09 06:47:20,475 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-09 06:47:20,475 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 84 transitions. [2025-03-09 06:47:20,477 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-09 06:47:20,477 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:47:20,477 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:47:20,478 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [15, 14, 14, 13, 13, 1, 1, 1] [2025-03-09 06:47:20,478 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-09 06:47:20,478 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-09 06:47:20,478 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-09 06:47:20,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:20,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1839726742, now seen corresponding path program 4 times [2025-03-09 06:47:20,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:20,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703771881] [2025-03-09 06:47:20,480 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:47:20,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:20,485 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 72 statements into 2 equivalence classes. [2025-03-09 06:47:20,512 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 72 of 72 statements. [2025-03-09 06:47:20,512 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:47:20,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:20,512 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:47:20,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-09 06:47:20,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-09 06:47:20,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:20,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:20,534 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:47:20,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:20,535 INFO L85 PathProgramCache]: Analyzing trace with hash 36437595, now seen corresponding path program 4 times [2025-03-09 06:47:20,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:20,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140730622] [2025-03-09 06:47:20,535 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:47:20,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:20,537 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 5 statements into 2 equivalence classes. [2025-03-09 06:47:20,538 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:47:20,538 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:47:20,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:20,538 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:47:20,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:47:20,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:47:20,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:20,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:20,540 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:47:20,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:20,541 INFO L85 PathProgramCache]: Analyzing trace with hash 623392914, now seen corresponding path program 5 times [2025-03-09 06:47:20,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:20,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063254948] [2025-03-09 06:47:20,541 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:47:20,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:20,546 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 77 statements into 15 equivalence classes. [2025-03-09 06:47:20,624 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) and asserted 77 of 77 statements. [2025-03-09 06:47:20,625 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2025-03-09 06:47:20,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:20,625 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:47:20,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-09 06:47:20,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-09 06:47:20,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:20,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:20,672 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:47:20,807 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:47:20,807 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:47:20,807 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:47:20,807 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:47:20,807 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 06:47:20,807 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:20,807 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:47:20,807 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:47:20,807 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-01.c_Iteration7_Loop [2025-03-09 06:47:20,807 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:47:20,807 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:47:20,808 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:20,809 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:20,844 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:20,888 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2025-03-09 06:47:21,124 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:47:21,124 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 06:47:21,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:21,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:21,126 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:21,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-03-09 06:47:21,127 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:47:21,127 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:47:21,138 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:47:21,138 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-09 06:47:21,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2025-03-09 06:47:21,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:21,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:21,146 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:21,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-03-09 06:47:21,147 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:47:21,148 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:47:21,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2025-03-09 06:47:21,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:21,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:21,175 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:21,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-03-09 06:47:21,177 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 06:47:21,177 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:47:21,201 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:47:21,201 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-09 06:47:21,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2025-03-09 06:47:21,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:21,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:21,207 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:21,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-03-09 06:47:21,209 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:47:21,209 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:47:21,219 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:47:21,219 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-09 06:47:21,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2025-03-09 06:47:22,640 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:47:22,640 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:47:22,640 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:47:22,640 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:47:22,640 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 06:47:22,640 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:22,640 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:47:22,640 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:47:22,640 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-01.c_Iteration7_Lasso [2025-03-09 06:47:22,640 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:47:22,640 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:47:22,641 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:22,646 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:22,647 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:22,649 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:22,650 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:22,726 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2025-03-09 06:47:22,979 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:47:22,979 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 06:47:22,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:22,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:22,981 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:22,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-03-09 06:47:22,982 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:47:22,982 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:47:22,993 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:47:22,993 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-09 06:47:22,999 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-09 06:47:22,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:22,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:23,001 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:23,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-03-09 06:47:23,002 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:47:23,002 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:47:23,013 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:47:23,013 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-09 06:47:23,018 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-09 06:47:23,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:23,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:23,020 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:23,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-03-09 06:47:23,021 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:47:23,021 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:47:23,032 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:47:23,032 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-09 06:47:23,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2025-03-09 06:47:23,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:23,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:23,040 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:23,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-03-09 06:47:23,041 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:47:23,041 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:47:23,052 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:47:23,052 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-09 06:47:23,057 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-09 06:47:23,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:23,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:23,060 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:23,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-03-09 06:47:23,063 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:47:23,063 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:47:23,082 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-09 06:47:23,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:23,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:23,085 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:23,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-03-09 06:47:23,086 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 06:47:23,086 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:47:23,109 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 06:47:23,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2025-03-09 06:47:23,113 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:47:23,113 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:47:23,113 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:47:23,113 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:47:23,113 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:47:23,113 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:23,113 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:47:23,113 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:47:23,113 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-01.c_Iteration7_Lasso [2025-03-09 06:47:23,113 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:47:23,113 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:47:23,114 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:23,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:23,117 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:23,118 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:23,157 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:23,202 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2025-03-09 06:47:23,455 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:47:23,455 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:47:23,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:23,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:23,457 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:23,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-03-09 06:47:23,459 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:47:23,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:23,469 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:47:23,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:23,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:23,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:23,470 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:47:23,470 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:47:23,470 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:23,476 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-09 06:47:23,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:23,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:23,478 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:23,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2025-03-09 06:47:23,479 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:47:23,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:23,489 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:47:23,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:23,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:23,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:23,490 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:47:23,490 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:47:23,490 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:23,496 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-09 06:47:23,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:23,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:23,499 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:23,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2025-03-09 06:47:23,505 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:47:23,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:23,515 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:47:23,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:23,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:23,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:23,515 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:47:23,515 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:47:23,516 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:23,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2025-03-09 06:47:23,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:23,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:23,523 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:23,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2025-03-09 06:47:23,525 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:47:23,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:23,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:23,535 INFO L204 nArgumentSynthesizer]: 7 loop disjuncts [2025-03-09 06:47:23,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:23,591 INFO L401 nArgumentSynthesizer]: We have 126 Motzkin's Theorem applications. [2025-03-09 06:47:23,591 INFO L402 nArgumentSynthesizer]: A total of 14 supporting invariants were added. [2025-03-09 06:47:24,623 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:47:25,445 INFO L443 ModelExtractionUtils]: Simplification made 34 calls to the SMT solver. [2025-03-09 06:47:25,445 INFO L444 ModelExtractionUtils]: 21 out of 61 variables were initially zero. Simplification set additionally 24 variables to zero. [2025-03-09 06:47:25,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:25,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:25,447 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-09 06:47:25,448 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-09 06:47:25,452 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:47:25,487 INFO L438 nArgumentSynthesizer]: Removed 11 redundant supporting invariants from a total of 14. [2025-03-09 06:47:25,487 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:47:25,487 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, 2*ULTIMATE.start_main_~x~0#1 - 1 >= 0, 1*ULTIMATE.start_main_~a~0#1 >= 0] [2025-03-09 06:47:25,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2025-03-09 06:47:25,505 INFO L156 tatePredicateManager]: 1 out of 3 supporting invariants were superfluous and have been removed [2025-03-09 06:47:25,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:25,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-09 06:47:25,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-09 06:47:25,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:25,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:47:25,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-09 06:47:25,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:47:25,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:47:25,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:47:25,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:25,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:47:25,991 WARN L254 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 06:47:25,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:47:26,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:47:26,083 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-09 06:47:26,084 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-09 06:47:26,115 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-09 06:47:26,116 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-09 06:47:26,116 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-09 06:47:26,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2025-03-09 06:47:26,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 4 transitions. Stem has 72 letters. Loop has 5 letters. [2025-03-09 06:47:26,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:47:26,117 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:47:26,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:26,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-09 06:47:26,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-09 06:47:26,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:26,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:47:26,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-09 06:47:26,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2025-03-09 06:47:26,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:47:26,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:47:26,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:47:26,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:26,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:47:26,511 WARN L254 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 06:47:26,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:47:26,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:47:26,618 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-09 06:47:26,619 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-09 06:47:26,645 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-09 06:47:26,645 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-09 06:47:26,646 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-09 06:47:26,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2025-03-09 06:47:26,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 4 transitions. Stem has 72 letters. Loop has 5 letters. [2025-03-09 06:47:26,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:47:26,647 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:47:26,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:26,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-09 06:47:26,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-09 06:47:26,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:26,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:47:26,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-09 06:47:26,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:47:27,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:47:27,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:47:27,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:27,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:47:27,048 WARN L254 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 06:47:27,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:47:27,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:47:27,161 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-09 06:47:27,162 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-09 06:47:27,610 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-09 06:47:27,610 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-09 06:47:27,611 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-09 06:47:27,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 101 transitions. [2025-03-09 06:47:27,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 101 transitions. Stem has 72 letters. Loop has 5 letters. [2025-03-09 06:47:27,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:47:27,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 101 transitions. Stem has 77 letters. Loop has 5 letters. [2025-03-09 06:47:27,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:47:27,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 101 transitions. Stem has 72 letters. Loop has 10 letters. [2025-03-09 06:47:27,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:47:27,612 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 100 transitions. [2025-03-09 06:47:27,613 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2025-03-09 06:47:27,614 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 89 states and 94 transitions. [2025-03-09 06:47:27,614 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2025-03-09 06:47:27,614 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-03-09 06:47:27,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 94 transitions. [2025-03-09 06:47:27,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:47:27,614 INFO L218 hiAutomatonCegarLoop]: Abstraction has 89 states and 94 transitions. [2025-03-09 06:47:27,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 94 transitions. [2025-03-09 06:47:27,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 84. [2025-03-09 06:47:27,617 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-09 06:47:27,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2025-03-09 06:47:27,617 INFO L240 hiAutomatonCegarLoop]: Abstraction has 84 states and 89 transitions. [2025-03-09 06:47:27,617 INFO L432 stractBuchiCegarLoop]: Abstraction has 84 states and 89 transitions. [2025-03-09 06:47:27,617 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-09 06:47:27,618 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 89 transitions. [2025-03-09 06:47:27,618 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2025-03-09 06:47:27,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:47:27,619 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:47:27,620 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [15, 14, 14, 13, 13, 1, 1, 1] [2025-03-09 06:47:27,620 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2025-03-09 06:47:27,620 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-09 06:47:27,620 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-09 06:47:27,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:27,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1839726742, now seen corresponding path program 6 times [2025-03-09 06:47:27,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:27,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940297442] [2025-03-09 06:47:27,621 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:47:27,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:27,626 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 72 statements into 15 equivalence classes. [2025-03-09 06:47:27,650 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) and asserted 72 of 72 statements. [2025-03-09 06:47:27,650 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2025-03-09 06:47:27,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:27,650 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:47:27,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-09 06:47:27,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-09 06:47:27,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:27,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:27,665 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:47:27,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:27,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1114478996, now seen corresponding path program 1 times [2025-03-09 06:47:27,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:27,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31049709] [2025-03-09 06:47:27,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:47:27,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:27,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:47:27,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:47:27,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:27,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:27,669 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:47:27,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:47:27,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:47:27,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:27,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:27,671 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:47:27,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:27,672 INFO L85 PathProgramCache]: Analyzing trace with hash 59567317, now seen corresponding path program 7 times [2025-03-09 06:47:27,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:27,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852109181] [2025-03-09 06:47:27,672 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 06:47:27,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:27,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-09 06:47:27,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-09 06:47:27,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:27,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:27,688 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:47:27,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-09 06:47:27,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-09 06:47:27,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:27,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:27,706 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:47:27,897 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:47:27,897 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:47:27,897 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:47:27,897 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:47:27,897 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 06:47:27,897 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:27,897 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:47:27,897 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:47:27,897 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-01.c_Iteration8_Loop [2025-03-09 06:47:27,897 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:47:27,897 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:47:27,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:27,900 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:27,902 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:28,069 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:47:28,069 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 06:47:28,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:28,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:28,071 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:28,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2025-03-09 06:47:28,073 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:47:28,073 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:47:28,084 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:47:28,084 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-09 06:47:28,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2025-03-09 06:47:28,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:28,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:28,091 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:28,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2025-03-09 06:47:28,092 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:47:28,092 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:47:28,103 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:47:28,103 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-09 06:47:28,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2025-03-09 06:47:28,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:28,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:28,110 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:28,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2025-03-09 06:47:28,113 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:47:28,113 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:47:28,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2025-03-09 06:47:28,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:28,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:28,144 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:28,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2025-03-09 06:47:28,146 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 06:47:28,146 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:47:28,165 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 06:47:28,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2025-03-09 06:47:28,169 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:47:28,169 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:47:28,169 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:47:28,169 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:47:28,169 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:47:28,169 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:28,169 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:47:28,169 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:47:28,169 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-01.c_Iteration8_Loop [2025-03-09 06:47:28,169 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:47:28,169 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:47:28,170 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:28,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:28,193 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:28,336 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:47:28,336 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:47:28,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:28,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:28,338 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:28,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2025-03-09 06:47:28,340 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:47:28,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:28,350 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:47:28,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:28,350 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:28,350 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:28,351 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:47:28,351 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:47:28,352 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:28,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2025-03-09 06:47:28,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:28,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:28,359 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:28,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2025-03-09 06:47:28,362 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:47:28,372 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:28,372 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:47:28,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:28,372 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-03-09 06:47:28,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:28,375 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:47:28,375 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:47:28,380 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:47:28,383 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 06:47:28,383 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-09 06:47:28,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:28,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:28,385 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-09 06:47:28,386 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-09 06:47:28,386 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:47:28,386 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 06:47:28,386 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:47:28,386 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-09 06:47:28,392 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-09 06:47:28,393 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 06:47:28,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:28,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-09 06:47:28,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-09 06:47:28,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:28,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:47:28,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:47:28,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:47:28,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:47:28,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:47:28,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:28,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:47:28,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:47:28,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:47:28,656 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-09 06:47:28,657 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-09 06:47:28,657 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-09 06:47:28,709 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-09 06:47:28,710 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-09 06:47:28,710 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-09 06:47:28,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2025-03-09 06:47:28,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 72 letters. Loop has 8 letters. [2025-03-09 06:47:28,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:47:28,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 80 letters. Loop has 8 letters. [2025-03-09 06:47:28,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:47:28,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 72 letters. Loop has 16 letters. [2025-03-09 06:47:28,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:47:28,712 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 168 states and 179 transitions. [2025-03-09 06:47:28,714 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-09 06:47:28,714 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 168 states to 90 states and 96 transitions. [2025-03-09 06:47:28,714 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-09 06:47:28,714 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-09 06:47:28,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 96 transitions. [2025-03-09 06:47:28,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:47:28,714 INFO L218 hiAutomatonCegarLoop]: Abstraction has 90 states and 96 transitions. [2025-03-09 06:47:28,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 96 transitions. [2025-03-09 06:47:28,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2025-03-09 06:47:28,721 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-09 06:47:28,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2025-03-09 06:47:28,723 INFO L240 hiAutomatonCegarLoop]: Abstraction has 86 states and 91 transitions. [2025-03-09 06:47:28,723 INFO L432 stractBuchiCegarLoop]: Abstraction has 86 states and 91 transitions. [2025-03-09 06:47:28,723 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-09 06:47:28,723 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 91 transitions. [2025-03-09 06:47:28,724 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-09 06:47:28,724 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:47:28,724 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:47:28,725 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [16, 16, 14, 14, 14, 2, 1, 1] [2025-03-09 06:47:28,725 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 06:47:28,725 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-09 06:47:28,725 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-09 06:47:28,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:28,725 INFO L85 PathProgramCache]: Analyzing trace with hash 2145310998, now seen corresponding path program 8 times [2025-03-09 06:47:28,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:28,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133273477] [2025-03-09 06:47:28,726 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:47:28,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:28,730 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 78 statements into 2 equivalence classes. [2025-03-09 06:47:28,753 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 78 of 78 statements. [2025-03-09 06:47:28,753 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:47:28,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:28,753 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:47:28,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-09 06:47:28,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2025-03-09 06:47:28,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-09 06:47:28,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:28,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:28,769 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:47:28,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:28,770 INFO L85 PathProgramCache]: Analyzing trace with hash 39528, now seen corresponding path program 4 times [2025-03-09 06:47:28,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:28,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849215969] [2025-03-09 06:47:28,771 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:47:28,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:28,772 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-03-09 06:47:28,772 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:47:28,772 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:47:28,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:28,773 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:47:28,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:47:28,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:47:28,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:28,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:28,774 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:47:28,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:28,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1846586675, now seen corresponding path program 9 times [2025-03-09 06:47:28,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:28,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254965591] [2025-03-09 06:47:28,775 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:47:28,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:28,781 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 81 statements into 16 equivalence classes. [2025-03-09 06:47:28,786 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 13 of 81 statements. [2025-03-09 06:47:28,787 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-09 06:47:28,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:47:28,853 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-09 06:47:28,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:47:28,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254965591] [2025-03-09 06:47:28,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254965591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:47:28,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:47:28,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 06:47:28,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001218939] [2025-03-09 06:47:28,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:47:28,881 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:47:28,882 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:47:28,882 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:47:28,882 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:47:28,882 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 06:47:28,882 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:28,882 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:47:28,882 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:47:28,882 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-01.c_Iteration9_Loop [2025-03-09 06:47:28,882 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:47:28,882 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:47:28,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:28,885 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:28,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:28,943 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:47:28,944 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 06:47:28,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:28,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:28,946 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-09 06:47:28,948 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-09 06:47:28,949 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:47:28,949 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:47:28,960 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:47:28,961 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-09 06:47:28,967 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-09 06:47:28,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:28,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:28,970 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-09 06:47:28,970 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-09 06:47:28,973 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:47:28,973 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:47:28,987 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 06:47:28,987 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-09 06:47:28,993 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-09 06:47:28,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:28,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:28,996 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-09 06:47:28,996 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-09 06:47:28,998 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:47:28,999 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:47:29,016 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-09 06:47:29,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:29,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:29,018 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-09 06:47:29,020 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-09 06:47:29,021 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 06:47:29,021 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:47:29,293 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 06:47:29,302 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-09 06:47:29,302 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:47:29,303 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:47:29,303 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:47:29,303 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:47:29,303 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:47:29,303 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:29,303 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:47:29,303 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:47:29,303 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-01.c_Iteration9_Loop [2025-03-09 06:47:29,303 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:47:29,303 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:47:29,303 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:29,305 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:29,306 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:29,352 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:47:29,353 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:47:29,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:29,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:29,354 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-09 06:47:29,355 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-09 06:47:29,356 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:47:29,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:29,366 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:47:29,366 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:29,366 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:29,366 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:29,366 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:47:29,366 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:47:29,367 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:29,374 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-09 06:47:29,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:29,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:29,377 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-09 06:47:29,377 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-09 06:47:29,378 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:47:29,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:29,388 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:47:29,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:29,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:29,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:29,388 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:47:29,388 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:47:29,389 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:29,396 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-09 06:47:29,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:29,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:29,398 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-09 06:47:29,398 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-09 06:47:29,399 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:47:29,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:29,409 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:47:29,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:29,409 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-09 06:47:29,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:29,410 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-09 06:47:29,410 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:47:29,413 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:29,419 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-09 06:47:29,419 INFO L451 LassoAnalysis]: Using template '2-nested'. [2025-03-09 06:47:29,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:29,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:29,421 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-09 06:47:29,421 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-09 06:47:29,422 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:47:29,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:29,432 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:47:29,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:29,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:29,432 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-03-09 06:47:29,434 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-03-09 06:47:29,434 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:47:29,435 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:29,440 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-09 06:47:29,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:29,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:29,442 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-09 06:47:29,443 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-09 06:47:29,444 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:47:29,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:29,454 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:47:29,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:29,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:29,455 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-03-09 06:47:29,455 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2025-03-09 06:47:29,455 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:47:29,456 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:29,462 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-09 06:47:29,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:29,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:29,464 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-09 06:47:29,465 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-09 06:47:29,466 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:47:29,476 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:29,476 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:47:29,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:29,476 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-09 06:47:29,476 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2025-03-09 06:47:29,478 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:47:29,478 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:47:29,483 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:47:29,486 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 06:47:29,486 INFO L444 ModelExtractionUtils]: 5 out of 9 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-09 06:47:29,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:29,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:29,488 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-09 06:47:29,489 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-09 06:47:29,490 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:47:29,490 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 06:47:29,490 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:47:29,490 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-09 06:47:29,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Forceful destruction successful, exit code 0 [2025-03-09 06:47:29,496 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 06:47:29,497 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: IfThenElseExpression [2025-03-09 06:47:29,497 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: IfThenElseExpression [2025-03-09 06:47:29,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:29,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-09 06:47:29,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-09 06:47:29,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:29,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:47:29,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:47:29,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:47:29,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:47:29,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:47:29,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:29,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:47:29,601 WARN L254 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 06:47:29,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:47:29,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:47:29,665 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-09 06:47:29,665 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-09 06:47:29,684 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-09 06:47:29,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-09 06:47:29,687 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-09 06:47:29,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2025-03-09 06:47:29,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 78 letters. Loop has 3 letters. [2025-03-09 06:47:29,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:47:29,688 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:47:29,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:29,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-09 06:47:29,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-09 06:47:29,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:29,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:47:29,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:47:29,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:47:29,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:47:29,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:47:29,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:29,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:47:29,799 WARN L254 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 06:47:29,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:47:29,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Forceful destruction successful, exit code 0 [2025-03-09 06:47:29,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:47:29,862 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-09 06:47:29,862 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-09 06:47:29,875 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-09 06:47:29,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-09 06:47:29,876 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-09 06:47:29,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2025-03-09 06:47:29,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 78 letters. Loop has 3 letters. [2025-03-09 06:47:29,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:47:29,876 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:47:29,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:29,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-09 06:47:29,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-09 06:47:29,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:29,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:47:29,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:47:29,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:47:29,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:47:29,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:47:29,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:29,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:47:29,969 WARN L254 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:47:29,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:47:30,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:47:30,036 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-09 06:47:30,036 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-09 06:47:30,092 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 8 states. [2025-03-09 06:47:30,093 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-09 06:47:30,093 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-09 06:47:30,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2025-03-09 06:47:30,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 78 letters. Loop has 3 letters. [2025-03-09 06:47:30,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:47:30,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 81 letters. Loop has 3 letters. [2025-03-09 06:47:30,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:47:30,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 78 letters. Loop has 6 letters. [2025-03-09 06:47:30,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:47:30,097 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 148 states and 158 transitions. [2025-03-09 06:47:30,098 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-09 06:47:30,098 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 148 states to 0 states and 0 transitions. [2025-03-09 06:47:30,098 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-09 06:47:30,098 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-09 06:47:30,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-09 06:47:30,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:47:30,098 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 06:47:30,098 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 06:47:30,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:47:30,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 06:47:30,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-09 06:47:30,098 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-09 06:47:30,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:47:30,098 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-03-09 06:47:30,098 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-03-09 06:47:30,098 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-09 06:47:30,098 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 06:47:30,098 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-09 06:47:30,098 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-09 06:47:30,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-09 06:47:30,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:47:30,098 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 06:47:30,098 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 06:47:30,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 06:47:30,099 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 06:47:30,099 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-09 06:47:30,099 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-09 06:47:30,099 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-09 06:47:30,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-09 06:47:30,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.03 06:47:30 BoogieIcfgContainer [2025-03-09 06:47:30,105 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-09 06:47:30,106 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 06:47:30,106 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 06:47:30,106 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 06:47:30,107 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:47:09" (3/4) ... [2025-03-09 06:47:30,108 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 06:47:30,108 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 06:47:30,109 INFO L158 Benchmark]: Toolchain (without parser) took 21209.87ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 113.7MB in the beginning and 144.0MB in the end (delta: -30.3MB). Peak memory consumption was 41.8MB. Max. memory is 16.1GB. [2025-03-09 06:47:30,109 INFO L158 Benchmark]: CDTParser took 0.62ms. Allocated memory is still 201.3MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:47:30,109 INFO L158 Benchmark]: CACSL2BoogieTranslator took 141.49ms. Allocated memory is still 142.6MB. Free memory was 113.7MB in the beginning and 103.7MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 06:47:30,109 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.51ms. Allocated memory is still 142.6MB. Free memory was 103.7MB in the beginning and 102.7MB in the end (delta: 992.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:47:30,109 INFO L158 Benchmark]: Boogie Preprocessor took 19.05ms. Allocated memory is still 142.6MB. Free memory was 102.7MB in the beginning and 101.8MB in the end (delta: 916.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:47:30,110 INFO L158 Benchmark]: IcfgBuilder took 188.49ms. Allocated memory is still 142.6MB. Free memory was 101.8MB in the beginning and 91.5MB in the end (delta: 10.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 06:47:30,110 INFO L158 Benchmark]: BuchiAutomizer took 20834.65ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 91.0MB in the beginning and 144.1MB in the end (delta: -53.1MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2025-03-09 06:47:30,110 INFO L158 Benchmark]: Witness Printer took 2.61ms. Allocated memory is still 218.1MB. Free memory was 144.1MB in the beginning and 144.0MB in the end (delta: 42.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:47:30,111 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.62ms. Allocated memory is still 201.3MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 141.49ms. Allocated memory is still 142.6MB. Free memory was 113.7MB in the beginning and 103.7MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.51ms. Allocated memory is still 142.6MB. Free memory was 103.7MB in the beginning and 102.7MB in the end (delta: 992.9kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.05ms. Allocated memory is still 142.6MB. Free memory was 102.7MB in the beginning and 101.8MB in the end (delta: 916.2kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 188.49ms. Allocated memory is still 142.6MB. Free memory was 101.8MB in the beginning and 91.5MB in the end (delta: 10.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 20834.65ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 91.0MB in the beginning and 144.1MB in the end (delta: -53.1MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. * Witness Printer took 2.61ms. Allocated memory is still 218.1MB. Free memory was 144.1MB in the beginning and 144.0MB in the end (delta: 42.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: 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 5 locations. 6 modules have a trivial ranking function, the largest among these consists of 58 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 20.7s and 10 iterations. TraceHistogramMax:16. Analysis of lassos took 16.1s. 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, 322 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 315 mSDsluCounter, 166 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 86 mSDsCounter, 231 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1512 IncrementalHoareTripleChecker+Invalid, 1743 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 231 mSolverCounterUnsat, 80 mSDtfsCounter, 1512 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: 1801ms VariablesStem: 3 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 7 SupportingInvariants: 14 MotzkinApplications: 126 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 22 LassoNonterminationAnalysisSatUnbounded: 4 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.6s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-03-09 06:47:30,121 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-09 06:47:30,322 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-09 06:47:30,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2025-03-09 06:47:30,724 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