./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 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8852ba39-7fed-41a3-8495-294eb9c676bb/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8852ba39-7fed-41a3-8495-294eb9c676bb/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8852ba39-7fed-41a3-8495-294eb9c676bb/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8852ba39-7fed-41a3-8495-294eb9c676bb/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted-lit/Urban-WST2013-Fig2-modified1000.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8852ba39-7fed-41a3-8495-294eb9c676bb/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8852ba39-7fed-41a3-8495-294eb9c676bb/bin/uautomizer-verify-LYvppIcaGC --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-dev-6497de0 [2024-11-23 23:50:37,607 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 23:50:37,737 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8852ba39-7fed-41a3-8495-294eb9c676bb/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-23 23:50:37,748 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 23:50:37,750 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 23:50:37,791 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 23:50:37,793 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 23:50:37,793 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 23:50:37,794 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 23:50:37,794 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 23:50:37,796 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 23:50:37,796 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 23:50:37,796 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 23:50:37,796 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-23 23:50:37,797 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-23 23:50:37,797 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-23 23:50:37,798 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-23 23:50:37,798 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-23 23:50:37,798 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-23 23:50:37,798 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 23:50:37,798 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-23 23:50:37,798 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-23 23:50:37,799 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 23:50:37,799 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-23 23:50:37,799 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-23 23:50:37,799 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-23 23:50:37,799 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-23 23:50:37,799 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-23 23:50:37,799 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-23 23:50:37,799 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-23 23:50:37,800 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 23:50:37,800 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 23:50:37,800 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 23:50:37,800 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 23:50:37,800 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL_NO_AM [2024-11-23 23:50:37,800 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-23 23:50:37,800 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8852ba39-7fed-41a3-8495-294eb9c676bb/bin/uautomizer-verify-LYvppIcaGC 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 [2024-11-23 23:50:38,212 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 23:50:38,222 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 23:50:38,229 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 23:50:38,230 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 23:50:38,231 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 23:50:38,234 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8852ba39-7fed-41a3-8495-294eb9c676bb/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/termination-crafted-lit/Urban-WST2013-Fig2-modified1000.c [2024-11-23 23:50:41,346 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8852ba39-7fed-41a3-8495-294eb9c676bb/bin/uautomizer-verify-LYvppIcaGC/data/524124808/98c0e32a162b4aab9ef4b8a8a7389ec5/FLAGf266ed42d [2024-11-23 23:50:41,619 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 23:50:41,620 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8852ba39-7fed-41a3-8495-294eb9c676bb/sv-benchmarks/c/termination-crafted-lit/Urban-WST2013-Fig2-modified1000.c [2024-11-23 23:50:41,631 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8852ba39-7fed-41a3-8495-294eb9c676bb/bin/uautomizer-verify-LYvppIcaGC/data/524124808/98c0e32a162b4aab9ef4b8a8a7389ec5/FLAGf266ed42d [2024-11-23 23:50:41,655 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8852ba39-7fed-41a3-8495-294eb9c676bb/bin/uautomizer-verify-LYvppIcaGC/data/524124808/98c0e32a162b4aab9ef4b8a8a7389ec5 [2024-11-23 23:50:41,658 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 23:50:41,659 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 23:50:41,661 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 23:50:41,661 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 23:50:41,667 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 23:50:41,667 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:50:41" (1/1) ... [2024-11-23 23:50:41,671 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e08c8c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:50:41, skipping insertion in model container [2024-11-23 23:50:41,671 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:50:41" (1/1) ... [2024-11-23 23:50:41,686 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 23:50:41,858 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 23:50:41,863 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 23:50:41,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 23:50:41,891 INFO L204 MainTranslator]: Completed translation [2024-11-23 23:50:41,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:50:41 WrapperNode [2024-11-23 23:50:41,892 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 23:50:41,893 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 23:50:41,893 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 23:50:41,893 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 23:50:41,900 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:50:41" (1/1) ... [2024-11-23 23:50:41,904 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:50:41" (1/1) ... [2024-11-23 23:50:41,921 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2024-11-23 23:50:41,921 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 23:50:41,922 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 23:50:41,922 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 23:50:41,923 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 23:50:41,932 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:50:41" (1/1) ... [2024-11-23 23:50:41,932 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:50:41" (1/1) ... [2024-11-23 23:50:41,933 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:50:41" (1/1) ... [2024-11-23 23:50:41,941 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-23 23:50:41,942 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:50:41" (1/1) ... [2024-11-23 23:50:41,942 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:50:41" (1/1) ... [2024-11-23 23:50:41,944 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:50:41" (1/1) ... [2024-11-23 23:50:41,946 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:50:41" (1/1) ... [2024-11-23 23:50:41,952 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:50:41" (1/1) ... [2024-11-23 23:50:41,953 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:50:41" (1/1) ... [2024-11-23 23:50:41,954 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:50:41" (1/1) ... [2024-11-23 23:50:41,956 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 23:50:41,957 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 23:50:41,959 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 23:50:41,959 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 23:50:41,964 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:50:41" (1/1) ... [2024-11-23 23:50:41,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 23:50:41,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8852ba39-7fed-41a3-8495-294eb9c676bb/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:50:42,019 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8852ba39-7fed-41a3-8495-294eb9c676bb/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 23:50:42,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8852ba39-7fed-41a3-8495-294eb9c676bb/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-23 23:50:42,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 23:50:42,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 23:50:42,130 INFO L234 CfgBuilder]: Building ICFG [2024-11-23 23:50:42,131 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 23:50:42,206 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-11-23 23:50:42,207 INFO L283 CfgBuilder]: Performing block encoding [2024-11-23 23:50:42,218 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 23:50:42,219 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-23 23:50:42,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:50:42 BoogieIcfgContainer [2024-11-23 23:50:42,220 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 23:50:42,221 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-23 23:50:42,221 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-23 23:50:42,228 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-23 23:50:42,229 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-23 23:50:42,229 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 11:50:41" (1/3) ... [2024-11-23 23:50:42,230 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d73d95f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 11:50:42, skipping insertion in model container [2024-11-23 23:50:42,231 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-23 23:50:42,231 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:50:41" (2/3) ... [2024-11-23 23:50:42,231 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d73d95f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 11:50:42, skipping insertion in model container [2024-11-23 23:50:42,232 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-23 23:50:42,233 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:50:42" (3/3) ... [2024-11-23 23:50:42,234 INFO L363 chiAutomizerObserver]: Analyzing ICFG Urban-WST2013-Fig2-modified1000.c [2024-11-23 23:50:42,291 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-23 23:50:42,291 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-23 23:50:42,291 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-23 23:50:42,291 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-23 23:50:42,291 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-23 23:50:42,292 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-23 23:50:42,292 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-23 23:50:42,292 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-23 23:50:42,296 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:50:42,312 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-23 23:50:42,312 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 23:50:42,312 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 23:50:42,317 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-23 23:50:42,319 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-23 23:50:42,320 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-23 23:50:42,320 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:50:42,321 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-23 23:50:42,321 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 23:50:42,321 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 23:50:42,322 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-23 23:50:42,322 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-23 23:50:42,327 INFO L747 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;" [2024-11-23 23:50:42,328 INFO L749 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;" [2024-11-23 23:50:42,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:50:42,333 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-23 23:50:42,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-23 23:50:42,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081667657] [2024-11-23 23:50:42,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:50:42,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:50:42,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 23:50:42,418 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 23:50:42,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 23:50:42,446 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-23 23:50:42,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:50:42,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1174027, now seen corresponding path program 1 times [2024-11-23 23:50:42,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-23 23:50:42,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802522477] [2024-11-23 23:50:42,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:50:42,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:50:42,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:50:42,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-23 23:50:42,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802522477] [2024-11-23 23:50:42,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802522477] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:50:42,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892478213] [2024-11-23 23:50:42,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:50:42,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:50:42,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8852ba39-7fed-41a3-8495-294eb9c676bb/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:50:42,572 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8852ba39-7fed-41a3-8495-294eb9c676bb/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:50:42,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8852ba39-7fed-41a3-8495-294eb9c676bb/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-23 23:50:42,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:50:42,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 23:50:42,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:50:42,629 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:50:42,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892478213] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:50:42,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:50:42,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2024-11-23 23:50:42,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430867893] [2024-11-23 23:50:42,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:50:42,651 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-23 23:50:42,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-23 23:50:42,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 23:50:42,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-23 23:50:42,677 INFO L87 Difference]: Start difference. First operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 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) [2024-11-23 23:50:42,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:50:42,709 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2024-11-23 23:50:42,710 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 15 transitions. [2024-11-23 23:50:42,711 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-23 23:50:42,716 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 11 transitions. [2024-11-23 23:50:42,717 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-23 23:50:42,718 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-23 23:50:42,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2024-11-23 23:50:42,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 23:50:42,719 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 11 transitions. [2024-11-23 23:50:42,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2024-11-23 23:50:42,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2024-11-23 23:50:42,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:50:42,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2024-11-23 23:50:42,746 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 11 transitions. [2024-11-23 23:50:42,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 23:50:42,751 INFO L425 stractBuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2024-11-23 23:50:42,751 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-23 23:50:42,751 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2024-11-23 23:50:42,752 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-23 23:50:42,752 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 23:50:42,752 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 23:50:42,752 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-23 23:50:42,752 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2024-11-23 23:50:42,752 INFO L747 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;" [2024-11-23 23:50:42,752 INFO L749 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_~x1~0#1 := 1 + main_~x1~0#1;" [2024-11-23 23:50:42,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:50:42,753 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-11-23 23:50:42,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-23 23:50:42,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339640203] [2024-11-23 23:50:42,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:50:42,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:50:42,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 23:50:42,756 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 23:50:42,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 23:50:42,759 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-23 23:50:42,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:50:42,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1846436115, now seen corresponding path program 1 times [2024-11-23 23:50:42,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-23 23:50:42,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241498870] [2024-11-23 23:50:42,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:50:42,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:50:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:50:42,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-23 23:50:42,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241498870] [2024-11-23 23:50:42,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241498870] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:50:42,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168279166] [2024-11-23 23:50:42,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:50:42,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:50:42,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8852ba39-7fed-41a3-8495-294eb9c676bb/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:50:42,861 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8852ba39-7fed-41a3-8495-294eb9c676bb/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:50:42,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8852ba39-7fed-41a3-8495-294eb9c676bb/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-23 23:50:42,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:50:42,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 23:50:42,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:50:42,943 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:50:43,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168279166] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:50:43,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:50:43,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-23 23:50:43,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212872590] [2024-11-23 23:50:43,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:50:43,004 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-23 23:50:43,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-23 23:50:43,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-23 23:50:43,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-23 23:50:43,006 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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) [2024-11-23 23:50:43,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:50:43,064 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2024-11-23 23:50:43,064 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 19 transitions. [2024-11-23 23:50:43,065 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2024-11-23 23:50:43,065 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 19 transitions. [2024-11-23 23:50:43,065 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2024-11-23 23:50:43,066 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-11-23 23:50:43,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 19 transitions. [2024-11-23 23:50:43,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 23:50:43,066 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 19 transitions. [2024-11-23 23:50:43,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 19 transitions. [2024-11-23 23:50:43,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-23 23:50:43,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 17 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:50:43,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2024-11-23 23:50:43,072 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 19 transitions. [2024-11-23 23:50:43,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-23 23:50:43,074 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 19 transitions. [2024-11-23 23:50:43,074 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-23 23:50:43,074 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 19 transitions. [2024-11-23 23:50:43,074 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2024-11-23 23:50:43,074 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 23:50:43,075 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 23:50:43,075 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-23 23:50:43,075 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 1, 1, 1, 1] [2024-11-23 23:50:43,075 INFO L747 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;" [2024-11-23 23:50:43,075 INFO L749 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_~x1~0#1 := 1 + main_~x1~0#1;" [2024-11-23 23:50:43,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:50:43,076 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-11-23 23:50:43,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-23 23:50:43,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186585267] [2024-11-23 23:50:43,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:50:43,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:50:43,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 23:50:43,080 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 23:50:43,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 23:50:43,082 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-23 23:50:43,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:50:43,083 INFO L85 PathProgramCache]: Analyzing trace with hash 790692643, now seen corresponding path program 2 times [2024-11-23 23:50:43,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-23 23:50:43,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987597986] [2024-11-23 23:50:43,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:50:43,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:50:43,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:50:43,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-23 23:50:43,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987597986] [2024-11-23 23:50:43,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987597986] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:50:43,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204222891] [2024-11-23 23:50:43,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:50:43,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:50:43,348 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8852ba39-7fed-41a3-8495-294eb9c676bb/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:50:43,353 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8852ba39-7fed-41a3-8495-294eb9c676bb/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:50:43,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8852ba39-7fed-41a3-8495-294eb9c676bb/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-23 23:50:43,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:50:43,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-23 23:50:43,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:50:43,460 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:50:43,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204222891] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:50:43,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:50:43,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-11-23 23:50:43,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428708561] [2024-11-23 23:50:43,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:50:43,700 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-23 23:50:43,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-23 23:50:43,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-23 23:50:43,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2024-11-23 23:50:43,702 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. cyclomatic complexity: 2 Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 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) [2024-11-23 23:50:43,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:50:43,800 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2024-11-23 23:50:43,801 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 35 transitions. [2024-11-23 23:50:43,802 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2024-11-23 23:50:43,802 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 35 transitions. [2024-11-23 23:50:43,802 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2024-11-23 23:50:43,803 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2024-11-23 23:50:43,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 35 transitions. [2024-11-23 23:50:43,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 23:50:43,804 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 35 transitions. [2024-11-23 23:50:43,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 35 transitions. [2024-11-23 23:50:43,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-23 23:50:43,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 33 states have internal predecessors, (35), 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) [2024-11-23 23:50:43,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2024-11-23 23:50:43,806 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 35 transitions. [2024-11-23 23:50:43,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-23 23:50:43,808 INFO L425 stractBuchiCegarLoop]: Abstraction has 34 states and 35 transitions. [2024-11-23 23:50:43,808 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-23 23:50:43,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 35 transitions. [2024-11-23 23:50:43,809 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2024-11-23 23:50:43,809 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 23:50:43,809 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 23:50:43,809 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-23 23:50:43,810 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [14, 14, 1, 1, 1, 1] [2024-11-23 23:50:43,810 INFO L747 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;" [2024-11-23 23:50:43,810 INFO L749 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_~x1~0#1 := 1 + main_~x1~0#1;" [2024-11-23 23:50:43,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:50:43,810 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-11-23 23:50:43,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-23 23:50:43,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625208956] [2024-11-23 23:50:43,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:50:43,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:50:43,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 23:50:43,814 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 23:50:43,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 23:50:43,816 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-23 23:50:43,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:50:43,816 INFO L85 PathProgramCache]: Analyzing trace with hash 920983363, now seen corresponding path program 3 times [2024-11-23 23:50:43,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-23 23:50:43,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345046828] [2024-11-23 23:50:43,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:50:43,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:50:43,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:50:44,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-23 23:50:44,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345046828] [2024-11-23 23:50:44,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345046828] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:50:44,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902609152] [2024-11-23 23:50:44,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:50:44,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:50:44,341 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8852ba39-7fed-41a3-8495-294eb9c676bb/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:50:44,343 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8852ba39-7fed-41a3-8495-294eb9c676bb/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:50:44,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8852ba39-7fed-41a3-8495-294eb9c676bb/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-23 23:50:44,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:50:44,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-23 23:50:44,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:50:44,490 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:50:45,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902609152] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:50:45,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:50:45,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 32 [2024-11-23 23:50:45,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358175519] [2024-11-23 23:50:45,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:50:45,153 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-23 23:50:45,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-23 23:50:45,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-23 23:50:45,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2024-11-23 23:50:45,159 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. cyclomatic complexity: 2 Second operand has 32 states, 32 states have (on average 1.9375) internal successors, (62), 32 states have internal predecessors, (62), 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) [2024-11-23 23:50:45,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:50:45,323 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2024-11-23 23:50:45,324 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 67 transitions. [2024-11-23 23:50:45,325 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2024-11-23 23:50:45,326 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 66 states and 67 transitions. [2024-11-23 23:50:45,326 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2024-11-23 23:50:45,327 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2024-11-23 23:50:45,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 67 transitions. [2024-11-23 23:50:45,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 23:50:45,327 INFO L218 hiAutomatonCegarLoop]: Abstraction has 66 states and 67 transitions. [2024-11-23 23:50:45,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 67 transitions. [2024-11-23 23:50:45,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-23 23:50:45,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 65 states have internal predecessors, (67), 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) [2024-11-23 23:50:45,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2024-11-23 23:50:45,332 INFO L240 hiAutomatonCegarLoop]: Abstraction has 66 states and 67 transitions. [2024-11-23 23:50:45,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-23 23:50:45,333 INFO L425 stractBuchiCegarLoop]: Abstraction has 66 states and 67 transitions. [2024-11-23 23:50:45,333 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-23 23:50:45,334 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 67 transitions. [2024-11-23 23:50:45,335 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2024-11-23 23:50:45,335 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 23:50:45,335 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 23:50:45,337 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-23 23:50:45,337 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [30, 30, 1, 1, 1, 1] [2024-11-23 23:50:45,338 INFO L747 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;" [2024-11-23 23:50:45,338 INFO L749 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_~x1~0#1 := 1 + main_~x1~0#1;" [2024-11-23 23:50:45,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:50:45,338 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2024-11-23 23:50:45,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-23 23:50:45,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491844407] [2024-11-23 23:50:45,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:50:45,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:50:45,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 23:50:45,345 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 23:50:45,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 23:50:45,348 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-23 23:50:45,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:50:45,349 INFO L85 PathProgramCache]: Analyzing trace with hash 514359171, now seen corresponding path program 4 times [2024-11-23 23:50:45,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-23 23:50:45,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889229490] [2024-11-23 23:50:45,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:50:45,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:50:45,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:50:46,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-23 23:50:46,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889229490] [2024-11-23 23:50:46,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889229490] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:50:46,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992471407] [2024-11-23 23:50:46,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:50:46,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:50:46,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8852ba39-7fed-41a3-8495-294eb9c676bb/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:50:46,631 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8852ba39-7fed-41a3-8495-294eb9c676bb/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:50:46,633 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8852ba39-7fed-41a3-8495-294eb9c676bb/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-23 23:50:46,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:50:46,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-23 23:50:46,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:50:46,886 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:50:48,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992471407] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:50:48,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:50:48,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 64 [2024-11-23 23:50:48,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410185015] [2024-11-23 23:50:48,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:50:48,723 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-23 23:50:48,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-23 23:50:48,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-11-23 23:50:48,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2024-11-23 23:50:48,728 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. cyclomatic complexity: 2 Second operand has 64 states, 64 states have (on average 1.96875) internal successors, (126), 64 states have internal predecessors, (126), 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) [2024-11-23 23:50:49,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:50:49,050 INFO L93 Difference]: Finished difference Result 130 states and 131 transitions. [2024-11-23 23:50:49,050 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 131 transitions. [2024-11-23 23:50:49,052 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 128 [2024-11-23 23:50:49,054 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 130 states and 131 transitions. [2024-11-23 23:50:49,054 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 130 [2024-11-23 23:50:49,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 130 [2024-11-23 23:50:49,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 130 states and 131 transitions. [2024-11-23 23:50:49,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 23:50:49,055 INFO L218 hiAutomatonCegarLoop]: Abstraction has 130 states and 131 transitions. [2024-11-23 23:50:49,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states and 131 transitions. [2024-11-23 23:50:49,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-11-23 23:50:49,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 130 states have (on average 1.0076923076923077) internal successors, (131), 129 states have internal predecessors, (131), 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) [2024-11-23 23:50:49,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 131 transitions. [2024-11-23 23:50:49,063 INFO L240 hiAutomatonCegarLoop]: Abstraction has 130 states and 131 transitions. [2024-11-23 23:50:49,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-11-23 23:50:49,064 INFO L425 stractBuchiCegarLoop]: Abstraction has 130 states and 131 transitions. [2024-11-23 23:50:49,064 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-23 23:50:49,064 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 130 states and 131 transitions. [2024-11-23 23:50:49,068 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 128 [2024-11-23 23:50:49,072 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 23:50:49,072 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 23:50:49,074 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-23 23:50:49,074 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [62, 62, 1, 1, 1, 1] [2024-11-23 23:50:49,074 INFO L747 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;" [2024-11-23 23:50:49,074 INFO L749 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_~x1~0#1 := 1 + main_~x1~0#1;" [2024-11-23 23:50:49,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:50:49,075 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2024-11-23 23:50:49,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-23 23:50:49,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076736669] [2024-11-23 23:50:49,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:50:49,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:50:49,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 23:50:49,083 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 23:50:49,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 23:50:49,086 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-23 23:50:49,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:50:49,086 INFO L85 PathProgramCache]: Analyzing trace with hash -585347069, now seen corresponding path program 5 times [2024-11-23 23:50:49,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-23 23:50:49,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584479068] [2024-11-23 23:50:49,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:50:49,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:50:49,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:50:52,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-23 23:50:52,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584479068] [2024-11-23 23:50:52,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584479068] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:50:52,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183292551] [2024-11-23 23:50:52,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:50:52,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:50:52,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8852ba39-7fed-41a3-8495-294eb9c676bb/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:50:52,403 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8852ba39-7fed-41a3-8495-294eb9c676bb/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:50:52,405 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8852ba39-7fed-41a3-8495-294eb9c676bb/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-23 23:50:52,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:50:52,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-23 23:50:52,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:50:52,761 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:50:57,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183292551] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:50:57,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:50:57,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 128 [2024-11-23 23:50:57,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895418965] [2024-11-23 23:50:57,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:50:57,927 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-23 23:50:57,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-23 23:50:57,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2024-11-23 23:50:57,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2024-11-23 23:50:57,938 INFO L87 Difference]: Start difference. First operand 130 states and 131 transitions. cyclomatic complexity: 2 Second operand has 128 states, 128 states have (on average 1.984375) internal successors, (254), 128 states have internal predecessors, (254), 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) [2024-11-23 23:50:58,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:50:58,576 INFO L93 Difference]: Finished difference Result 258 states and 259 transitions. [2024-11-23 23:50:58,576 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 258 states and 259 transitions. [2024-11-23 23:50:58,579 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 256 [2024-11-23 23:50:58,581 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 258 states to 258 states and 259 transitions. [2024-11-23 23:50:58,581 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 258 [2024-11-23 23:50:58,582 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 258 [2024-11-23 23:50:58,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 258 states and 259 transitions. [2024-11-23 23:50:58,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 23:50:58,583 INFO L218 hiAutomatonCegarLoop]: Abstraction has 258 states and 259 transitions. [2024-11-23 23:50:58,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states and 259 transitions. [2024-11-23 23:50:58,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2024-11-23 23:50:58,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 258 states have (on average 1.003875968992248) internal successors, (259), 257 states have internal predecessors, (259), 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) [2024-11-23 23:50:58,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 259 transitions. [2024-11-23 23:50:58,595 INFO L240 hiAutomatonCegarLoop]: Abstraction has 258 states and 259 transitions. [2024-11-23 23:50:58,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2024-11-23 23:50:58,596 INFO L425 stractBuchiCegarLoop]: Abstraction has 258 states and 259 transitions. [2024-11-23 23:50:58,596 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-23 23:50:58,597 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 258 states and 259 transitions. [2024-11-23 23:50:58,599 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 256 [2024-11-23 23:50:58,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 23:50:58,599 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 23:50:58,602 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-23 23:50:58,602 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [126, 126, 1, 1, 1, 1] [2024-11-23 23:50:58,602 INFO L747 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;" [2024-11-23 23:50:58,603 INFO L749 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_~x1~0#1 := 1 + main_~x1~0#1;" [2024-11-23 23:50:58,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:50:58,603 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2024-11-23 23:50:58,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-23 23:50:58,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476921895] [2024-11-23 23:50:58,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:50:58,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:50:58,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 23:50:58,606 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 23:50:58,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 23:50:58,608 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-23 23:50:58,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:50:58,609 INFO L85 PathProgramCache]: Analyzing trace with hash -2051542781, now seen corresponding path program 6 times [2024-11-23 23:50:58,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-23 23:50:58,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775351322] [2024-11-23 23:50:58,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:50:58,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:50:58,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:51:09,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-23 23:51:09,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775351322] [2024-11-23 23:51:09,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775351322] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:51:09,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257246550] [2024-11-23 23:51:09,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:51:09,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:51:09,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8852ba39-7fed-41a3-8495-294eb9c676bb/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:51:09,325 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8852ba39-7fed-41a3-8495-294eb9c676bb/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:51:09,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8852ba39-7fed-41a3-8495-294eb9c676bb/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-23 23:51:09,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:51:09,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 128 conjuncts are in the unsatisfiable core [2024-11-23 23:51:09,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:51:10,072 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:51:31,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257246550] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:51:31,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:51:31,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [129, 129, 129] total 256 [2024-11-23 23:51:31,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317332175] [2024-11-23 23:51:31,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:51:31,273 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-23 23:51:31,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-23 23:51:31,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 256 interpolants. [2024-11-23 23:51:31,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32640, Invalid=32640, Unknown=0, NotChecked=0, Total=65280 [2024-11-23 23:51:31,293 INFO L87 Difference]: Start difference. First operand 258 states and 259 transitions. cyclomatic complexity: 2 Second operand has 256 states, 256 states have (on average 1.9921875) internal successors, (510), 256 states have internal predecessors, (510), 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) [2024-11-23 23:51:33,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:51:33,163 INFO L93 Difference]: Finished difference Result 514 states and 515 transitions. [2024-11-23 23:51:33,163 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 514 states and 515 transitions. [2024-11-23 23:51:33,168 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 512 [2024-11-23 23:51:33,171 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 514 states to 514 states and 515 transitions. [2024-11-23 23:51:33,171 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 514 [2024-11-23 23:51:33,172 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 514 [2024-11-23 23:51:33,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 514 states and 515 transitions. [2024-11-23 23:51:33,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 23:51:33,174 INFO L218 hiAutomatonCegarLoop]: Abstraction has 514 states and 515 transitions. [2024-11-23 23:51:33,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states and 515 transitions. [2024-11-23 23:51:33,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 514. [2024-11-23 23:51:33,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 514 states have (on average 1.0019455252918288) internal successors, (515), 513 states have internal predecessors, (515), 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) [2024-11-23 23:51:33,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 515 transitions. [2024-11-23 23:51:33,197 INFO L240 hiAutomatonCegarLoop]: Abstraction has 514 states and 515 transitions. [2024-11-23 23:51:33,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 256 states. [2024-11-23 23:51:33,203 INFO L425 stractBuchiCegarLoop]: Abstraction has 514 states and 515 transitions. [2024-11-23 23:51:33,203 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-23 23:51:33,203 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 514 states and 515 transitions. [2024-11-23 23:51:33,210 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 512 [2024-11-23 23:51:33,210 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 23:51:33,210 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 23:51:33,219 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-23 23:51:33,219 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [254, 254, 1, 1, 1, 1] [2024-11-23 23:51:33,219 INFO L747 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;" [2024-11-23 23:51:33,220 INFO L749 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_~x1~0#1 := 1 + main_~x1~0#1;" [2024-11-23 23:51:33,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:51:33,221 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2024-11-23 23:51:33,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-23 23:51:33,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934314545] [2024-11-23 23:51:33,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:51:33,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:51:33,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 23:51:33,224 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 23:51:33,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 23:51:33,226 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-23 23:51:33,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:51:33,227 INFO L85 PathProgramCache]: Analyzing trace with hash 96416515, now seen corresponding path program 7 times [2024-11-23 23:51:33,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-23 23:51:33,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628904329] [2024-11-23 23:51:33,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:51:33,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:51:33,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:52:12,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-23 23:52:12,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628904329] [2024-11-23 23:52:12,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628904329] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:52:12,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109964895] [2024-11-23 23:52:12,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:52:12,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:52:12,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8852ba39-7fed-41a3-8495-294eb9c676bb/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:52:12,694 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8852ba39-7fed-41a3-8495-294eb9c676bb/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:52:12,696 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8852ba39-7fed-41a3-8495-294eb9c676bb/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-23 23:52:12,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:52:12,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 256 conjuncts are in the unsatisfiable core [2024-11-23 23:52:12,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:52:13,882 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:53:38,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109964895] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:53:38,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:53:38,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [257, 257, 257] total 512 [2024-11-23 23:53:38,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254757305] [2024-11-23 23:53:38,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:53:38,521 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-23 23:53:38,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-23 23:53:38,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 512 interpolants. [2024-11-23 23:53:38,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=130816, Invalid=130816, Unknown=0, NotChecked=0, Total=261632 [2024-11-23 23:53:38,561 INFO L87 Difference]: Start difference. First operand 514 states and 515 transitions. cyclomatic complexity: 2 Second operand has 512 states, 512 states have (on average 1.99609375) internal successors, (1022), 512 states have internal predecessors, (1022), 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) [2024-11-23 23:53:46,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:53:46,980 INFO L93 Difference]: Finished difference Result 1026 states and 1027 transitions. [2024-11-23 23:53:46,980 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1026 states and 1027 transitions. [2024-11-23 23:53:46,990 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1024 [2024-11-23 23:53:46,997 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1026 states to 1026 states and 1027 transitions. [2024-11-23 23:53:46,997 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1026 [2024-11-23 23:53:46,998 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1026 [2024-11-23 23:53:46,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1026 states and 1027 transitions. [2024-11-23 23:53:47,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 23:53:47,000 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1026 states and 1027 transitions. [2024-11-23 23:53:47,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states and 1027 transitions. [2024-11-23 23:53:47,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 1026. [2024-11-23 23:53:47,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1026 states, 1026 states have (on average 1.0009746588693957) internal successors, (1027), 1025 states have internal predecessors, (1027), 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) [2024-11-23 23:53:47,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1027 transitions. [2024-11-23 23:53:47,037 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1026 states and 1027 transitions. [2024-11-23 23:53:47,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 512 states. [2024-11-23 23:53:47,038 INFO L425 stractBuchiCegarLoop]: Abstraction has 1026 states and 1027 transitions. [2024-11-23 23:53:47,038 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-23 23:53:47,038 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1026 states and 1027 transitions. [2024-11-23 23:53:47,043 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1024 [2024-11-23 23:53:47,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 23:53:47,044 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 23:53:47,052 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-23 23:53:47,052 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [510, 510, 1, 1, 1, 1] [2024-11-23 23:53:47,052 INFO L747 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;" [2024-11-23 23:53:47,052 INFO L749 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_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#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;" [2024-11-23 23:53:47,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:53:47,053 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2024-11-23 23:53:47,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-23 23:53:47,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729457093] [2024-11-23 23:53:47,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:53:47,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:53:47,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 23:53:47,056 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 23:53:47,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 23:53:47,057 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-23 23:53:47,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:53:47,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1056065789, now seen corresponding path program 8 times [2024-11-23 23:53:47,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-23 23:53:47,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907422866] [2024-11-23 23:53:47,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:53:47,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:53:48,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:56:48,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-23 23:56:48,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907422866] [2024-11-23 23:56:48,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907422866] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:56:48,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019922548] [2024-11-23 23:56:48,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:56:48,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:56:48,178 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8852ba39-7fed-41a3-8495-294eb9c676bb/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:56:48,183 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8852ba39-7fed-41a3-8495-294eb9c676bb/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:56:48,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8852ba39-7fed-41a3-8495-294eb9c676bb/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-23 23:56:48,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:56:48,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 1538 conjuncts, 512 conjuncts are in the unsatisfiable core [2024-11-23 23:56:48,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:56:50,285 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 00:02:51,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019922548] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-24 00:02:51,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-24 00:02:51,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [513, 513, 513] total 1001 [2024-11-24 00:02:51,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919670094] [2024-11-24 00:02:51,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-24 00:02:51,362 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-24 00:02:51,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-24 00:02:51,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 1001 interpolants. [2024-11-24 00:02:51,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=500500, Invalid=500500, Unknown=0, NotChecked=0, Total=1001000 [2024-11-24 00:02:51,508 INFO L87 Difference]: Start difference. First operand 1026 states and 1027 transitions. cyclomatic complexity: 2 Second operand has 1001 states, 1001 states have (on average 2.0) internal successors, (2002), 1001 states have internal predecessors, (2002), 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) [2024-11-24 00:03:48,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:03:48,945 INFO L93 Difference]: Finished difference Result 2004 states and 2005 transitions. [2024-11-24 00:03:48,945 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2004 states and 2005 transitions. [2024-11-24 00:03:48,957 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2002 [2024-11-24 00:03:48,966 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2004 states to 2004 states and 2005 transitions. [2024-11-24 00:03:48,966 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2004 [2024-11-24 00:03:48,968 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2004 [2024-11-24 00:03:48,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2004 states and 2005 transitions. [2024-11-24 00:03:48,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-24 00:03:48,972 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2004 states and 2005 transitions. [2024-11-24 00:03:48,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2004 states and 2005 transitions. [2024-11-24 00:03:48,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2004 to 2004. [2024-11-24 00:03:49,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2004 states, 2004 states have (on average 1.000499001996008) internal successors, (2005), 2003 states have internal predecessors, (2005), 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) [2024-11-24 00:03:49,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2004 states to 2004 states and 2005 transitions. [2024-11-24 00:03:49,008 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2004 states and 2005 transitions. [2024-11-24 00:03:49,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 1001 states. [2024-11-24 00:03:49,010 INFO L425 stractBuchiCegarLoop]: Abstraction has 2004 states and 2005 transitions. [2024-11-24 00:03:49,010 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-24 00:03:49,011 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2004 states and 2005 transitions. [2024-11-24 00:03:49,023 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2002 [2024-11-24 00:03:49,023 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-24 00:03:49,023 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-24 00:03:49,051 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-24 00:03:49,051 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [999, 999, 1, 1, 1, 1] [2024-11-24 00:03:49,051 INFO L747 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;" [2024-11-24 00:03:49,052 INFO L749 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_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#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;" [2024-11-24 00:03:49,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:03:49,054 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2024-11-24 00:03:49,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-24 00:03:49,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555229320] [2024-11-24 00:03:49,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:03:49,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:03:49,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 00:03:49,057 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-24 00:03:49,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 00:03:49,058 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-24 00:03:49,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:03:49,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1919496359, now seen corresponding path program 9 times [2024-11-24 00:03:49,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-24 00:03:49,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054886157] [2024-11-24 00:03:49,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:03:49,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:03:54,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 00:03:54,012 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-24 00:03:58,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 00:03:59,281 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-24 00:03:59,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:03:59,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1264216087, now seen corresponding path program 1 times [2024-11-24 00:03:59,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-24 00:03:59,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132438996] [2024-11-24 00:03:59,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:03:59,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:04:03,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 00:04:03,962 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-24 00:04:08,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 00:04:08,564 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace