./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-bwb/and-03.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-bwb/and-03.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 86d52fe8166d050ac731ccea951d586d64260a15b87f2be13444887a7e6d3fbf --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:59:04,133 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:59:04,188 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-01-10 06:59:04,193 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:59:04,193 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:59:04,211 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:59:04,212 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:59:04,212 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:59:04,213 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:59:04,213 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:59:04,214 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:59:04,214 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:59:04,214 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:59:04,214 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-01-10 06:59:04,214 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-01-10 06:59:04,215 INFO L153 SettingsManager]: * Use old map elimination=false [2025-01-10 06:59:04,215 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-01-10 06:59:04,215 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-01-10 06:59:04,215 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-01-10 06:59:04,215 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:59:04,215 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-01-10 06:59:04,215 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:59:04,215 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:59:04,215 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-01-10 06:59:04,215 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-01-10 06:59:04,215 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-01-10 06:59:04,215 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:59:04,215 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:59:04,216 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-01-10 06:59:04,216 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:59:04,216 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:59:04,216 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:59:04,216 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:59:04,216 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:59:04,216 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:59:04,217 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-01-10 06:59:04,217 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 86d52fe8166d050ac731ccea951d586d64260a15b87f2be13444887a7e6d3fbf [2025-01-10 06:59:04,423 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:59:04,430 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:59:04,431 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:59:04,432 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:59:04,432 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:59:04,433 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-bwb/and-03.c [2025-01-10 06:59:05,560 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c64bfc160/8a6531bad6a14aeaa91729e51da6d8f9/FLAG08e785a4d [2025-01-10 06:59:05,778 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:59:05,778 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-bwb/and-03.c [2025-01-10 06:59:05,785 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c64bfc160/8a6531bad6a14aeaa91729e51da6d8f9/FLAG08e785a4d [2025-01-10 06:59:06,142 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c64bfc160/8a6531bad6a14aeaa91729e51da6d8f9 [2025-01-10 06:59:06,144 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:59:06,145 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:59:06,147 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:59:06,147 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:59:06,150 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:59:06,150 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:59:06" (1/1) ... [2025-01-10 06:59:06,151 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@506ecd8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:06, skipping insertion in model container [2025-01-10 06:59:06,151 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:59:06" (1/1) ... [2025-01-10 06:59:06,159 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:59:06,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:59:06,248 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:59:06,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:59:06,262 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:59:06,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:06 WrapperNode [2025-01-10 06:59:06,262 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:59:06,263 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:59:06,263 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:59:06,263 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:59:06,267 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:06" (1/1) ... [2025-01-10 06:59:06,269 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:06" (1/1) ... [2025-01-10 06:59:06,278 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 22 [2025-01-10 06:59:06,278 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:59:06,279 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:59:06,279 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:59:06,279 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:59:06,284 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:06" (1/1) ... [2025-01-10 06:59:06,284 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:06" (1/1) ... [2025-01-10 06:59:06,284 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:06" (1/1) ... [2025-01-10 06:59:06,291 INFO L175 MemorySlicer]: No memory access in input program. [2025-01-10 06:59:06,291 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:06" (1/1) ... [2025-01-10 06:59:06,291 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:06" (1/1) ... [2025-01-10 06:59:06,292 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:06" (1/1) ... [2025-01-10 06:59:06,293 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:06" (1/1) ... [2025-01-10 06:59:06,295 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:06" (1/1) ... [2025-01-10 06:59:06,295 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:06" (1/1) ... [2025-01-10 06:59:06,296 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:06" (1/1) ... [2025-01-10 06:59:06,296 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:59:06,298 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:59:06,298 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:59:06,298 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:59:06,299 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:06" (1/1) ... [2025-01-10 06:59:06,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:06,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:06,326 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:06,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-01-10 06:59:06,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:59:06,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:59:06,383 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:59:06,385 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:59:06,467 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2025-01-10 06:59:06,467 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:59:06,473 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:59:06,473 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 06:59:06,473 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:59:06 BoogieIcfgContainer [2025-01-10 06:59:06,473 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:59:06,474 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-01-10 06:59:06,474 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-01-10 06:59:06,477 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-01-10 06:59:06,478 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 06:59:06,478 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.01 06:59:06" (1/3) ... [2025-01-10 06:59:06,479 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@51f9403a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 06:59:06, skipping insertion in model container [2025-01-10 06:59:06,479 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 06:59:06,479 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:06" (2/3) ... [2025-01-10 06:59:06,479 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@51f9403a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 06:59:06, skipping insertion in model container [2025-01-10 06:59:06,479 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 06:59:06,479 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:59:06" (3/3) ... [2025-01-10 06:59:06,480 INFO L363 chiAutomizerObserver]: Analyzing ICFG and-03.c [2025-01-10 06:59:06,524 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-01-10 06:59:06,524 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-01-10 06:59:06,524 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-01-10 06:59:06,524 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-01-10 06:59:06,524 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-01-10 06:59:06,525 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-01-10 06:59:06,525 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-01-10 06:59:06,525 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-01-10 06:59:06,528 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:06,537 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-01-10 06:59:06,538 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 06:59:06,538 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 06:59:06,541 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 06:59:06,541 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-01-10 06:59:06,541 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-01-10 06:59:06,541 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:06,543 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-01-10 06:59:06,543 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 06:59:06,543 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 06:59:06,543 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 06:59:06,543 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-01-10 06:59:06,548 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~bitwise1#1, main_#t~post2#1, main_~x~0#1;havoc main_~x~0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;" [2025-01-10 06:59:06,548 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 != main_~x~0#1;" "assume !(main_~x~0#1 > 0);main_#t~post2#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" [2025-01-10 06:59:06,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:06,552 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2025-01-10 06:59:06,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:06,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709977515] [2025-01-10 06:59:06,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:59:06,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:06,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 06:59:06,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 06:59:06,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:06,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:06,608 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:06,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 06:59:06,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 06:59:06,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:06,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:06,622 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:06,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:06,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1171, now seen corresponding path program 1 times [2025-01-10 06:59:06,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:06,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916345483] [2025-01-10 06:59:06,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:59:06,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:06,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 06:59:06,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 06:59:06,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:06,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:06,637 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:06,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 06:59:06,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 06:59:06,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:06,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:06,642 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:06,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:06,643 INFO L85 PathProgramCache]: Analyzing trace with hash 925653, now seen corresponding path program 1 times [2025-01-10 06:59:06,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:06,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486577827] [2025-01-10 06:59:06,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:59:06,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:06,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:59:06,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:59:06,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:06,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:06,649 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:06,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:59:06,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:59:06,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:06,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:06,654 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:06,712 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 06:59:06,712 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 06:59:06,712 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 06:59:06,716 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 06:59:06,716 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 06:59:06,716 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:06,716 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 06:59:06,716 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 06:59:06,717 INFO L132 ssoRankerPreferences]: Filename of dumped script: and-03.c_Iteration1_Loop [2025-01-10 06:59:06,717 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 06:59:06,717 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 06:59:06,727 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:06,749 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:06,809 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 06:59:06,810 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 06:59:06,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:06,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:06,814 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:06,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-01-10 06:59:06,818 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 06:59:06,818 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:06,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-01-10 06:59:06,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:06,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:06,851 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:06,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-01-10 06:59:06,854 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 06:59:06,854 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:06,890 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 06:59:06,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:06,896 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 06:59:06,896 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 06:59:06,896 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 06:59:06,896 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 06:59:06,896 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 06:59:06,896 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:06,896 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 06:59:06,896 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 06:59:06,896 INFO L132 ssoRankerPreferences]: Filename of dumped script: and-03.c_Iteration1_Loop [2025-01-10 06:59:06,897 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 06:59:06,897 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 06:59:06,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:06,910 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:06,937 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 06:59:06,940 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 06:59:06,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:06,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:06,943 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:06,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-01-10 06:59:06,946 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 06:59:06,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:06,957 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 06:59:06,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:06,958 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:06,958 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:06,961 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 06:59:06,962 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 06:59:06,965 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 06:59:06,970 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-01-10 06:59:06,972 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-01-10 06:59:06,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:06,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:06,975 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:06,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-01-10 06:59:06,979 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 06:59:06,979 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 06:59:06,979 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 06:59:06,980 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 [] [2025-01-10 06:59:06,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:06,990 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 06:59:07,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:07,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 06:59:07,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 06:59:07,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:07,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:07,021 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:59:07,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:07,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 06:59:07,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 06:59:07,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:07,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:07,032 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:59:07,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:07,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:59:07,056 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-01-10 06:59:07,057 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-01-10 06:59:07,102 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 31 states and 43 transitions. Complement of second has 6 states. [2025-01-10 06:59:07,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 06:59:07,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-01-10 06:59:07,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2025-01-10 06:59:07,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 2 letters. Loop has 2 letters. [2025-01-10 06:59:07,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:07,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 4 letters. Loop has 2 letters. [2025-01-10 06:59:07,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:07,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 2 letters. Loop has 4 letters. [2025-01-10 06:59:07,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:07,115 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 43 transitions. [2025-01-10 06:59:07,116 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-01-10 06:59:07,119 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 15 states and 21 transitions. [2025-01-10 06:59:07,120 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2025-01-10 06:59:07,120 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-01-10 06:59:07,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 21 transitions. [2025-01-10 06:59:07,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 06:59:07,121 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 21 transitions. [2025-01-10 06:59:07,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 21 transitions. [2025-01-10 06:59:07,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2025-01-10 06:59:07,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 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-01-10 06:59:07,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2025-01-10 06:59:07,141 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 20 transitions. [2025-01-10 06:59:07,141 INFO L432 stractBuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2025-01-10 06:59:07,141 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-01-10 06:59:07,141 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. [2025-01-10 06:59:07,142 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-01-10 06:59:07,142 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 06:59:07,142 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 06:59:07,142 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-01-10 06:59:07,142 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-01-10 06:59:07,142 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~bitwise1#1, main_#t~post2#1, main_~x~0#1;havoc main_~x~0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;" "assume 0 != main_~x~0#1;" "assume main_~x~0#1 > 0;" "assume 0 == main_~x~0#1 || 0 == main_~x~0#1 - 1;main_#t~bitwise1#1 := 0;" [2025-01-10 06:59:07,142 INFO L754 eck$LassoCheckResult]: Loop: "main_~x~0#1 := main_#t~bitwise1#1;havoc main_#t~bitwise1#1;" "assume 0 != main_~x~0#1;" "assume main_~x~0#1 > 0;" "assume 0 == main_~x~0#1 || 0 == main_~x~0#1 - 1;main_#t~bitwise1#1 := 0;" [2025-01-10 06:59:07,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:07,143 INFO L85 PathProgramCache]: Analyzing trace with hash 28694790, now seen corresponding path program 1 times [2025-01-10 06:59:07,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:07,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448033362] [2025-01-10 06:59:07,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:59:07,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:07,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:59:07,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:59:07,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:07,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:07,147 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:07,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:59:07,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:59:07,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:07,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:07,149 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:07,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:07,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1584980, now seen corresponding path program 1 times [2025-01-10 06:59:07,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:07,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012527412] [2025-01-10 06:59:07,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:59:07,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:07,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:59:07,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:59:07,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:07,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:07,154 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:07,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:59:07,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:59:07,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:07,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:07,159 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:07,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:07,159 INFO L85 PathProgramCache]: Analyzing trace with hash 293600729, now seen corresponding path program 1 times [2025-01-10 06:59:07,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:07,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675907650] [2025-01-10 06:59:07,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:59:07,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:07,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:59:07,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:59:07,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:07,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:07,213 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:59:07,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:59:07,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675907650] [2025-01-10 06:59:07,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675907650] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:59:07,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:59:07,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:59:07,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86618339] [2025-01-10 06:59:07,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:59:07,257 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 06:59:07,257 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 06:59:07,258 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 06:59:07,258 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 06:59:07,258 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 06:59:07,258 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:07,258 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 06:59:07,258 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 06:59:07,258 INFO L132 ssoRankerPreferences]: Filename of dumped script: and-03.c_Iteration2_Loop [2025-01-10 06:59:07,258 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 06:59:07,258 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 06:59:07,259 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:07,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:07,284 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 06:59:07,284 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 06:59:07,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:07,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:07,287 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:07,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-01-10 06:59:07,288 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 06:59:07,288 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:07,301 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 06:59:07,301 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0#1=0} Honda state: {ULTIMATE.start_main_~x~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 06:59:07,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-01-10 06:59:07,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:07,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:07,310 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:07,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-01-10 06:59:07,312 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 06:59:07,312 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:07,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-01-10 06:59:07,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:07,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:07,332 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:07,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-01-10 06:59:07,334 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 06:59:07,334 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:07,347 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 06:59:07,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-01-10 06:59:07,353 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 06:59:07,353 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 06:59:07,353 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 06:59:07,353 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 06:59:07,353 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 06:59:07,353 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:07,353 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 06:59:07,353 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 06:59:07,353 INFO L132 ssoRankerPreferences]: Filename of dumped script: and-03.c_Iteration2_Loop [2025-01-10 06:59:07,353 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 06:59:07,354 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 06:59:07,354 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:07,359 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:07,384 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 06:59:07,384 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 06:59:07,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:07,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:07,388 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:07,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-01-10 06:59:07,403 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 06:59:07,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:07,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:07,413 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 06:59:07,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:07,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:07,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:07,414 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 06:59:07,414 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 06:59:07,416 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:07,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:07,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:07,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:07,425 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:07,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-01-10 06:59:07,427 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 06:59:07,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:07,437 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 06:59:07,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:07,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:07,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:07,438 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 06:59:07,438 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 06:59:07,441 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 06:59:07,444 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-01-10 06:59:07,444 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-01-10 06:59:07,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:07,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:07,446 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:07,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-01-10 06:59:07,448 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 06:59:07,448 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 06:59:07,448 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 06:59:07,448 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~bitwise1#1) = 1*ULTIMATE.start_main_#t~bitwise1#1 Supporting invariants [] [2025-01-10 06:59:07,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-01-10 06:59:07,454 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 06:59:07,456 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~bitwise1 [2025-01-10 06:59:07,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:07,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:59:07,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:59:07,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:07,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:07,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:59:07,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:07,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:59:07,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:59:07,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:07,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:07,478 WARN L254 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:59:07,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:07,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:59:07,501 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-01-10 06:59:07,501 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 20 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:07,534 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 20 transitions. cyclomatic complexity: 8. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 39 states and 55 transitions. Complement of second has 8 states. [2025-01-10 06:59:07,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-01-10 06:59:07,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:07,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2025-01-10 06:59:07,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 5 letters. Loop has 4 letters. [2025-01-10 06:59:07,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:07,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 9 letters. Loop has 4 letters. [2025-01-10 06:59:07,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:07,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 5 letters. Loop has 8 letters. [2025-01-10 06:59:07,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:07,536 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 55 transitions. [2025-01-10 06:59:07,537 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2025-01-10 06:59:07,537 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 29 states and 40 transitions. [2025-01-10 06:59:07,537 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2025-01-10 06:59:07,537 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2025-01-10 06:59:07,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 40 transitions. [2025-01-10 06:59:07,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 06:59:07,538 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 40 transitions. [2025-01-10 06:59:07,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 40 transitions. [2025-01-10 06:59:07,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2025-01-10 06:59:07,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 26 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:07,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2025-01-10 06:59:07,539 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 37 transitions. [2025-01-10 06:59:07,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:59:07,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:59:07,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:59:07,541 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:07,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:59:07,560 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2025-01-10 06:59:07,560 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 32 transitions. [2025-01-10 06:59:07,560 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2025-01-10 06:59:07,561 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 24 states and 30 transitions. [2025-01-10 06:59:07,561 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2025-01-10 06:59:07,561 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2025-01-10 06:59:07,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 30 transitions. [2025-01-10 06:59:07,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 06:59:07,561 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 30 transitions. [2025-01-10 06:59:07,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 30 transitions. [2025-01-10 06:59:07,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 15. [2025-01-10 06:59:07,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 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-01-10 06:59:07,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2025-01-10 06:59:07,562 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 19 transitions. [2025-01-10 06:59:07,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:59:07,564 INFO L432 stractBuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2025-01-10 06:59:07,564 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-01-10 06:59:07,564 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2025-01-10 06:59:07,564 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2025-01-10 06:59:07,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 06:59:07,564 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 06:59:07,565 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-01-10 06:59:07,565 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1] [2025-01-10 06:59:07,565 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~bitwise1#1, main_#t~post2#1, main_~x~0#1;havoc main_~x~0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;" "assume 0 != main_~x~0#1;" "assume main_~x~0#1 > 0;" [2025-01-10 06:59:07,565 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 == main_~x~0#1 || 0 == main_~x~0#1 - 1;main_#t~bitwise1#1 := 0;" "main_~x~0#1 := main_#t~bitwise1#1;havoc main_#t~bitwise1#1;" "assume 0 != main_~x~0#1;" "assume !(main_~x~0#1 > 0);main_#t~post2#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume 0 != main_~x~0#1;" "assume main_~x~0#1 > 0;" [2025-01-10 06:59:07,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:07,565 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2025-01-10 06:59:07,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:07,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310079395] [2025-01-10 06:59:07,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:59:07,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:07,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:59:07,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:59:07,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:07,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:07,569 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:07,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:59:07,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:59:07,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:07,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:07,571 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:07,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:07,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1251572960, now seen corresponding path program 1 times [2025-01-10 06:59:07,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:07,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352639148] [2025-01-10 06:59:07,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:59:07,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:07,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:59:07,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:59:07,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:07,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:07,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:59:07,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:59:07,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352639148] [2025-01-10 06:59:07,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352639148] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:59:07,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:59:07,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:59:07,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556612083] [2025-01-10 06:59:07,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:59:07,612 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 06:59:07,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:59:07,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:59:07,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:59:07,613 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:07,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:59:07,637 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2025-01-10 06:59:07,637 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2025-01-10 06:59:07,638 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-01-10 06:59:07,638 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 12 states and 14 transitions. [2025-01-10 06:59:07,638 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-01-10 06:59:07,638 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-01-10 06:59:07,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 14 transitions. [2025-01-10 06:59:07,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 06:59:07,638 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 14 transitions. [2025-01-10 06:59:07,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 14 transitions. [2025-01-10 06:59:07,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2025-01-10 06:59:07,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:07,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2025-01-10 06:59:07,639 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 13 transitions. [2025-01-10 06:59:07,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:59:07,642 INFO L432 stractBuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2025-01-10 06:59:07,642 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-01-10 06:59:07,642 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2025-01-10 06:59:07,643 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-01-10 06:59:07,643 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 06:59:07,643 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 06:59:07,643 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-01-10 06:59:07,643 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-01-10 06:59:07,643 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~bitwise1#1, main_#t~post2#1, main_~x~0#1;havoc main_~x~0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;" "assume 0 != main_~x~0#1;" [2025-01-10 06:59:07,643 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~x~0#1 > 0;" "assume !(0 == main_~x~0#1 || 0 == main_~x~0#1 - 1);" "assume !(main_~x~0#1 == main_~x~0#1 - 1);" "havoc main_#t~bitwise1#1;assume (((((main_~x~0#1 < 0 && main_~x~0#1 - 1 >= 0) || main_#t~bitwise1#1 <= main_~x~0#1) && ((main_~x~0#1 >= 0 && main_~x~0#1 - 1 < 0) || main_#t~bitwise1#1 <= main_~x~0#1 - 1)) && ((main_~x~0#1 < 0 && main_~x~0#1 - 1 < 0) || main_#t~bitwise1#1 >= 0)) && ((main_~x~0#1 >= 0 && main_~x~0#1 - 1 >= 0) || main_#t~bitwise1#1 > main_~x~0#1 + (main_~x~0#1 - 1))) && main_#t~bitwise1#1 >= -2147483648;" "main_~x~0#1 := main_#t~bitwise1#1;havoc main_#t~bitwise1#1;" "assume 0 != main_~x~0#1;" [2025-01-10 06:59:07,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:07,643 INFO L85 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 1 times [2025-01-10 06:59:07,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:07,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491778155] [2025-01-10 06:59:07,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:59:07,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:07,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 06:59:07,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 06:59:07,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:07,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:07,649 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:07,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 06:59:07,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 06:59:07,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:07,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:07,652 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:07,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:07,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1158681271, now seen corresponding path program 1 times [2025-01-10 06:59:07,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:07,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254587497] [2025-01-10 06:59:07,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:59:07,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:07,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:59:07,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:59:07,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:07,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:07,660 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:07,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:59:07,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:59:07,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:07,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:07,664 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:07,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:07,664 INFO L85 PathProgramCache]: Analyzing trace with hash 295372249, now seen corresponding path program 1 times [2025-01-10 06:59:07,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:07,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177846067] [2025-01-10 06:59:07,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:59:07,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:07,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:59:07,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:59:07,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:07,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:07,669 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:07,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:59:07,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:59:07,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:07,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:07,674 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:07,716 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 06:59:07,716 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 06:59:07,716 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 06:59:07,716 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 06:59:07,717 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 06:59:07,717 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:07,717 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 06:59:07,717 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 06:59:07,717 INFO L132 ssoRankerPreferences]: Filename of dumped script: and-03.c_Iteration4_Loop [2025-01-10 06:59:07,717 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 06:59:07,717 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 06:59:07,717 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:07,720 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:07,740 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 06:59:07,740 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 06:59:07,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:07,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:07,742 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:07,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-01-10 06:59:07,746 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 06:59:07,746 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:07,759 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 06:59:07,759 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~bitwise1#1=0} Honda state: {ULTIMATE.start_main_#t~bitwise1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 06:59:07,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-01-10 06:59:07,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:07,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:07,767 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:07,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-01-10 06:59:07,776 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 06:59:07,776 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:07,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-01-10 06:59:07,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:07,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:07,794 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:07,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-01-10 06:59:07,799 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 06:59:07,799 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:07,839 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 06:59:07,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-01-10 06:59:07,844 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 06:59:07,844 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 06:59:07,844 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 06:59:07,844 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 06:59:07,844 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 06:59:07,844 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:07,844 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 06:59:07,844 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 06:59:07,844 INFO L132 ssoRankerPreferences]: Filename of dumped script: and-03.c_Iteration4_Loop [2025-01-10 06:59:07,844 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 06:59:07,844 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 06:59:07,845 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:07,856 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:07,878 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 06:59:07,879 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 06:59:07,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:07,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:07,881 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:07,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-01-10 06:59:07,884 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 06:59:07,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:07,894 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 06:59:07,895 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:07,895 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:07,895 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:07,895 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 06:59:07,895 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 06:59:07,897 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 06:59:07,901 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-01-10 06:59:07,901 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-01-10 06:59:07,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:07,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:07,903 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:07,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-01-10 06:59:07,906 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 06:59:07,906 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 06:59:07,906 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 06:59:07,906 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 [] [2025-01-10 06:59:07,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:07,913 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 06:59:07,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:07,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 06:59:07,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 06:59:07,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:07,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:07,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:59:07,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:07,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:59:07,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:59:07,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:07,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:07,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:59:07,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:08,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:59:08,015 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2025-01-10 06:59:08,015 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4 Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 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-01-10 06:59:08,037 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 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 25 states and 28 transitions. Complement of second has 9 states. [2025-01-10 06:59:08,038 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-01-10 06:59:08,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 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-01-10 06:59:08,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2025-01-10 06:59:08,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 3 letters. Loop has 6 letters. [2025-01-10 06:59:08,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:08,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 9 letters. Loop has 6 letters. [2025-01-10 06:59:08,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:08,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 3 letters. Loop has 12 letters. [2025-01-10 06:59:08,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:08,043 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 28 transitions. [2025-01-10 06:59:08,044 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-01-10 06:59:08,046 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 12 states and 13 transitions. [2025-01-10 06:59:08,046 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-01-10 06:59:08,046 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-01-10 06:59:08,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2025-01-10 06:59:08,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 06:59:08,046 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 13 transitions. [2025-01-10 06:59:08,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2025-01-10 06:59:08,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2025-01-10 06:59:08,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 10 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-01-10 06:59:08,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2025-01-10 06:59:08,047 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 12 transitions. [2025-01-10 06:59:08,047 INFO L432 stractBuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2025-01-10 06:59:08,047 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-01-10 06:59:08,047 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2025-01-10 06:59:08,047 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-01-10 06:59:08,047 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 06:59:08,047 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 06:59:08,047 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1] [2025-01-10 06:59:08,050 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-01-10 06:59:08,050 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~bitwise1#1, main_#t~post2#1, main_~x~0#1;havoc main_~x~0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;" "assume 0 != main_~x~0#1;" "assume !(main_~x~0#1 > 0);main_#t~post2#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume 0 != main_~x~0#1;" [2025-01-10 06:59:08,050 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~x~0#1 > 0;" "assume !(0 == main_~x~0#1 || 0 == main_~x~0#1 - 1);" "assume !(main_~x~0#1 == main_~x~0#1 - 1);" "havoc main_#t~bitwise1#1;assume (((((main_~x~0#1 < 0 && main_~x~0#1 - 1 >= 0) || main_#t~bitwise1#1 <= main_~x~0#1) && ((main_~x~0#1 >= 0 && main_~x~0#1 - 1 < 0) || main_#t~bitwise1#1 <= main_~x~0#1 - 1)) && ((main_~x~0#1 < 0 && main_~x~0#1 - 1 < 0) || main_#t~bitwise1#1 >= 0)) && ((main_~x~0#1 >= 0 && main_~x~0#1 - 1 >= 0) || main_#t~bitwise1#1 > main_~x~0#1 + (main_~x~0#1 - 1))) && main_#t~bitwise1#1 >= -2147483648;" "main_~x~0#1 := main_#t~bitwise1#1;havoc main_#t~bitwise1#1;" "assume 0 != main_~x~0#1;" [2025-01-10 06:59:08,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:08,051 INFO L85 PathProgramCache]: Analyzing trace with hash 28695249, now seen corresponding path program 2 times [2025-01-10 06:59:08,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:08,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120555025] [2025-01-10 06:59:08,051 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:59:08,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:08,056 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 2 equivalence classes. [2025-01-10 06:59:08,058 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:59:08,060 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:59:08,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:08,060 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:08,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:59:08,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:59:08,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:08,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:08,067 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:08,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:08,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1158681271, now seen corresponding path program 2 times [2025-01-10 06:59:08,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:08,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119953502] [2025-01-10 06:59:08,068 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:59:08,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:08,070 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:59:08,072 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:59:08,073 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:59:08,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:08,073 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:08,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:59:08,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:59:08,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:08,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:08,077 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:08,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:08,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1955238279, now seen corresponding path program 1 times [2025-01-10 06:59:08,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:08,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28558360] [2025-01-10 06:59:08,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:59:08,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:08,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:59:08,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:59:08,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:08,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:08,134 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:59:08,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:59:08,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28558360] [2025-01-10 06:59:08,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28558360] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:59:08,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577101218] [2025-01-10 06:59:08,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:59:08,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:59:08,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:08,137 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:59:08,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-01-10 06:59:08,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:59:08,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:59:08,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:08,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:08,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:59:08,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:08,179 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:59:08,179 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:59:08,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577101218] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:59:08,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:59:08,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-10 06:59:08,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397396055] [2025-01-10 06:59:08,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:59:08,226 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 06:59:08,226 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 06:59:08,226 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 06:59:08,226 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 06:59:08,226 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 06:59:08,226 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:08,226 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 06:59:08,226 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 06:59:08,226 INFO L132 ssoRankerPreferences]: Filename of dumped script: and-03.c_Iteration5_Loop [2025-01-10 06:59:08,227 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 06:59:08,227 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 06:59:08,227 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:08,235 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:08,254 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 06:59:08,254 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 06:59:08,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:08,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:08,257 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:08,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-01-10 06:59:08,260 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 06:59:08,260 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:08,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:08,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:08,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:08,280 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:08,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-01-10 06:59:08,284 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 06:59:08,284 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:08,319 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 06:59:08,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:08,324 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 06:59:08,324 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 06:59:08,324 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 06:59:08,324 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 06:59:08,324 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 06:59:08,324 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:08,324 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 06:59:08,324 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 06:59:08,324 INFO L132 ssoRankerPreferences]: Filename of dumped script: and-03.c_Iteration5_Loop [2025-01-10 06:59:08,324 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 06:59:08,324 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 06:59:08,324 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:08,331 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:08,349 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 06:59:08,349 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 06:59:08,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:08,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:08,351 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:08,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-01-10 06:59:08,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-01-10 06:59:08,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:08,366 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 06:59:08,366 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:08,366 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:08,366 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:08,367 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 06:59:08,367 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 06:59:08,369 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 06:59:08,371 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-01-10 06:59:08,371 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-01-10 06:59:08,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:08,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:08,374 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:08,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-01-10 06:59:08,376 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 06:59:08,376 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 06:59:08,376 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 06:59:08,376 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 [] [2025-01-10 06:59:08,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-01-10 06:59:08,383 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 06:59:08,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:08,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:59:08,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:59:08,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:08,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:08,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:59:08,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:08,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:59:08,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:59:08,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:08,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:08,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:59:08,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:08,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:59:08,468 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2025-01-10 06:59:08,469 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 12 transitions. cyclomatic complexity: 3 Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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-01-10 06:59:08,474 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 12 transitions. cyclomatic complexity: 3. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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 12 states and 13 transitions. Complement of second has 3 states. [2025-01-10 06:59:08,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-01-10 06:59:08,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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-01-10 06:59:08,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3 transitions. [2025-01-10 06:59:08,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 5 letters. Loop has 6 letters. [2025-01-10 06:59:08,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:08,475 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 06:59:08,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:08,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:59:08,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:59:08,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:08,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:08,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:59:08,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:08,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:59:08,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:59:08,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:08,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:08,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:59:08,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:08,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-01-10 06:59:08,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:08,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-01-10 06:59:08,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:59:08,575 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2025-01-10 06:59:08,575 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 12 transitions. cyclomatic complexity: 3 Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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-01-10 06:59:08,581 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 12 transitions. cyclomatic complexity: 3. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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 12 states and 13 transitions. Complement of second has 3 states. [2025-01-10 06:59:08,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-01-10 06:59:08,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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-01-10 06:59:08,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3 transitions. [2025-01-10 06:59:08,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 5 letters. Loop has 6 letters. [2025-01-10 06:59:08,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:08,583 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 06:59:08,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:08,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:59:08,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:59:08,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:08,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:08,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:59:08,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:08,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:59:08,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:59:08,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:08,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:08,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:59:08,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:08,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:59:08,650 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 4 loop predicates [2025-01-10 06:59:08,650 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 12 transitions. cyclomatic complexity: 3 Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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-01-10 06:59:08,671 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 12 transitions. cyclomatic complexity: 3. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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 18 states and 20 transitions. Complement of second has 8 states. [2025-01-10 06:59:08,671 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-01-10 06:59:08,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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-01-10 06:59:08,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2025-01-10 06:59:08,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 5 letters. Loop has 6 letters. [2025-01-10 06:59:08,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:08,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 11 letters. Loop has 6 letters. [2025-01-10 06:59:08,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:08,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 5 letters. Loop has 12 letters. [2025-01-10 06:59:08,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:08,673 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 20 transitions. [2025-01-10 06:59:08,673 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-01-10 06:59:08,673 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 0 states and 0 transitions. [2025-01-10 06:59:08,673 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-01-10 06:59:08,673 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-01-10 06:59:08,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-01-10 06:59:08,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 06:59:08,673 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 06:59:08,673 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 06:59:08,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:59:08,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:59:08,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:59:08,674 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. 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-01-10 06:59:08,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:59:08,674 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-01-10 06:59:08,674 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-01-10 06:59:08,674 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-01-10 06:59:08,674 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 06:59:08,674 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-01-10 06:59:08,674 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-01-10 06:59:08,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-01-10 06:59:08,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 06:59:08,674 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 06:59:08,674 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 06:59:08,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 06:59:08,674 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 06:59:08,674 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-01-10 06:59:08,674 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-01-10 06:59:08,674 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-01-10 06:59:08,674 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-01-10 06:59:08,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.01 06:59:08 BoogieIcfgContainer [2025-01-10 06:59:08,682 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-01-10 06:59:08,683 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 06:59:08,683 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 06:59:08,683 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 06:59:08,683 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:59:06" (3/4) ... [2025-01-10 06:59:08,685 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 06:59:08,686 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 06:59:08,687 INFO L158 Benchmark]: Toolchain (without parser) took 2542.28ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 96.0MB in the end (delta: 8.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2025-01-10 06:59:08,687 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:59:08,687 INFO L158 Benchmark]: CACSL2BoogieTranslator took 115.94ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 95.1MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 06:59:08,687 INFO L158 Benchmark]: Boogie Procedure Inliner took 15.24ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 94.1MB in the end (delta: 974.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:59:08,688 INFO L158 Benchmark]: Boogie Preprocessor took 17.48ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 92.7MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 06:59:08,688 INFO L158 Benchmark]: RCFGBuilder took 175.11ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 83.3MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 06:59:08,688 INFO L158 Benchmark]: BuchiAutomizer took 2208.67ms. Allocated memory is still 142.6MB. Free memory was 83.3MB in the beginning and 96.8MB in the end (delta: -13.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:59:08,689 INFO L158 Benchmark]: Witness Printer took 3.30ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 96.0MB in the end (delta: 805.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:59:08,690 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.16ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 115.94ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 95.1MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 15.24ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 94.1MB in the end (delta: 974.3kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 17.48ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 92.7MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 175.11ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 83.3MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 2208.67ms. Allocated memory is still 142.6MB. Free memory was 83.3MB in the beginning and 96.8MB in the end (delta: -13.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.30ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 96.0MB in the end (delta: 805.7kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~bitwise1 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (3 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function ((long) -1 * x) and consists of 4 locations. One deterministic module has affine ranking function null and consists of 5 locations. One deterministic module has affine ranking function x and consists of 5 locations. One nondeterministic module has affine ranking function x and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.1s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 1.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 14 StatesRemovedByMinimization, 5 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 [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 53 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 47 mSDsluCounter, 71 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 124 IncrementalHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 49 mSDtfsCounter, 124 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT2 conc0 concLT2 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq157 hnf95 smp69 dnf100 smp100 tf116 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 39ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-01-10 06:59:08,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:08,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE