./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 8fc3dc66 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-?-8fc3dc6-m [2025-03-17 19:51:53,875 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 19:51:53,930 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-17 19:51:53,932 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 19:51:53,933 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 19:51:53,933 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-17 19:51:53,953 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 19:51:53,953 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 19:51:53,954 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 19:51:53,954 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 19:51:53,954 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 19:51:53,955 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 19:51:53,955 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 19:51:53,955 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 19:51:53,955 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-17 19:51:53,955 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-17 19:51:53,955 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-17 19:51:53,955 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-17 19:51:53,955 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-17 19:51:53,955 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-17 19:51:53,956 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 19:51:53,956 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-17 19:51:53,956 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 19:51:53,956 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 19:51:53,956 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-17 19:51:53,956 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-17 19:51:53,956 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-17 19:51:53,956 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 19:51:53,956 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 19:51:53,956 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-17 19:51:53,956 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 19:51:53,956 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 19:51:53,956 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 19:51:53,956 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 19:51:53,956 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 19:51:53,956 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 19:51:53,956 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-17 19:51:53,956 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-17 19:51:54,345 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 19:51:54,356 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 19:51:54,358 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 19:51:54,359 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 19:51:54,359 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 19:51:54,360 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-17 19:51:55,467 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5f1f5783/95e75a583ba346a2a67a4dccd8e97249/FLAGb47d1aae9 [2025-03-17 19:51:55,670 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 19:51:55,670 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/Urban-WST2013-Fig2-modified1000.c [2025-03-17 19:51:55,707 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5f1f5783/95e75a583ba346a2a67a4dccd8e97249/FLAGb47d1aae9 [2025-03-17 19:51:55,726 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5f1f5783/95e75a583ba346a2a67a4dccd8e97249 [2025-03-17 19:51:55,728 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 19:51:55,730 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 19:51:55,732 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 19:51:55,732 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 19:51:55,736 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 19:51:55,737 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:51:55" (1/1) ... [2025-03-17 19:51:55,739 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1629b0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:51:55, skipping insertion in model container [2025-03-17 19:51:55,739 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:51:55" (1/1) ... [2025-03-17 19:51:55,749 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 19:51:55,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:51:55,846 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 19:51:55,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:51:55,866 INFO L204 MainTranslator]: Completed translation [2025-03-17 19:51:55,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:51:55 WrapperNode [2025-03-17 19:51:55,867 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 19:51:55,867 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 19:51:55,867 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 19:51:55,867 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 19:51:55,872 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:51:55" (1/1) ... [2025-03-17 19:51:55,875 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:51:55" (1/1) ... [2025-03-17 19:51:55,886 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 17 [2025-03-17 19:51:55,886 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 19:51:55,887 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 19:51:55,887 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 19:51:55,887 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 19:51:55,892 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:51:55" (1/1) ... [2025-03-17 19:51:55,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:51:55" (1/1) ... [2025-03-17 19:51:55,893 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:51:55" (1/1) ... [2025-03-17 19:51:55,896 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-17 19:51:55,896 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:51:55" (1/1) ... [2025-03-17 19:51:55,896 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:51:55" (1/1) ... [2025-03-17 19:51:55,897 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:51:55" (1/1) ... [2025-03-17 19:51:55,898 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:51:55" (1/1) ... [2025-03-17 19:51:55,898 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:51:55" (1/1) ... [2025-03-17 19:51:55,898 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:51:55" (1/1) ... [2025-03-17 19:51:55,899 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 19:51:55,899 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 19:51:55,899 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 19:51:55,899 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 19:51:55,901 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:51:55" (1/1) ... [2025-03-17 19:51:55,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:51:55,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:51:55,927 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-17 19:51:55,931 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-17 19:51:55,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 19:51:55,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 19:51:55,998 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 19:51:55,999 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 19:51:56,042 INFO L? ?]: Removed 3 outVars from TransFormulas that were not future-live. [2025-03-17 19:51:56,042 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 19:51:56,048 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 19:51:56,048 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 19:51:56,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:51:56 BoogieIcfgContainer [2025-03-17 19:51:56,049 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 19:51:56,050 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-17 19:51:56,050 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-17 19:51:56,055 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-17 19:51:56,056 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:51:56,056 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.03 07:51:55" (1/3) ... [2025-03-17 19:51:56,057 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@76ef1c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 07:51:56, skipping insertion in model container [2025-03-17 19:51:56,057 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:51:56,057 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:51:55" (2/3) ... [2025-03-17 19:51:56,057 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@76ef1c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 07:51:56, skipping insertion in model container [2025-03-17 19:51:56,057 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:51:56,057 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:51:56" (3/3) ... [2025-03-17 19:51:56,059 INFO L363 chiAutomizerObserver]: Analyzing ICFG Urban-WST2013-Fig2-modified1000.c [2025-03-17 19:51:56,099 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-17 19:51:56,099 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-17 19:51:56,099 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-17 19:51:56,099 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-17 19:51:56,100 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-17 19:51:56,100 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-17 19:51:56,100 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-17 19:51:56,100 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-17 19:51:56,103 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 4 states have (on average 1.5) 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-17 19:51:56,111 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:51:56,112 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:51:56,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:51:56,115 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 19:51:56,115 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:51:56,115 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-17 19:51:56,115 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 4 states have (on average 1.5) 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-17 19:51:56,116 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:51:56,116 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:51:56,116 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:51:56,116 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 19:51:56,116 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:51:56,122 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-17 19:51:56,122 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-17 19:51:56,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:51:56,127 INFO L85 PathProgramCache]: Analyzing trace with hash 35, now seen corresponding path program 1 times [2025-03-17 19:51:56,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:51:56,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709970815] [2025-03-17 19:51:56,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:51:56,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:51:56,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:51:56,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:51:56,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:51:56,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:51:56,184 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:51:56,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:51:56,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:51:56,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:51:56,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:51:56,199 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:51:56,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:51:56,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1055, now seen corresponding path program 1 times [2025-03-17 19:51:56,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:51:56,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555309251] [2025-03-17 19:51:56,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:51:56,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:51:56,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:51:56,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:51:56,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:51:56,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:51:56,272 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-17 19:51:56,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:51:56,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555309251] [2025-03-17 19:51:56,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555309251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:51:56,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:51:56,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 19:51:56,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428717538] [2025-03-17 19:51:56,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:51:56,280 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:51:56,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:51:56,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:51:56,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:51:56,306 INFO L87 Difference]: Start difference. First operand has 5 states, 4 states have (on average 1.5) 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) 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-17 19:51:56,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:51:56,324 INFO L93 Difference]: Finished difference Result 6 states and 7 transitions. [2025-03-17 19:51:56,326 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6 states and 7 transitions. [2025-03-17 19:51:56,326 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 19:51:56,330 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6 states to 4 states and 5 transitions. [2025-03-17 19:51:56,331 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2025-03-17 19:51:56,331 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2025-03-17 19:51:56,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 5 transitions. [2025-03-17 19:51:56,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:51:56,332 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4 states and 5 transitions. [2025-03-17 19:51:56,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states and 5 transitions. [2025-03-17 19:51:56,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2025-03-17 19:51:56,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:51:56,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2025-03-17 19:51:56,352 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4 states and 5 transitions. [2025-03-17 19:51:56,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:51:56,356 INFO L432 stractBuchiCegarLoop]: Abstraction has 4 states and 5 transitions. [2025-03-17 19:51:56,357 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-17 19:51:56,357 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states and 5 transitions. [2025-03-17 19:51:56,358 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 19:51:56,358 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:51:56,358 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:51:56,358 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 19:51:56,358 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 19:51:56,358 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-17 19:51:56,359 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-17 19:51:56,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:51:56,359 INFO L85 PathProgramCache]: Analyzing trace with hash 35, now seen corresponding path program 2 times [2025-03-17 19:51:56,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:51:56,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567252944] [2025-03-17 19:51:56,360 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:51:56,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:51:56,363 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:51:56,366 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:51:56,367 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:51:56,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:51:56,367 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:51:56,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:51:56,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:51:56,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:51:56,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:51:56,370 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:51:56,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:51:56,370 INFO L85 PathProgramCache]: Analyzing trace with hash 32737, now seen corresponding path program 1 times [2025-03-17 19:51:56,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:51:56,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489828714] [2025-03-17 19:51:56,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:51:56,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:51:56,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:51:56,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:51:56,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:51:56,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:51:56,411 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-17 19:51:56,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:51:56,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489828714] [2025-03-17 19:51:56,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489828714] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:51:56,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204652318] [2025-03-17 19:51:56,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:51:56,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:51:56,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:51:56,419 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-17 19:51:56,421 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-17 19:51:56,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:51:56,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:51:56,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:51:56,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:51:56,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 19:51:56,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:51:56,490 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-17 19:51:56,491 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:51:56,513 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-17 19:51:56,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204652318] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:51:56,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:51:56,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2025-03-17 19:51:56,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141518753] [2025-03-17 19:51:56,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:51:56,514 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:51:56,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:51:56,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 19:51:56,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 19:51:56,515 INFO L87 Difference]: Start difference. First operand 4 states and 5 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-17 19:51:56,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:51:56,531 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2025-03-17 19:51:56,531 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7 states and 8 transitions. [2025-03-17 19:51:56,531 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-17 19:51:56,532 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7 states to 7 states and 8 transitions. [2025-03-17 19:51:56,532 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-03-17 19:51:56,532 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-03-17 19:51:56,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2025-03-17 19:51:56,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:51:56,532 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions. [2025-03-17 19:51:56,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2025-03-17 19:51:56,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2025-03-17 19:51:56,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.1428571428571428) 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-17 19:51:56,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2025-03-17 19:51:56,533 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions. [2025-03-17 19:51:56,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 19:51:56,534 INFO L432 stractBuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2025-03-17 19:51:56,534 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-17 19:51:56,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2025-03-17 19:51:56,535 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-17 19:51:56,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:51:56,535 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:51:56,535 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 19:51:56,535 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 1, 1] [2025-03-17 19:51:56,535 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-17 19:51:56,535 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-17 19:51:56,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:51:56,536 INFO L85 PathProgramCache]: Analyzing trace with hash 35, now seen corresponding path program 3 times [2025-03-17 19:51:56,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:51:56,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805331627] [2025-03-17 19:51:56,536 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:51:56,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:51:56,539 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:51:56,539 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:51:56,539 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 19:51:56,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:51:56,539 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:51:56,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:51:56,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:51:56,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:51:56,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:51:56,541 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:51:56,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:51:56,542 INFO L85 PathProgramCache]: Analyzing trace with hash 975299743, now seen corresponding path program 2 times [2025-03-17 19:51:56,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:51:56,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108762663] [2025-03-17 19:51:56,542 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:51:56,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:51:56,546 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 2 equivalence classes. [2025-03-17 19:51:56,550 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:51:56,550 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:51:56,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:51:56,633 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-17 19:51:56,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:51:56,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108762663] [2025-03-17 19:51:56,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108762663] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:51:56,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967649741] [2025-03-17 19:51:56,634 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:51:56,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:51:56,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:51:56,636 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-17 19:51:56,638 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-17 19:51:56,656 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 2 equivalence classes. [2025-03-17 19:51:56,662 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:51:56,662 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:51:56,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:51:56,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 19:51:56,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:51:56,681 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-17 19:51:56,681 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:51:56,750 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-17 19:51:56,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967649741] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:51:56,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:51:56,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-17 19:51:56,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553183027] [2025-03-17 19:51:56,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:51:56,751 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:51:56,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:51:56,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 19:51:56,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-17 19:51:56,752 INFO L87 Difference]: Start difference. First operand 7 states and 8 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-17 19:51:56,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:51:56,778 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2025-03-17 19:51:56,778 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2025-03-17 19:51:56,779 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2025-03-17 19:51:56,779 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 14 transitions. [2025-03-17 19:51:56,779 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-03-17 19:51:56,779 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-03-17 19:51:56,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2025-03-17 19:51:56,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:51:56,779 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 14 transitions. [2025-03-17 19:51:56,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2025-03-17 19:51:56,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-03-17 19:51:56,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:51:56,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2025-03-17 19:51:56,780 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 14 transitions. [2025-03-17 19:51:56,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 19:51:56,782 INFO L432 stractBuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2025-03-17 19:51:56,782 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-17 19:51:56,782 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2025-03-17 19:51:56,782 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2025-03-17 19:51:56,782 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:51:56,782 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:51:56,782 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 19:51:56,782 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 1, 1] [2025-03-17 19:51:56,782 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-17 19:51:56,782 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-17 19:51:56,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:51:56,783 INFO L85 PathProgramCache]: Analyzing trace with hash 35, now seen corresponding path program 4 times [2025-03-17 19:51:56,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:51:56,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369162487] [2025-03-17 19:51:56,783 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:51:56,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:51:56,786 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1 statements into 2 equivalence classes. [2025-03-17 19:51:56,786 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:51:56,786 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:51:56,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:51:56,786 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:51:56,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:51:56,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:51:56,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:51:56,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:51:56,788 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:51:56,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:51:56,788 INFO L85 PathProgramCache]: Analyzing trace with hash 2106768735, now seen corresponding path program 3 times [2025-03-17 19:51:56,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:51:56,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276477423] [2025-03-17 19:51:56,788 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:51:56,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:51:56,793 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 12 statements into 6 equivalence classes. [2025-03-17 19:51:56,799 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 19:51:56,799 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-17 19:51:56,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:51:57,004 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-17 19:51:57,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:51:57,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276477423] [2025-03-17 19:51:57,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276477423] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:51:57,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027873843] [2025-03-17 19:51:57,005 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:51:57,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:51:57,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:51:57,007 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-17 19:51:57,014 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-17 19:51:57,035 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 12 statements into 6 equivalence classes. [2025-03-17 19:51:57,041 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 19:51:57,041 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-17 19:51:57,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:51:57,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 19:51:57,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:51:57,080 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-17 19:51:57,080 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:51:57,280 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-17 19:51:57,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027873843] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:51:57,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:51:57,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2025-03-17 19:51:57,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765009026] [2025-03-17 19:51:57,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:51:57,282 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:51:57,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:51:57,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 19:51:57,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-03-17 19:51:57,285 INFO L87 Difference]: Start difference. First operand 13 states and 14 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-17 19:51:57,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:51:57,327 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2025-03-17 19:51:57,327 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 26 transitions. [2025-03-17 19:51:57,328 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2025-03-17 19:51:57,328 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 26 transitions. [2025-03-17 19:51:57,328 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2025-03-17 19:51:57,328 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2025-03-17 19:51:57,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 26 transitions. [2025-03-17 19:51:57,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:51:57,328 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 26 transitions. [2025-03-17 19:51:57,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 26 transitions. [2025-03-17 19:51:57,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-17 19:51:57,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.04) internal successors, (26), 24 states have internal predecessors, (26), 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-17 19:51:57,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2025-03-17 19:51:57,329 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 26 transitions. [2025-03-17 19:51:57,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-17 19:51:57,331 INFO L432 stractBuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2025-03-17 19:51:57,331 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-17 19:51:57,331 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 26 transitions. [2025-03-17 19:51:57,332 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2025-03-17 19:51:57,332 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:51:57,332 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:51:57,332 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 19:51:57,332 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [22, 1, 1] [2025-03-17 19:51:57,332 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-17 19:51:57,332 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-17 19:51:57,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:51:57,338 INFO L85 PathProgramCache]: Analyzing trace with hash 35, now seen corresponding path program 5 times [2025-03-17 19:51:57,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:51:57,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955322387] [2025-03-17 19:51:57,338 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:51:57,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:51:57,341 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:51:57,341 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:51:57,341 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:51:57,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:51:57,341 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:51:57,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:51:57,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:51:57,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:51:57,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:51:57,342 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:51:57,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:51:57,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1725939423, now seen corresponding path program 4 times [2025-03-17 19:51:57,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:51:57,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513187813] [2025-03-17 19:51:57,343 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:51:57,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:51:57,346 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-03-17 19:51:57,363 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 19:51:57,364 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:51:57,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:51:57,800 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-17 19:51:57,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:51:57,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513187813] [2025-03-17 19:51:57,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513187813] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:51:57,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523321590] [2025-03-17 19:51:57,800 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:51:57,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:51:57,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:51:57,802 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-17 19:51:57,803 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-17 19:51:57,820 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-03-17 19:51:57,831 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 19:51:57,831 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:51:57,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:51:57,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 19:51:57,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:51:57,891 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-17 19:51:57,891 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:51:58,510 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-17 19:51:58,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523321590] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:51:58,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:51:58,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 46 [2025-03-17 19:51:58,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043909292] [2025-03-17 19:51:58,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:51:58,510 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:51:58,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:51:58,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-17 19:51:58,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-03-17 19:51:58,512 INFO L87 Difference]: Start difference. First operand 25 states and 26 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-17 19:51:58,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:51:58,567 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2025-03-17 19:51:58,567 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 50 transitions. [2025-03-17 19:51:58,568 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 48 [2025-03-17 19:51:58,568 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 50 transitions. [2025-03-17 19:51:58,568 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2025-03-17 19:51:58,568 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2025-03-17 19:51:58,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 50 transitions. [2025-03-17 19:51:58,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:51:58,569 INFO L218 hiAutomatonCegarLoop]: Abstraction has 49 states and 50 transitions. [2025-03-17 19:51:58,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 50 transitions. [2025-03-17 19:51:58,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-17 19:51:58,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 48 states have internal predecessors, (50), 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-17 19:51:58,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2025-03-17 19:51:58,570 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 50 transitions. [2025-03-17 19:51:58,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-17 19:51:58,571 INFO L432 stractBuchiCegarLoop]: Abstraction has 49 states and 50 transitions. [2025-03-17 19:51:58,571 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-17 19:51:58,571 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 50 transitions. [2025-03-17 19:51:58,572 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 48 [2025-03-17 19:51:58,572 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:51:58,572 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:51:58,572 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 19:51:58,572 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [46, 1, 1] [2025-03-17 19:51:58,572 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-17 19:51:58,572 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-17 19:51:58,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:51:58,573 INFO L85 PathProgramCache]: Analyzing trace with hash 35, now seen corresponding path program 6 times [2025-03-17 19:51:58,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:51:58,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348915483] [2025-03-17 19:51:58,573 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 19:51:58,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:51:58,575 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:51:58,575 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:51:58,575 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-17 19:51:58,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:51:58,575 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:51:58,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:51:58,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:51:58,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:51:58,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:51:58,578 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:51:58,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:51:58,579 INFO L85 PathProgramCache]: Analyzing trace with hash -470351393, now seen corresponding path program 5 times [2025-03-17 19:51:58,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:51:58,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187511148] [2025-03-17 19:51:58,580 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:51:58,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:51:58,586 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 48 statements into 24 equivalence classes. [2025-03-17 19:51:58,607 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 19:51:58,607 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2025-03-17 19:51:58,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:51:59,703 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-17 19:51:59,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:51:59,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187511148] [2025-03-17 19:51:59,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187511148] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:51:59,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219425461] [2025-03-17 19:51:59,704 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:51:59,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:51:59,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:51:59,706 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-17 19:51:59,707 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-17 19:51:59,727 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 48 statements into 24 equivalence classes. [2025-03-17 19:51:59,746 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 19:51:59,746 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2025-03-17 19:51:59,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:51:59,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-17 19:51:59,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:51:59,841 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-17 19:51:59,841 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:01,781 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-17 19:52:01,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219425461] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:01,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:01,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 94 [2025-03-17 19:52:01,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139085704] [2025-03-17 19:52:01,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:01,782 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:52:01,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:01,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-03-17 19:52:01,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-03-17 19:52:01,786 INFO L87 Difference]: Start difference. First operand 49 states and 50 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-17 19:52:01,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:01,904 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2025-03-17 19:52:01,904 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 98 transitions. [2025-03-17 19:52:01,906 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 96 [2025-03-17 19:52:01,906 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 97 states and 98 transitions. [2025-03-17 19:52:01,906 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 97 [2025-03-17 19:52:01,907 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 97 [2025-03-17 19:52:01,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 98 transitions. [2025-03-17 19:52:01,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:52:01,907 INFO L218 hiAutomatonCegarLoop]: Abstraction has 97 states and 98 transitions. [2025-03-17 19:52:01,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states and 98 transitions. [2025-03-17 19:52:01,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-03-17 19:52:01,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 97 states have (on average 1.0103092783505154) internal successors, (98), 96 states have internal predecessors, (98), 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-17 19:52:01,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2025-03-17 19:52:01,912 INFO L240 hiAutomatonCegarLoop]: Abstraction has 97 states and 98 transitions. [2025-03-17 19:52:01,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-03-17 19:52:01,913 INFO L432 stractBuchiCegarLoop]: Abstraction has 97 states and 98 transitions. [2025-03-17 19:52:01,913 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-17 19:52:01,913 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 97 states and 98 transitions. [2025-03-17 19:52:01,914 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 96 [2025-03-17 19:52:01,914 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:01,914 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:01,914 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 19:52:01,914 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [94, 1, 1] [2025-03-17 19:52:01,915 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-17 19:52:01,915 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-17 19:52:01,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:01,915 INFO L85 PathProgramCache]: Analyzing trace with hash 35, now seen corresponding path program 7 times [2025-03-17 19:52:01,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:01,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939397480] [2025-03-17 19:52:01,915 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 19:52:01,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:01,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:52:01,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:52:01,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:01,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:01,921 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:01,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:52:01,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:52:01,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:01,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:01,922 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:01,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:01,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1184532447, now seen corresponding path program 6 times [2025-03-17 19:52:01,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:01,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585102014] [2025-03-17 19:52:01,922 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 19:52:01,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:01,931 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 96 statements into 48 equivalence classes. [2025-03-17 19:52:01,975 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 19:52:01,976 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) [2025-03-17 19:52:01,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:05,359 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-17 19:52:05,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:05,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585102014] [2025-03-17 19:52:05,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585102014] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:05,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579012195] [2025-03-17 19:52:05,359 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 19:52:05,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:05,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:05,363 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-17 19:52:05,364 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-17 19:52:05,387 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 96 statements into 48 equivalence classes. [2025-03-17 19:52:05,427 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 19:52:05,427 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) [2025-03-17 19:52:05,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:05,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-03-17 19:52:05,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:05,598 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-17 19:52:05,599 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:12,529 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-17 19:52:12,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579012195] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:12,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:12,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 190 [2025-03-17 19:52:12,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763284434] [2025-03-17 19:52:12,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:12,530 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:52:12,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:12,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2025-03-17 19:52:12,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2025-03-17 19:52:12,540 INFO L87 Difference]: Start difference. First operand 97 states and 98 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-17 19:52:12,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:12,804 INFO L93 Difference]: Finished difference Result 193 states and 194 transitions. [2025-03-17 19:52:12,804 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 193 states and 194 transitions. [2025-03-17 19:52:12,806 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 192 [2025-03-17 19:52:12,808 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 193 states to 193 states and 194 transitions. [2025-03-17 19:52:12,808 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 193 [2025-03-17 19:52:12,809 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 193 [2025-03-17 19:52:12,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 193 states and 194 transitions. [2025-03-17 19:52:12,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:52:12,810 INFO L218 hiAutomatonCegarLoop]: Abstraction has 193 states and 194 transitions. [2025-03-17 19:52:12,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states and 194 transitions. [2025-03-17 19:52:12,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2025-03-17 19:52:12,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 193 states have (on average 1.005181347150259) internal successors, (194), 192 states have internal predecessors, (194), 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-17 19:52:12,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2025-03-17 19:52:12,815 INFO L240 hiAutomatonCegarLoop]: Abstraction has 193 states and 194 transitions. [2025-03-17 19:52:12,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2025-03-17 19:52:12,816 INFO L432 stractBuchiCegarLoop]: Abstraction has 193 states and 194 transitions. [2025-03-17 19:52:12,816 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-17 19:52:12,816 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 193 states and 194 transitions. [2025-03-17 19:52:12,817 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 192 [2025-03-17 19:52:12,817 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:12,817 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:12,818 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 19:52:12,818 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [190, 1, 1] [2025-03-17 19:52:12,818 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-17 19:52:12,819 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-17 19:52:12,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:12,819 INFO L85 PathProgramCache]: Analyzing trace with hash 35, now seen corresponding path program 8 times [2025-03-17 19:52:12,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:12,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500209878] [2025-03-17 19:52:12,819 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:12,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:12,821 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:52:12,821 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:52:12,821 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:52:12,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:12,822 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:12,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:52:12,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:52:12,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:12,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:12,823 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:12,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:12,823 INFO L85 PathProgramCache]: Analyzing trace with hash 565547999, now seen corresponding path program 7 times [2025-03-17 19:52:12,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:12,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649454924] [2025-03-17 19:52:12,823 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 19:52:12,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:12,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 19:52:12,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 19:52:12,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:12,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:25,186 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-17 19:52:25,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:25,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649454924] [2025-03-17 19:52:25,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649454924] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:25,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231412050] [2025-03-17 19:52:25,186 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 19:52:25,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:25,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:25,188 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-17 19:52:25,189 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-17 19:52:25,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 19:52:25,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 19:52:25,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:25,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:25,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 192 conjuncts are in the unsatisfiable core [2025-03-17 19:52:25,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:25,512 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-17 19:52:25,512 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:53,104 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-17 19:52:53,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231412050] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:53,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:53,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [191, 191, 191] total 382 [2025-03-17 19:52:53,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241057977] [2025-03-17 19:52:53,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:53,105 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:52:53,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:53,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 384 interpolants. [2025-03-17 19:52:53,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73536, Invalid=73536, Unknown=0, NotChecked=0, Total=147072 [2025-03-17 19:52:53,125 INFO L87 Difference]: Start difference. First operand 193 states and 194 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-17 19:52:54,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:54,037 INFO L93 Difference]: Finished difference Result 385 states and 386 transitions. [2025-03-17 19:52:54,037 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 385 states and 386 transitions. [2025-03-17 19:52:54,040 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 384 [2025-03-17 19:52:54,042 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 385 states to 385 states and 386 transitions. [2025-03-17 19:52:54,042 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 385 [2025-03-17 19:52:54,043 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 385 [2025-03-17 19:52:54,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 385 states and 386 transitions. [2025-03-17 19:52:54,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:52:54,044 INFO L218 hiAutomatonCegarLoop]: Abstraction has 385 states and 386 transitions. [2025-03-17 19:52:54,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states and 386 transitions. [2025-03-17 19:52:54,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2025-03-17 19:52:54,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 385 states have (on average 1.0025974025974025) internal successors, (386), 384 states have internal predecessors, (386), 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-17 19:52:54,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 386 transitions. [2025-03-17 19:52:54,052 INFO L240 hiAutomatonCegarLoop]: Abstraction has 385 states and 386 transitions. [2025-03-17 19:52:54,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 384 states. [2025-03-17 19:52:54,053 INFO L432 stractBuchiCegarLoop]: Abstraction has 385 states and 386 transitions. [2025-03-17 19:52:54,053 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-17 19:52:54,053 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 385 states and 386 transitions. [2025-03-17 19:52:54,054 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 384 [2025-03-17 19:52:54,054 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:54,054 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:54,056 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 19:52:54,056 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [382, 1, 1] [2025-03-17 19:52:54,056 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-17 19:52:54,056 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-17 19:52:54,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:54,057 INFO L85 PathProgramCache]: Analyzing trace with hash 35, now seen corresponding path program 9 times [2025-03-17 19:52:54,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:54,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531609505] [2025-03-17 19:52:54,057 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:52:54,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:54,059 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:52:54,059 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:52:54,059 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 19:52:54,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:54,060 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:54,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:52:54,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:52:54,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:54,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:54,061 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:54,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:54,062 INFO L85 PathProgramCache]: Analyzing trace with hash -818172961, now seen corresponding path program 8 times [2025-03-17 19:52:54,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:54,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280330392] [2025-03-17 19:52:54,062 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:54,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:54,073 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 384 statements into 2 equivalence classes. [2025-03-17 19:52:54,323 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 384 of 384 statements. [2025-03-17 19:52:54,323 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:52:54,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat