./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-bwb/or-05.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-bwb/or-05.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c3769a7b9199e4d3a1d3d7ebad63ad6175b11f31d08bb9cf3238c1849c9b4724 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 06:47:10,106 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:47:10,169 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-09 06:47:10,175 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:47:10,176 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:47:10,176 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-09 06:47:10,194 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:47:10,195 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:47:10,195 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:47:10,195 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:47:10,195 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:47:10,195 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:47:10,195 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:47:10,196 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:47:10,196 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-09 06:47:10,196 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-09 06:47:10,196 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-09 06:47:10,196 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-09 06:47:10,196 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-09 06:47:10,196 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-09 06:47:10,196 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:47:10,196 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-09 06:47:10,196 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:47:10,197 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:47:10,197 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-09 06:47:10,197 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-09 06:47:10,197 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-09 06:47:10,197 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:47:10,197 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:47:10,197 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-09 06:47:10,197 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:47:10,197 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:47:10,197 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:47:10,197 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:47:10,198 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:47:10,198 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:47:10,198 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-09 06:47:10,198 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c3769a7b9199e4d3a1d3d7ebad63ad6175b11f31d08bb9cf3238c1849c9b4724 [2025-03-09 06:47:10,462 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:47:10,470 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:47:10,472 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:47:10,474 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:47:10,474 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:47:10,475 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-bwb/or-05.c [2025-03-09 06:47:11,638 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09364a8bb/46e1c96bb4eb4091b728047f7a0fd156/FLAGa1a53c6b5 [2025-03-09 06:47:11,849 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:47:11,849 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-bwb/or-05.c [2025-03-09 06:47:11,858 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09364a8bb/46e1c96bb4eb4091b728047f7a0fd156/FLAGa1a53c6b5 [2025-03-09 06:47:12,194 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09364a8bb/46e1c96bb4eb4091b728047f7a0fd156 [2025-03-09 06:47:12,196 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:47:12,197 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:47:12,201 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:47:12,201 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:47:12,207 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:47:12,208 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:47:12" (1/1) ... [2025-03-09 06:47:12,208 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bd3959c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:12, skipping insertion in model container [2025-03-09 06:47:12,208 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:47:12" (1/1) ... [2025-03-09 06:47:12,218 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:47:12,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:47:12,296 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:47:12,302 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:47:12,310 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:47:12,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:12 WrapperNode [2025-03-09 06:47:12,310 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:47:12,311 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:47:12,311 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:47:12,311 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:47:12,316 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:12" (1/1) ... [2025-03-09 06:47:12,318 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:12" (1/1) ... [2025-03-09 06:47:12,327 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 24 [2025-03-09 06:47:12,327 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:47:12,327 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:47:12,327 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:47:12,327 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:47:12,333 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:12" (1/1) ... [2025-03-09 06:47:12,333 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:12" (1/1) ... [2025-03-09 06:47:12,334 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:12" (1/1) ... [2025-03-09 06:47:12,340 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-09 06:47:12,340 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:12" (1/1) ... [2025-03-09 06:47:12,340 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:12" (1/1) ... [2025-03-09 06:47:12,341 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:12" (1/1) ... [2025-03-09 06:47:12,343 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:12" (1/1) ... [2025-03-09 06:47:12,343 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:12" (1/1) ... [2025-03-09 06:47:12,344 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:12" (1/1) ... [2025-03-09 06:47:12,344 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:47:12,345 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:47:12,346 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:47:12,346 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:47:12,346 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:12" (1/1) ... [2025-03-09 06:47:12,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:12,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:12,374 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:12,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-09 06:47:12,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:47:12,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:47:12,428 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:47:12,430 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:47:12,514 INFO L? ?]: Removed 3 outVars from TransFormulas that were not future-live. [2025-03-09 06:47:12,514 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:47:12,528 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:47:12,529 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 06:47:12,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:47:12 BoogieIcfgContainer [2025-03-09 06:47:12,530 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:47:12,530 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-09 06:47:12,530 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-09 06:47:12,534 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-09 06:47:12,535 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:47:12,535 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.03 06:47:12" (1/3) ... [2025-03-09 06:47:12,535 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7f6bc16c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 06:47:12, skipping insertion in model container [2025-03-09 06:47:12,536 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:47:12,536 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:47:12" (2/3) ... [2025-03-09 06:47:12,536 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7f6bc16c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 06:47:12, skipping insertion in model container [2025-03-09 06:47:12,536 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:47:12,536 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:47:12" (3/3) ... [2025-03-09 06:47:12,537 INFO L363 chiAutomizerObserver]: Analyzing ICFG or-05.c [2025-03-09 06:47:12,571 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-09 06:47:12,571 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-09 06:47:12,572 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-09 06:47:12,572 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-09 06:47:12,572 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-09 06:47:12,572 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-09 06:47:12,572 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-09 06:47:12,572 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-09 06:47:12,575 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-03-09 06:47:12,584 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-09 06:47:12,584 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:47:12,584 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:47:12,587 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-09 06:47:12,587 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:47:12,587 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-09 06:47:12,587 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-03-09 06:47:12,588 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-09 06:47:12,588 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:47:12,588 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:47:12,588 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-09 06:47:12,588 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:47:12,593 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_~y~0#1, main_~x~0#1;havoc main_~y~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;main_~y~0#1 := 0;" [2025-03-09 06:47:12,593 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~x~0#1 > 0;" "assume !(1 == main_~y~0#1);main_~y~0#1 := 1;main_~x~0#1 := main_~x~0#1 - main_~y~0#1;" [2025-03-09 06:47:12,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:12,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1408, now seen corresponding path program 1 times [2025-03-09 06:47:12,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:12,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91003256] [2025-03-09 06:47:12,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:47:12,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:12,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:47:12,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:47:12,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:12,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:12,648 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:47:12,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:47:12,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:47:12,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:12,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:12,658 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:47:12,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:12,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1343, now seen corresponding path program 1 times [2025-03-09 06:47:12,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:12,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413477974] [2025-03-09 06:47:12,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:47:12,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:12,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:47:12,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:47:12,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:12,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:12,672 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:47:12,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:47:12,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:47:12,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:12,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:12,678 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:47:12,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:12,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1353470, now seen corresponding path program 1 times [2025-03-09 06:47:12,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:12,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227417781] [2025-03-09 06:47:12,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:47:12,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:12,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:47:12,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:47:12,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:12,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:12,684 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:47:12,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:47:12,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:47:12,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:12,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:12,688 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:47:12,756 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:47:12,758 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:47:12,758 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:47:12,759 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:47:12,759 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 06:47:12,759 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:12,759 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:47:12,759 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:47:12,759 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-05.c_Iteration1_Loop [2025-03-09 06:47:12,759 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:47:12,759 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:47:12,768 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:12,782 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:12,839 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:47:12,839 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 06:47:12,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:12,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:12,843 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:12,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-09 06:47:12,849 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 06:47:12,849 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:47:12,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-03-09 06:47:12,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:12,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:12,883 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:12,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-09 06:47:12,886 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 06:47:12,887 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 06:47:12,917 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 06:47:12,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-03-09 06:47:12,921 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:47:12,921 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:47:12,921 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:47:12,921 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:47:12,921 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:47:12,921 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:12,921 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:47:12,921 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:47:12,921 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-05.c_Iteration1_Loop [2025-03-09 06:47:12,921 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:47:12,921 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:47:12,923 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:12,932 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:47:12,997 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:47:13,000 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:47:13,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:13,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:13,003 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:13,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-09 06:47:13,006 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:47:13,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:13,018 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:47:13,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:13,019 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-09 06:47:13,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:13,024 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-09 06:47:13,024 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:47:13,030 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:47:13,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-03-09 06:47:13,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:13,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:13,038 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:13,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-09 06:47:13,040 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:47:13,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:47:13,051 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:47:13,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:47:13,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:47:13,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:47:13,052 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:47:13,052 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:47:13,056 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:47:13,059 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-03-09 06:47:13,064 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-09 06:47:13,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:47:13,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:47:13,067 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:47:13,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-09 06:47:13,069 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:47:13,069 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 06:47:13,069 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:47:13,069 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-03-09 06:47:13,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-03-09 06:47:13,077 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 06:47:13,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:13,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:47:13,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:47:13,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:13,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:47:13,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:47:13,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:47:13,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:47:13,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:47:13,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:13,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:47:13,116 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:47:13,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:47:13,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:47:13,158 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-09 06:47:13,159 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-03-09 06:47:13,195 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 24 states and 35 transitions. Complement of second has 5 states. [2025-03-09 06:47:13,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-09 06:47:13,202 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-03-09 06:47:13,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2025-03-09 06:47:13,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 2 letters. Loop has 2 letters. [2025-03-09 06:47:13,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:47:13,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 2 letters. [2025-03-09 06:47:13,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:47:13,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 2 letters. Loop has 4 letters. [2025-03-09 06:47:13,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:47:13,212 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2025-03-09 06:47:13,213 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-09 06:47:13,216 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 16 states and 23 transitions. [2025-03-09 06:47:13,217 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-03-09 06:47:13,217 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2025-03-09 06:47:13,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 23 transitions. [2025-03-09 06:47:13,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:47:13,218 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 23 transitions. [2025-03-09 06:47:13,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 23 transitions. [2025-03-09 06:47:13,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 12. [2025-03-09 06:47:13,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:47:13,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2025-03-09 06:47:13,237 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2025-03-09 06:47:13,238 INFO L432 stractBuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2025-03-09 06:47:13,238 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-09 06:47:13,238 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2025-03-09 06:47:13,238 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-09 06:47:13,239 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:47:13,239 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:47:13,239 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-09 06:47:13,239 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-09 06:47:13,239 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_~y~0#1, main_~x~0#1;havoc main_~y~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;main_~y~0#1 := 0;" "assume main_~x~0#1 > 0;" "assume 1 == main_~y~0#1;" [2025-03-09 06:47:13,239 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 == main_~y~0#1 || main_~y~0#1 == 1 + main_~y~0#1;main_#t~bitwise1#1 := 1 + main_~y~0#1;" "main_~x~0#1 := main_#t~bitwise1#1;havoc main_#t~bitwise1#1;main_~x~0#1 := main_~x~0#1 - main_~y~0#1;" "assume main_~x~0#1 > 0;" "assume 1 == main_~y~0#1;" [2025-03-09 06:47:13,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:13,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1353471, now seen corresponding path program 1 times [2025-03-09 06:47:13,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:13,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909439600] [2025-03-09 06:47:13,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:47:13,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:13,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:47:13,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:47:13,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:13,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:47:13,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:47:13,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:47:13,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909439600] [2025-03-09 06:47:13,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909439600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:47:13,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:47:13,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:47:13,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725164054] [2025-03-09 06:47:13,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:47:13,283 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:47:13,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:13,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1045951, now seen corresponding path program 1 times [2025-03-09 06:47:13,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:13,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35221105] [2025-03-09 06:47:13,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:47:13,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:13,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:47:13,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:47:13,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:13,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:47:13,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:47:13,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:47:13,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35221105] [2025-03-09 06:47:13,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35221105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:47:13,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:47:13,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 06:47:13,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909543386] [2025-03-09 06:47:13,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:47:13,309 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 06:47:13,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:47:13,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:47:13,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:47:13,311 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 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-03-09 06:47:13,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:47:13,324 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2025-03-09 06:47:13,324 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2025-03-09 06:47:13,325 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2025-03-09 06:47:13,325 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 16 states and 20 transitions. [2025-03-09 06:47:13,325 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-03-09 06:47:13,325 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-03-09 06:47:13,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2025-03-09 06:47:13,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:47:13,326 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2025-03-09 06:47:13,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2025-03-09 06:47:13,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2025-03-09 06:47:13,327 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-03-09 06:47:13,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2025-03-09 06:47:13,327 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 19 transitions. [2025-03-09 06:47:13,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:47:13,328 INFO L432 stractBuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2025-03-09 06:47:13,328 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-09 06:47:13,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2025-03-09 06:47:13,328 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2025-03-09 06:47:13,328 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:47:13,328 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:47:13,329 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2025-03-09 06:47:13,329 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-09 06:47:13,329 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_~y~0#1, main_~x~0#1;havoc main_~y~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;main_~y~0#1 := 0;" "assume main_~x~0#1 > 0;" "assume !(1 == main_~y~0#1);main_~y~0#1 := 1;main_~x~0#1 := main_~x~0#1 - main_~y~0#1;" "assume main_~x~0#1 > 0;" "assume 1 == main_~y~0#1;" [2025-03-09 06:47:13,329 INFO L754 eck$LassoCheckResult]: Loop: "assume !(0 == main_~y~0#1 || main_~y~0#1 == 1 + main_~y~0#1);" "assume !(0 == 1 + main_~y~0#1);" "havoc main_#t~bitwise1#1;assume (((((main_~y~0#1 < 0 && 1 + main_~y~0#1 >= 0) || main_#t~bitwise1#1 >= 1 + main_~y~0#1) && ((main_~y~0#1 >= 0 && 1 + main_~y~0#1 < 0) || main_#t~bitwise1#1 >= main_~y~0#1)) && ((main_~y~0#1 < 0 || 1 + main_~y~0#1 < 0) || main_#t~bitwise1#1 <= main_~y~0#1 + (1 + main_~y~0#1))) && ((main_~y~0#1 >= 0 && 1 + main_~y~0#1 >= 0) || main_#t~bitwise1#1 < 0)) && main_#t~bitwise1#1 <= 2147483647;" "main_~x~0#1 := main_#t~bitwise1#1;havoc main_#t~bitwise1#1;main_~x~0#1 := main_~x~0#1 - main_~y~0#1;" "assume main_~x~0#1 > 0;" "assume 1 == main_~y~0#1;" [2025-03-09 06:47:13,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:13,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1300685053, now seen corresponding path program 1 times [2025-03-09 06:47:13,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:13,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338648938] [2025-03-09 06:47:13,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:47:13,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:13,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:47:13,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:47:13,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:13,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:13,338 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:47:13,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:47:13,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:47:13,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:13,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:13,342 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:47:13,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:13,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1153034130, now seen corresponding path program 1 times [2025-03-09 06:47:13,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:13,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895611651] [2025-03-09 06:47:13,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:47:13,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:13,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:47:13,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:47:13,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:13,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:13,349 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:47:13,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:47:13,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:47:13,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:13,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:13,354 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:47:13,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:47:13,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1547377550, now seen corresponding path program 1 times [2025-03-09 06:47:13,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:47:13,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963046632] [2025-03-09 06:47:13,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:47:13,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:47:13,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:47:13,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:47:13,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:13,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:13,362 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:47:13,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:47:13,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:47:13,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:13,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:13,368 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:47:13,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-03-09 06:47:13,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:47:13,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:47:13,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:13,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:13,468 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:47:13,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:47:13,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:47:13,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:47:13,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:47:13,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.03 06:47:13 BoogieIcfgContainer [2025-03-09 06:47:13,479 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-09 06:47:13,480 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 06:47:13,480 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 06:47:13,480 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 06:47:13,481 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:47:12" (3/4) ... [2025-03-09 06:47:13,482 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 06:47:13,483 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 06:47:13,483 INFO L158 Benchmark]: Toolchain (without parser) took 1286.38ms. Allocated memory is still 142.6MB. Free memory was 113.3MB in the beginning and 107.2MB in the end (delta: 6.1MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. [2025-03-09 06:47:13,483 INFO L158 Benchmark]: CDTParser took 0.69ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:47:13,484 INFO L158 Benchmark]: CACSL2BoogieTranslator took 109.56ms. Allocated memory is still 142.6MB. Free memory was 113.3MB in the beginning and 103.4MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 06:47:13,484 INFO L158 Benchmark]: Boogie Procedure Inliner took 16.13ms. Allocated memory is still 142.6MB. Free memory was 103.4MB in the beginning and 102.5MB in the end (delta: 927.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:47:13,484 INFO L158 Benchmark]: Boogie Preprocessor took 17.24ms. Allocated memory is still 142.6MB. Free memory was 102.5MB in the beginning and 101.5MB in the end (delta: 984.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:47:13,484 INFO L158 Benchmark]: IcfgBuilder took 184.65ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 90.9MB in the end (delta: 10.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 06:47:13,485 INFO L158 Benchmark]: BuchiAutomizer took 949.32ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 107.9MB in the end (delta: -17.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:47:13,485 INFO L158 Benchmark]: Witness Printer took 2.76ms. Allocated memory is still 142.6MB. Free memory was 107.9MB in the beginning and 107.2MB in the end (delta: 770.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:47:13,486 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.69ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 109.56ms. Allocated memory is still 142.6MB. Free memory was 113.3MB in the beginning and 103.4MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 16.13ms. Allocated memory is still 142.6MB. Free memory was 103.4MB in the beginning and 102.5MB in the end (delta: 927.4kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 17.24ms. Allocated memory is still 142.6MB. Free memory was 102.5MB in the beginning and 101.5MB in the end (delta: 984.3kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 184.65ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 90.9MB in the end (delta: 10.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 949.32ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 107.9MB in the end (delta: -17.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.76ms. Allocated memory is still 142.6MB. Free memory was 107.9MB in the beginning and 107.2MB in the end (delta: 770.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic) and one module whose termination is unknown.One deterministic module has affine ranking function x and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.9s and 3 iterations. TraceHistogramMax:2. Analysis of lassos took 0.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 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 [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14 mSDsluCounter, 23 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19 IncrementalHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 16 mSDtfsCounter, 19 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax100 hnf100 lsp58 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq170 hnf94 smp100 dnf137 smp100 tf109 neg100 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 29ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Unable to decide termination Buchi Automizer cannot decide termination for the following lasso because it contains the following overapproximations. Overapproximations C: y|(y+1) [21] (Reason bitwiseOr) Lasso 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_~y~0#1, main_~x~0#1;havoc main_~y~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;main_~y~0#1 := 0;" "assume main_~x~0#1 > 0;" "assume !(1 == main_~y~0#1);main_~y~0#1 := 1;main_~x~0#1 := main_~x~0#1 - main_~y~0#1;" "assume main_~x~0#1 > 0;" "assume 1 == main_~y~0#1;" Loop: "assume !(0 == main_~y~0#1 || main_~y~0#1 == 1 + main_~y~0#1);" "assume !(0 == 1 + main_~y~0#1);" "havoc main_#t~bitwise1#1;assume (((((main_~y~0#1 < 0 && 1 + main_~y~0#1 >= 0) || main_#t~bitwise1#1 >= 1 + main_~y~0#1) && ((main_~y~0#1 >= 0 && 1 + main_~y~0#1 < 0) || main_#t~bitwise1#1 >= main_~y~0#1)) && ((main_~y~0#1 < 0 || 1 + main_~y~0#1 < 0) || main_#t~bitwise1#1 <= main_~y~0#1 + (1 + main_~y~0#1))) && ((main_~y~0#1 >= 0 && 1 + main_~y~0#1 >= 0) || main_#t~bitwise1#1 < 0)) && main_#t~bitwise1#1 <= 2147483647;" "main_~x~0#1 := main_#t~bitwise1#1;havoc main_#t~bitwise1#1;main_~x~0#1 := main_~x~0#1 - main_~y~0#1;" "assume main_~x~0#1 > 0;" "assume 1 == main_~y~0#1;" RESULT: Ultimate could not prove your program: unable to determine termination [2025-03-09 06:47:13,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: UNKNOWN