./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted-lit/Urban-WST2013-Fig2-modified1000.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-crafted-lit/Urban-WST2013-Fig2-modified1000.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 0b3c6d5b6497aa5ff0eb68154ec5345da59cc3565c3dc280e241d196cfa0cbf4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:35:20,418 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:35:20,463 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-04 15:35:20,466 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:35:20,467 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:35:20,467 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 15:35:20,482 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:35:20,482 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:35:20,483 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:35:20,483 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:35:20,483 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:35:20,483 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:35:20,483 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:35:20,483 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:35:20,484 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 15:35:20,484 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 15:35:20,484 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 15:35:20,484 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 15:35:20,484 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 15:35:20,484 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 15:35:20,484 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:35:20,484 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 15:35:20,484 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:35:20,484 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:35:20,484 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 15:35:20,484 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 15:35:20,484 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 15:35:20,484 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:35:20,485 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:35:20,485 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 15:35:20,485 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:35:20,485 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:35:20,485 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:35:20,485 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:35:20,485 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:35:20,485 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:35:20,485 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 15:35:20,485 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 -> 0b3c6d5b6497aa5ff0eb68154ec5345da59cc3565c3dc280e241d196cfa0cbf4 [2025-03-04 15:35:20,694 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:35:20,701 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:35:20,703 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:35:20,703 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:35:20,704 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:35:20,705 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/Urban-WST2013-Fig2-modified1000.c [2025-03-04 15:35:21,867 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f931dd101/f26db9d78a824592ba040e272ee2c208/FLAG2c86b314d [2025-03-04 15:35:22,114 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:35:22,115 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/Urban-WST2013-Fig2-modified1000.c [2025-03-04 15:35:22,124 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f931dd101/f26db9d78a824592ba040e272ee2c208/FLAG2c86b314d [2025-03-04 15:35:22,139 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f931dd101/f26db9d78a824592ba040e272ee2c208 [2025-03-04 15:35:22,141 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:35:22,142 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:35:22,143 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:35:22,143 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:35:22,146 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:35:22,147 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:35:22" (1/1) ... [2025-03-04 15:35:22,147 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@276ae0f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:35:22, skipping insertion in model container [2025-03-04 15:35:22,147 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:35:22" (1/1) ... [2025-03-04 15:35:22,158 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:35:22,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:35:22,257 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:35:22,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:35:22,276 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:35:22,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:35:22 WrapperNode [2025-03-04 15:35:22,276 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:35:22,278 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:35:22,278 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:35:22,278 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:35:22,282 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:35:22" (1/1) ... [2025-03-04 15:35:22,285 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:35:22" (1/1) ... [2025-03-04 15:35:22,296 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 17 [2025-03-04 15:35:22,297 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:35:22,297 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:35:22,298 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:35:22,298 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:35:22,303 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:35:22" (1/1) ... [2025-03-04 15:35:22,303 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:35:22" (1/1) ... [2025-03-04 15:35:22,304 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:35:22" (1/1) ... [2025-03-04 15:35:22,308 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-04 15:35:22,308 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:35:22" (1/1) ... [2025-03-04 15:35:22,308 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:35:22" (1/1) ... [2025-03-04 15:35:22,310 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:35:22" (1/1) ... [2025-03-04 15:35:22,310 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:35:22" (1/1) ... [2025-03-04 15:35:22,311 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:35:22" (1/1) ... [2025-03-04 15:35:22,312 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:35:22" (1/1) ... [2025-03-04 15:35:22,313 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:35:22,313 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:35:22,314 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:35:22,315 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:35:22,315 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:35:22" (1/1) ... [2025-03-04 15:35:22,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:35:22,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:22,346 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:35:22,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-04 15:35:22,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:35:22,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:35:22,419 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:35:22,421 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:35:22,474 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2025-03-04 15:35:22,475 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:35:22,481 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:35:22,481 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:35:22,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:35:22 BoogieIcfgContainer [2025-03-04 15:35:22,483 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:35:22,484 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 15:35:22,484 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 15:35:22,488 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 15:35:22,489 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:35:22,489 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 03:35:22" (1/3) ... [2025-03-04 15:35:22,490 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@36ecd4a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:35:22, skipping insertion in model container [2025-03-04 15:35:22,490 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:35:22,490 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:35:22" (2/3) ... [2025-03-04 15:35:22,490 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@36ecd4a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:35:22, skipping insertion in model container [2025-03-04 15:35:22,490 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:35:22,490 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:35:22" (3/3) ... [2025-03-04 15:35:22,491 INFO L363 chiAutomizerObserver]: Analyzing ICFG Urban-WST2013-Fig2-modified1000.c [2025-03-04 15:35:22,535 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 15:35:22,536 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 15:35:22,536 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 15:35:22,536 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 15:35:22,536 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 15:35:22,536 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 15:35:22,536 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 15:35:22,536 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 15:35:22,539 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:35:22,549 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:35:22,550 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:35:22,550 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:35:22,553 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:35:22,553 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:35:22,554 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 15:35:22,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:35:22,555 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:35:22,555 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:35:22,555 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:35:22,555 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:35:22,556 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:35:22,563 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~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;havoc main_#t~nondet0#1;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;havoc main_#t~nondet1#1;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" [2025-03-04 15:35:22,563 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~x1~0#1 <= 10;main_~x2~0#1 := 1000;" "assume !(main_~x2~0#1 > 1);main_~x1~0#1 := 1 + main_~x1~0#1;" [2025-03-04 15:35:22,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:22,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1184, now seen corresponding path program 1 times [2025-03-04 15:35:22,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:22,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097309565] [2025-03-04 15:35:22,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:22,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:22,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:35:22,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:35:22,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:22,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:22,631 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:35:22,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:35:22,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:35:22,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:22,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:22,644 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:35:22,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:22,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1119, now seen corresponding path program 1 times [2025-03-04 15:35:22,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:22,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292636659] [2025-03-04 15:35:22,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:22,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:22,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:35:22,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:35:22,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:22,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:22,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:35:22,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:35:22,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292636659] [2025-03-04 15:35:22,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292636659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:35:22,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:35:22,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:35:22,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550660331] [2025-03-04 15:35:22,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:35:22,732 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:35:22,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:35:22,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:35:22,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:35:22,755 INFO L87 Difference]: Start difference. First operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:35:22,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:35:22,771 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2025-03-04 15:35:22,772 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 9 transitions. [2025-03-04 15:35:22,773 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:35:22,777 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 5 states and 6 transitions. [2025-03-04 15:35:22,779 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2025-03-04 15:35:22,779 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2025-03-04 15:35:22,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 6 transitions. [2025-03-04 15:35:22,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:35:22,780 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5 states and 6 transitions. [2025-03-04 15:35:22,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states and 6 transitions. [2025-03-04 15:35:22,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2025-03-04 15:35:22,800 INFO L82 GeneralOperation]: Start removeUnreachable. 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-03-04 15:35:22,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6 transitions. [2025-03-04 15:35:22,801 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5 states and 6 transitions. [2025-03-04 15:35:22,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:35:22,805 INFO L432 stractBuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2025-03-04 15:35:22,805 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 15:35:22,805 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 6 transitions. [2025-03-04 15:35:22,806 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:35:22,806 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:35:22,806 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:35:22,806 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:35:22,806 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:35:22,806 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~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;havoc main_#t~nondet0#1;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;havoc main_#t~nondet1#1;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" [2025-03-04 15:35:22,806 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~x1~0#1 <= 10;main_~x2~0#1 := 1000;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume !(main_~x2~0#1 > 1);main_~x1~0#1 := 1 + main_~x1~0#1;" [2025-03-04 15:35:22,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:22,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1184, now seen corresponding path program 2 times [2025-03-04 15:35:22,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:22,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574553814] [2025-03-04 15:35:22,809 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:35:22,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:22,814 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:35:22,816 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:35:22,817 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:35:22,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:22,817 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:35:22,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:35:22,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:35:22,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:22,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:22,821 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:35:22,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:22,822 INFO L85 PathProgramCache]: Analyzing trace with hash 34723, now seen corresponding path program 1 times [2025-03-04 15:35:22,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:22,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552652402] [2025-03-04 15:35:22,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:22,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:22,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:35:22,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:35:22,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:22,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:22,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:35:22,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:35:22,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552652402] [2025-03-04 15:35:22,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552652402] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:35:22,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24226136] [2025-03-04 15:35:22,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:35:22,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:35:22,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:22,877 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:35:22,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 15:35:22,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:35:22,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:35:22,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:22,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:22,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 15:35:22,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:22,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:35:22,936 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:35:22,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:35:22,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24226136] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:35:22,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:35:22,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2025-03-04 15:35:22,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256905890] [2025-03-04 15:35:22,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:35:22,960 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:35:22,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:35:22,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:35:22,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:35:22,961 INFO L87 Difference]: Start difference. First operand 5 states and 6 transitions. cyclomatic complexity: 2 Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:35:22,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:35:22,978 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2025-03-04 15:35:22,978 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 9 transitions. [2025-03-04 15:35:22,978 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-04 15:35:22,979 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 8 states and 9 transitions. [2025-03-04 15:35:22,979 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-04 15:35:22,979 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-04 15:35:22,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. [2025-03-04 15:35:22,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:35:22,979 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 9 transitions. [2025-03-04 15:35:22,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. [2025-03-04 15:35:22,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2025-03-04 15:35:22,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:35:22,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2025-03-04 15:35:22,980 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 9 transitions. [2025-03-04 15:35:22,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:35:22,981 INFO L432 stractBuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2025-03-04 15:35:22,981 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-04 15:35:22,981 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2025-03-04 15:35:22,981 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-04 15:35:22,981 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:35:22,981 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:35:22,981 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:35:22,981 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 1, 1] [2025-03-04 15:35:22,981 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~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;havoc main_#t~nondet0#1;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;havoc main_#t~nondet1#1;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" [2025-03-04 15:35:22,981 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~x1~0#1 <= 10;main_~x2~0#1 := 1000;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume !(main_~x2~0#1 > 1);main_~x1~0#1 := 1 + main_~x1~0#1;" [2025-03-04 15:35:22,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:22,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1184, now seen corresponding path program 3 times [2025-03-04 15:35:22,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:22,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142199097] [2025-03-04 15:35:22,982 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:35:22,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:22,988 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:35:22,988 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:35:22,988 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:35:22,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:22,989 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:35:22,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:35:22,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:35:22,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:22,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:22,990 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:35:22,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:22,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1034466655, now seen corresponding path program 2 times [2025-03-04 15:35:22,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:22,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249593615] [2025-03-04 15:35:22,990 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:35:22,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:22,994 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 2 equivalence classes. [2025-03-04 15:35:22,997 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:35:22,998 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:35:22,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:23,054 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:35:23,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:35:23,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249593615] [2025-03-04 15:35:23,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249593615] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:35:23,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950670784] [2025-03-04 15:35:23,055 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:35:23,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:35:23,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:23,057 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:35:23,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 15:35:23,081 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 2 equivalence classes. [2025-03-04 15:35:23,085 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:35:23,086 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:35:23,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:23,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:35:23,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:23,111 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:35:23,111 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:35:23,184 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:35:23,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950670784] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:35:23,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:35:23,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 15:35:23,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700811669] [2025-03-04 15:35:23,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:35:23,185 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:35:23,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:35:23,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:35:23,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:35:23,186 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. cyclomatic complexity: 2 Second operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:35:23,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:35:23,209 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2025-03-04 15:35:23,210 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 15 transitions. [2025-03-04 15:35:23,210 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2025-03-04 15:35:23,210 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 15 transitions. [2025-03-04 15:35:23,210 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2025-03-04 15:35:23,210 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2025-03-04 15:35:23,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 15 transitions. [2025-03-04 15:35:23,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:35:23,211 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 15 transitions. [2025-03-04 15:35:23,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 15 transitions. [2025-03-04 15:35:23,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-03-04 15:35:23,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:35:23,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2025-03-04 15:35:23,212 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 15 transitions. [2025-03-04 15:35:23,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 15:35:23,212 INFO L432 stractBuchiCegarLoop]: Abstraction has 14 states and 15 transitions. [2025-03-04 15:35:23,212 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-04 15:35:23,212 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 15 transitions. [2025-03-04 15:35:23,213 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2025-03-04 15:35:23,213 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:35:23,213 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:35:23,213 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:35:23,213 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 1, 1] [2025-03-04 15:35:23,213 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~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;havoc main_#t~nondet0#1;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;havoc main_#t~nondet1#1;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" [2025-03-04 15:35:23,213 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~x1~0#1 <= 10;main_~x2~0#1 := 1000;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume !(main_~x2~0#1 > 1);main_~x1~0#1 := 1 + main_~x1~0#1;" [2025-03-04 15:35:23,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:23,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1184, now seen corresponding path program 4 times [2025-03-04 15:35:23,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:23,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227299052] [2025-03-04 15:35:23,214 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:35:23,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:23,216 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-03-04 15:35:23,217 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:35:23,217 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:35:23,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:23,217 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:35:23,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:35:23,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:35:23,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:23,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:23,218 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:35:23,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:23,219 INFO L85 PathProgramCache]: Analyzing trace with hash 82890463, now seen corresponding path program 3 times [2025-03-04 15:35:23,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:23,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21337542] [2025-03-04 15:35:23,219 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:35:23,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:23,223 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 12 statements into 6 equivalence classes. [2025-03-04 15:35:23,232 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:35:23,233 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 15:35:23,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:23,422 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:35:23,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:35:23,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21337542] [2025-03-04 15:35:23,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21337542] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:35:23,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743491813] [2025-03-04 15:35:23,422 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:35:23,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:35:23,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:23,436 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:35:23,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 15:35:23,456 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 12 statements into 6 equivalence classes. [2025-03-04 15:35:23,462 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:35:23,462 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 15:35:23,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:23,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 15:35:23,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:23,497 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:35:23,497 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:35:23,694 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:35:23,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743491813] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:35:23,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:35:23,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2025-03-04 15:35:23,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538130005] [2025-03-04 15:35:23,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:35:23,695 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:35:23,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:35:23,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 15:35:23,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-03-04 15:35:23,696 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. cyclomatic complexity: 2 Second operand has 24 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:35:23,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:35:23,722 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2025-03-04 15:35:23,722 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 27 transitions. [2025-03-04 15:35:23,723 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2025-03-04 15:35:23,723 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 27 transitions. [2025-03-04 15:35:23,723 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2025-03-04 15:35:23,724 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2025-03-04 15:35:23,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 27 transitions. [2025-03-04 15:35:23,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:35:23,724 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 27 transitions. [2025-03-04 15:35:23,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 27 transitions. [2025-03-04 15:35:23,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-03-04 15:35:23,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 25 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:35:23,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2025-03-04 15:35:23,725 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 27 transitions. [2025-03-04 15:35:23,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 15:35:23,726 INFO L432 stractBuchiCegarLoop]: Abstraction has 26 states and 27 transitions. [2025-03-04 15:35:23,726 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-04 15:35:23,726 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 27 transitions. [2025-03-04 15:35:23,726 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2025-03-04 15:35:23,727 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:35:23,727 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:35:23,727 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:35:23,727 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [22, 1, 1] [2025-03-04 15:35:23,727 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~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;havoc main_#t~nondet0#1;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;havoc main_#t~nondet1#1;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" [2025-03-04 15:35:23,727 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~x1~0#1 <= 10;main_~x2~0#1 := 1000;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume !(main_~x2~0#1 > 1);main_~x1~0#1 := 1 + main_~x1~0#1;" [2025-03-04 15:35:23,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:23,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1184, now seen corresponding path program 5 times [2025-03-04 15:35:23,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:23,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625935231] [2025-03-04 15:35:23,728 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:35:23,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:23,731 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:35:23,731 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:35:23,731 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:35:23,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:23,731 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:35:23,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:35:23,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:35:23,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:23,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:23,732 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:35:23,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:23,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1301127647, now seen corresponding path program 4 times [2025-03-04 15:35:23,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:23,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081450655] [2025-03-04 15:35:23,733 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:35:23,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:23,736 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-03-04 15:35:23,747 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 15:35:23,747 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:35:23,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:24,205 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:35:24,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:35:24,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081450655] [2025-03-04 15:35:24,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081450655] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:35:24,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638247203] [2025-03-04 15:35:24,205 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:35:24,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:35:24,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:24,209 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:35:24,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 15:35:24,227 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-03-04 15:35:24,235 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 15:35:24,235 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:35:24,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:24,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 15:35:24,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:24,292 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:35:24,292 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:35:24,951 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:35:24,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638247203] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:35:24,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:35:24,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 46 [2025-03-04 15:35:24,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695669617] [2025-03-04 15:35:24,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:35:24,952 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:35:24,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:35:24,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-04 15:35:24,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-03-04 15:35:24,954 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. cyclomatic complexity: 2 Second operand has 48 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:35:25,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:35:25,024 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2025-03-04 15:35:25,025 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 51 transitions. [2025-03-04 15:35:25,025 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 48 [2025-03-04 15:35:25,026 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 50 states and 51 transitions. [2025-03-04 15:35:25,026 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2025-03-04 15:35:25,026 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2025-03-04 15:35:25,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 51 transitions. [2025-03-04 15:35:25,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:35:25,026 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 51 transitions. [2025-03-04 15:35:25,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 51 transitions. [2025-03-04 15:35:25,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-04 15:35:25,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.02) internal successors, (51), 49 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:35:25,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2025-03-04 15:35:25,029 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 51 transitions. [2025-03-04 15:35:25,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-04 15:35:25,032 INFO L432 stractBuchiCegarLoop]: Abstraction has 50 states and 51 transitions. [2025-03-04 15:35:25,032 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-04 15:35:25,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 51 transitions. [2025-03-04 15:35:25,033 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 48 [2025-03-04 15:35:25,033 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:35:25,033 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:35:25,033 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:35:25,033 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [46, 1, 1] [2025-03-04 15:35:25,033 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~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;havoc main_#t~nondet0#1;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;havoc main_#t~nondet1#1;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" [2025-03-04 15:35:25,033 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~x1~0#1 <= 10;main_~x2~0#1 := 1000;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume !(main_~x2~0#1 > 1);main_~x1~0#1 := 1 + main_~x1~0#1;" [2025-03-04 15:35:25,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:25,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1184, now seen corresponding path program 6 times [2025-03-04 15:35:25,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:25,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638607076] [2025-03-04 15:35:25,034 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 15:35:25,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:25,036 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:35:25,036 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:35:25,036 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 15:35:25,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:25,036 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:35:25,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:35:25,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:35:25,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:25,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:25,038 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:35:25,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:25,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1902524449, now seen corresponding path program 5 times [2025-03-04 15:35:25,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:25,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964402757] [2025-03-04 15:35:25,038 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:35:25,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:25,042 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 48 statements into 24 equivalence classes. [2025-03-04 15:35:25,076 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 15:35:25,076 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2025-03-04 15:35:25,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:26,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:35:26,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:35:26,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964402757] [2025-03-04 15:35:26,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964402757] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:35:26,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291086165] [2025-03-04 15:35:26,179 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:35:26,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:35:26,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:26,181 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:35:26,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 15:35:26,201 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 48 statements into 24 equivalence classes. [2025-03-04 15:35:26,219 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 15:35:26,219 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2025-03-04 15:35:26,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:26,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-04 15:35:26,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:26,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:35:26,306 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:35:28,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:35:28,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291086165] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:35:28,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:35:28,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 94 [2025-03-04 15:35:28,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257119163] [2025-03-04 15:35:28,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:35:28,206 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:35:28,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:35:28,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-03-04 15:35:28,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-03-04 15:35:28,210 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. cyclomatic complexity: 2 Second operand has 96 states, 95 states have (on average 1.0105263157894737) internal successors, (96), 95 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:35:28,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:35:28,347 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2025-03-04 15:35:28,348 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 99 transitions. [2025-03-04 15:35:28,349 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 96 [2025-03-04 15:35:28,352 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 98 states and 99 transitions. [2025-03-04 15:35:28,353 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98 [2025-03-04 15:35:28,353 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 98 [2025-03-04 15:35:28,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 99 transitions. [2025-03-04 15:35:28,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:35:28,353 INFO L218 hiAutomatonCegarLoop]: Abstraction has 98 states and 99 transitions. [2025-03-04 15:35:28,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 99 transitions. [2025-03-04 15:35:28,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-03-04 15:35:28,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 98 states have (on average 1.010204081632653) internal successors, (99), 97 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:35:28,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2025-03-04 15:35:28,359 INFO L240 hiAutomatonCegarLoop]: Abstraction has 98 states and 99 transitions. [2025-03-04 15:35:28,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-03-04 15:35:28,360 INFO L432 stractBuchiCegarLoop]: Abstraction has 98 states and 99 transitions. [2025-03-04 15:35:28,362 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-04 15:35:28,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 99 transitions. [2025-03-04 15:35:28,363 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 96 [2025-03-04 15:35:28,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:35:28,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:35:28,363 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:35:28,363 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [94, 1, 1] [2025-03-04 15:35:28,364 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~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;havoc main_#t~nondet0#1;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;havoc main_#t~nondet1#1;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" [2025-03-04 15:35:28,364 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~x1~0#1 <= 10;main_~x2~0#1 := 1000;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume !(main_~x2~0#1 > 1);main_~x1~0#1 := 1 + main_~x1~0#1;" [2025-03-04 15:35:28,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:28,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1184, now seen corresponding path program 7 times [2025-03-04 15:35:28,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:28,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387120179] [2025-03-04 15:35:28,366 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 15:35:28,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:28,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:35:28,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:35:28,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:28,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:28,368 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:35:28,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:35:28,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:35:28,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:28,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:28,369 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:35:28,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:28,369 INFO L85 PathProgramCache]: Analyzing trace with hash 2096894943, now seen corresponding path program 6 times [2025-03-04 15:35:28,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:28,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559881523] [2025-03-04 15:35:28,369 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 15:35:28,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:28,380 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 96 statements into 48 equivalence classes. [2025-03-04 15:35:28,435 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 15:35:28,436 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) [2025-03-04 15:35:28,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:31,692 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:35:31,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:35:31,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559881523] [2025-03-04 15:35:31,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559881523] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:35:31,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932249030] [2025-03-04 15:35:31,693 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 15:35:31,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:35:31,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:31,694 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:35:31,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 15:35:31,728 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 96 statements into 48 equivalence classes. [2025-03-04 15:35:31,766 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 15:35:31,766 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) [2025-03-04 15:35:31,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:31,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-03-04 15:35:31,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:31,912 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:35:31,912 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:35:38,693 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:35:38,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932249030] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:35:38,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:35:38,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 190 [2025-03-04 15:35:38,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350556937] [2025-03-04 15:35:38,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:35:38,694 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:35:38,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:35:38,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2025-03-04 15:35:38,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2025-03-04 15:35:38,702 INFO L87 Difference]: Start difference. First operand 98 states and 99 transitions. cyclomatic complexity: 2 Second operand has 192 states, 191 states have (on average 1.0052356020942408) internal successors, (192), 191 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:35:38,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:35:38,958 INFO L93 Difference]: Finished difference Result 194 states and 195 transitions. [2025-03-04 15:35:38,958 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 194 states and 195 transitions. [2025-03-04 15:35:38,960 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 192 [2025-03-04 15:35:38,961 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 194 states to 194 states and 195 transitions. [2025-03-04 15:35:38,961 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 194 [2025-03-04 15:35:38,961 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 194 [2025-03-04 15:35:38,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 194 states and 195 transitions. [2025-03-04 15:35:38,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:35:38,962 INFO L218 hiAutomatonCegarLoop]: Abstraction has 194 states and 195 transitions. [2025-03-04 15:35:38,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states and 195 transitions. [2025-03-04 15:35:38,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2025-03-04 15:35:38,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 194 states have (on average 1.0051546391752577) internal successors, (195), 193 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:35:38,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 195 transitions. [2025-03-04 15:35:38,967 INFO L240 hiAutomatonCegarLoop]: Abstraction has 194 states and 195 transitions. [2025-03-04 15:35:38,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2025-03-04 15:35:38,968 INFO L432 stractBuchiCegarLoop]: Abstraction has 194 states and 195 transitions. [2025-03-04 15:35:38,968 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-04 15:35:38,968 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 194 states and 195 transitions. [2025-03-04 15:35:38,969 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 192 [2025-03-04 15:35:38,969 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:35:38,969 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:35:38,970 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:35:38,970 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [190, 1, 1] [2025-03-04 15:35:38,970 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~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;havoc main_#t~nondet0#1;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;havoc main_#t~nondet1#1;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" [2025-03-04 15:35:38,970 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~x1~0#1 <= 10;main_~x2~0#1 := 1000;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume !(main_~x2~0#1 > 1);main_~x1~0#1 := 1 + main_~x1~0#1;" [2025-03-04 15:35:38,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:38,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1184, now seen corresponding path program 8 times [2025-03-04 15:35:38,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:38,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970847140] [2025-03-04 15:35:38,971 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:35:38,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:38,973 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:35:38,973 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:35:38,973 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:35:38,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:38,973 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:35:38,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:35:38,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:35:38,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:38,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:35:38,974 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:35:38,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:35:38,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1927850975, now seen corresponding path program 7 times [2025-03-04 15:35:38,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:35:38,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573831874] [2025-03-04 15:35:38,974 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 15:35:38,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:35:38,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-04 15:35:39,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-04 15:35:39,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:39,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:50,813 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:35:50,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:35:50,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573831874] [2025-03-04 15:35:50,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573831874] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:35:50,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218714915] [2025-03-04 15:35:50,814 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 15:35:50,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:35:50,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:35:50,816 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:35:50,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 15:35:50,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-04 15:35:50,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-04 15:35:50,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:35:50,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:35:50,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 192 conjuncts are in the unsatisfiable core [2025-03-04 15:35:50,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:35:51,159 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:35:51,159 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:36:18,075 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:36:18,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218714915] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:36:18,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:36:18,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [191, 191, 191] total 382 [2025-03-04 15:36:18,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313707061] [2025-03-04 15:36:18,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:36:18,076 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:36:18,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:36:18,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 384 interpolants. [2025-03-04 15:36:18,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73536, Invalid=73536, Unknown=0, NotChecked=0, Total=147072 [2025-03-04 15:36:18,093 INFO L87 Difference]: Start difference. First operand 194 states and 195 transitions. cyclomatic complexity: 2 Second operand has 384 states, 383 states have (on average 1.0026109660574412) internal successors, (384), 383 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:36:19,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:36:19,107 INFO L93 Difference]: Finished difference Result 386 states and 387 transitions. [2025-03-04 15:36:19,107 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 386 states and 387 transitions. [2025-03-04 15:36:19,109 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 384 [2025-03-04 15:36:19,110 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 386 states to 386 states and 387 transitions. [2025-03-04 15:36:19,110 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 386 [2025-03-04 15:36:19,111 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 386 [2025-03-04 15:36:19,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 386 states and 387 transitions. [2025-03-04 15:36:19,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:36:19,112 INFO L218 hiAutomatonCegarLoop]: Abstraction has 386 states and 387 transitions. [2025-03-04 15:36:19,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states and 387 transitions. [2025-03-04 15:36:19,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2025-03-04 15:36:19,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 386 states have (on average 1.0025906735751295) internal successors, (387), 385 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:36:19,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 387 transitions. [2025-03-04 15:36:19,125 INFO L240 hiAutomatonCegarLoop]: Abstraction has 386 states and 387 transitions. [2025-03-04 15:36:19,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 384 states. [2025-03-04 15:36:19,125 INFO L432 stractBuchiCegarLoop]: Abstraction has 386 states and 387 transitions. [2025-03-04 15:36:19,125 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-04 15:36:19,125 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 386 states and 387 transitions. [2025-03-04 15:36:19,127 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 384 [2025-03-04 15:36:19,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:19,127 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:19,130 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:36:19,130 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [382, 1, 1] [2025-03-04 15:36:19,130 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~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;havoc main_#t~nondet0#1;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;havoc main_#t~nondet1#1;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" [2025-03-04 15:36:19,130 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~x1~0#1 <= 10;main_~x2~0#1 := 1000;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume !(main_~x2~0#1 > 1);main_~x1~0#1 := 1 + main_~x1~0#1;" [2025-03-04 15:36:19,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:19,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1184, now seen corresponding path program 9 times [2025-03-04 15:36:19,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:19,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152716948] [2025-03-04 15:36:19,134 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:36:19,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:19,135 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:36:19,136 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:36:19,136 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:36:19,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:19,136 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:19,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:36:19,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:36:19,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:19,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:19,137 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:19,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:19,137 INFO L85 PathProgramCache]: Analyzing trace with hash 56744927, now seen corresponding path program 8 times [2025-03-04 15:36:19,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:19,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947576360] [2025-03-04 15:36:19,137 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:36:19,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:19,147 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 384 statements into 2 equivalence classes. [2025-03-04 15:36:19,414 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 384 of 384 statements. [2025-03-04 15:36:19,414 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:36:19,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat